16 research outputs found
Ant colony optimisation and local search for bin-packing and cutting stock problems
The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to these problems, including Genetic Algorithms and Evolutionary Programming. In the work presented here, we used an ant colony optimization (ACO) approach to solve both Bin Packing and Cutting Stock Problems. We present a pure ACO approach, as well as an ACO approach augmented with a simple but very effective local search algorithm. It is shown that the pure ACO approach can compete with existing evolutionary methods, whereas the hybrid approach can outperform the best-known hybrid evolutionary solution methods for certain problem classes. The hybrid ACO approach is also shown to require different parameter values from the pure ACO approach and to give a more robust performance across different problems with a single set of parameter values. The local search algorithm is also run with random restarts and shown to perform significantly worse than when combined with ACO
Orthogonal methods based ant colony search for solving continuous optimization problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most
significant and promising areas in swarm computation. Although traditional ant algorithms are designed for combinatorial
optimization, they have shown great potential in solving a wide range of optimization problems, including continuous
optimization. Aimed at solving continuous problems effectively, this paper develops a novel ant algorithm termed "continuous orthogonal ant colony" (COAC), whose pheromone deposit mechanisms would enable ants to search for
solutions collaboratively and effectively. By using the orthogonal design method, ants in the feasible domain can explore
their chosen regions rapidly and e±ciently. By implementing an "adaptive regional radius" method, the proposed
algorithm can reduce the probability of being trapped in local optima and therefore enhance the global search capability and accuracy. An elitist strategy is also employed to reserve the most valuable points. The performance of the COAC is
compared with two other ant algorithms for continuous optimization of API and CACO by testing seventeen functions
in the continuous domain. The results demonstrate that the proposed COAC algorithm outperforms the others
Modelling HTTP traffic generated by community of users.
A model of the http traffic generated by a community of users connected to the Internet via a proxy cache is described. The model reproduces Internet traffic realistically and is used as input to the Internet cache simulation models developed by British Telecom research laboratories
Multiple objective ant colony optimisation
Multiple Objective Optimisation is a fast growing area of research, and consequently several Ant Colony Optimisation approaches have been proposed for a variety of these problems. In this paper, a taxonomy for Multiple Objective Ant Colony Optimisation algorithms is proposed and many existing approaches are reviewed and described using the taxonomy. The taxonomy offers guidelines for the development and use of Multiple Objective Ant Colony Optimisation algorithms