4 research outputs found
Investigating the Application of Opposition-Based Ideas to Ant Algorithms
Opposition-based learning (OBL) was recently proposed to extend di erent machine learning
algorithms. The main idea of OBL is to consider opposite estimates, actions or states
as an attempt to increase the coverage of the solution space and to reduce exploration time.
OBL has already been applied to reinforcement learning, neural networks and genetic algorithms.
This thesis explores the application of OBL to ant algorithms. Ant algorithms
are based on the trail laying and following behaviour of ants. They have been successfully
applied to many complex optimization problems. However, like any other technique, they
can benefit from performance improvements. Thus, this work was motivated by the idea of
developing more complex pheromone and path selection behaviour for the algorithm using
the concept of opposition.
This work proposes opposition-based extensions to the construction and update phases
of the ant algorithm. The modifications that focus on the solution construction include
three direct and two indirect methods. The three direct methods work by pairing the ants
and synchronizing their path selection. The two other approaches modify the decisions of
the ants by using opposite-pheromone content. The extension of the update phase lead to
an approach that performs additional pheromone updates using opposite decisions.
Experimental validation was done using two versions of the ant algorithm: the Ant
System and the Ant Colony System. The di erent OBL extensions were applied to the
Travelling Salesman Problem (TSP) and to the Grid World Problem (GWP). Results
demonstrate that the concept of opposition is not easily applied to the ant algorithm.
One pheromone-based method showed performance improvements that were statistically
significant for the TSP. The quality of the solutions increased and more optimal solutions
were found. The extension to the update phase showed some improvements for the TSP
and led to accuracy improvements and a significant speed-up for the GWP. The other
extensions showed no clear improvement.
The proposed methods for applying opposition to the ant algorithm have potential, but
more investigations are required before ant colony optimization can fully benefit from opposition.
Most importantly, fundamental theoretical work with graphs, specifically, clearly
defining opposite paths or opposite path components, is needed. Overall, the results indicate
that OBL ideas can be beneficial for ant algorithms
Using swarm intelligence for distributed job scheduling on the grid
With the rapid growth of data and computational needs, distributed systems and computational Grids are gaining more and more attention. Grids are playing an important and growing role in today networks. The huge amount of computations a Grid can fulfill in a specific time cannot be done by the best super computers. However, Grid performance can still be improved by making sure all the resources available in the Grid are utilized by a good load balancing algorithm. The purpose of such algorithms is to make sure all nodes are equally involved in Grid computations. This research proposes two new distributed swarm intelligence inspired load balancing algorithms. One is based on ant colony optimization and is called AntZ, the other one is based on particle swarm optimization and is called ParticleZ. Distributed load balancing does not incorporate a single point of failure in the system. In the AntZ algorithm, an ant is invoked in response to submitting a job to the Grid and this ant surfs the network to find the best resource to deliver the job to. In the ParticleZ algorithm, each node plays a role as a particle and moves toward other particles by sharing its workload among them. We will be simulating our proposed approaches using a Grid simulation toolkit (GridSim) dedicated to Grid simulations. The performance of the algorithms will be evaluated using several performance criteria (e.g. makespan and load balancing level). A comparison of our proposed approaches with a classical approach called State Broadcast Algorithm and two random approaches will also be provided. Experimental results show the proposed algorithms (AntZ and ParticleZ) can perform very well in a Grid environment. In particular, the use of particle swarm optimization, which has not been addressed in the literature, can yield better performance results in many scenarios than the ant colony approach
Network configuration improvement and design aid using artificial intelligence
This dissertation investigates the development of new Global system for mobile communications (GSM) improvement algorithms used to solve the nondeterministic polynomial-time hard (NP-hard) problem of assigning cells to switches. The departure of this project from previous projects is in the area of the GSM network being optimised. Most previous projects tried minimising the signalling load on the network. The main aim in this project is to reduce the operational expenditure as much as possible while still adhering to network element constraints. This is achieved by generating new network configurations with a reduced transmission cost. Since assigning cells to switches in cellular mobile networks is a NP-hard problem, exact methods cannot be used to solve it for real-size networks. In this context, heuristic approaches, evolutionary search algorithms and clustering techniques can, however, be used. This dissertation presents a comprehensive and comparative study of the above-mentioned categories of search techniques adopted specifically for GSM network improvement. The evolutionary search technique evaluated is a genetic algorithm (GA) while the unsupervised learning technique is a Gaussian mixture model (GMM). A number of custom-developed heuristic search techniques with differing goals were also experimented with. The implementation of these algorithms was tested in order to measure the quality of the solutions. Results obtained confirmed the ability of the search techniques to produce network configurations with a reduced operational expenditure while still adhering to network element constraints. The best results found were using the Gaussian mixture model where savings of up to 17% were achieved. The heuristic searches produced promising results in the form of the characteristics they portray, for example, load-balancing. Due to the massive problem space and a suboptimal chromosome representation, the genetic algorithm struggled to find high quality viable solutions. The objective of reducing network cost was achieved by performing cell-to-switch optimisation taking traffic distributions, transmission costs and network element constraints into account. These criteria cannot be divorced from each other since they are all interdependent, omitting any one of them will lead to inefficient and infeasible configurations. Results obtained further indicated that the search space consists out of two components namely, traffic and transmission cost. When optimising, it is very important to consider both components simultaneously, if not, infeasible or suboptimum solutions are generated. It was also found that pre-processing has a major impact on the cluster-forming ability of the GMM. Depending on how the pre-processing technique is set up, it is possible to bias the cluster-formation process in such a way that either transmission cost savings or a reduction in inter base station controller/switching centre traffic volume is given preference. Two of the difficult questions to answer when performing network capacity expansions are where to install the remote base station controllers (BSCs) and how to alter the existing BSC boundaries to accommodate the new BSCs being introduced. Using the techniques developed in this dissertation, these questions can now be answered with confidence.Dissertation (MEng)--University of Pretoria, 2008.Electrical, Electronic and Computer Engineeringunrestricte