53 research outputs found
H-ACO: A Heterogeneous Ant Colony Optimisation approach with Application to the Travelling Salesman Problem
This is the author accepted manuscript. The final version is available from the publisher via the link in this record.Ant Colony Optimization (ACO) is a field of study that mimics the behaviour of ants to solve computationally hard problems. The majority of research in ACO focuses on homogeneous artificial ants although animal behaviour research suggests that heterogeneity of behaviour improves the overall efficiency of ant colonies. Therefore, this paper introduces and analyses the
effects of heterogeneity of behavioural traits in ACO to solve hard optimisation problems. The developed approach implements different behaviour by introducing unique biases towards the pheromone trail and local heuristic (the next hop distance) for each ant. The well-known Ant System (AS) and Max-Min Ant System (MMAS) are used as the base algorithms to implement heterogeneity and experiments show that this method improves the performance when tested using several Travelling Salesman Problem (TSP) instances particularly for larger instances. The diversity preservation introduced by this algorithm helps balance exploration-exploitation, increases robustness with respect to parameter settings and reduces the number of algorithm parameters that need to be set.We would like to thank the Faculty of Electronics and Computer Engineering (FKEKK), Technical University of Malaysia Malacca (UTeM) and the Ministry of Higher Education (MoHE) Malaysia for the financial support under the SLAB/SlAI program
Recommended from our members
Ant Colony Optimization With Local Search for Dynamic Traveling Salesman Problems
For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle such problems due to their adaptation capabilities. It has been shown that the integration of local search operators can significantly improve the performance of ACO. In this paper, a memetic ACO algorithm, where a local search operator (called unstring and string) is integrated into ACO, is proposed to address DTSPs. The best solution from ACO is passed to the local search operator, which removes and inserts cities in such a way that improves the solution quality. The proposed memetic ACO algorithm is designed to address both symmetric and asymmetric DTSPs. The experimental results show the efficiency of the proposed memetic algorithm for addressing DTSPs in comparison with other state-of-the-art algorithms
Heterogeneous Ant Colony Optimisation Methods and their Application to the Travelling Salesman and PCB Drilling Problems
Ant Colony Optimization (ACO) is an optimization algorithm that is inspired by the foraging behaviour of real ants in locating and transporting food source to their nest. It is designed as a population-based metaheuristic and have been successfully implemented on various NP-hard problems such as the well-known Traveling Salesman Problem (TSP), Vehicle Routing Problem (VRP) and many more. However, majority of the studies in ACO focused on homogeneous artificial ants although animal behaviour researchers suggest that real ants exhibit heterogeneous behaviour thus improving the overall efficiency of the ant colonies. Equally important is that most, if not all, optimization algorithms require proper parameter tuning to achieve optimal performance. However, it is well-known that parameters are problem-dependant as different problems or even different instances have different optimal parameter settings. Parameter tuning through the testing of parameter combinations is a computationally expensive procedure that is infeasible on large-scale real-world problems. One method to mitigate this is to introduce heterogeneity by initializing the artificial agents with individual parameters rather than colony level parameters. This allows the algorithm to either actively or passively discover good parameter settings during the search. The approach undertaken in this study is to randomly initialize the ants from both uniform and Gaussian distribution respectively within a predefined range of values. The approach taken in this study is one of biological plausibility for ants with similar roles, but differing behavioural traits, which are being drawn from a mathematical distribution. This study also introduces an adaptive approach to the heterogeneous ant colony population that evolves the alpha and beta controlling parameters for ACO to locate near-optimal solutions. The adaptive approach is able to modify the exploitation and exploration characteristics of the algorithm during the search to reflect the dynamic nature of search. An empirical analysis of the proposed algorithm tested on a range of Travelling Salesman Problem (TSP) instances shows that the approach has better algorithmic performance when compared against state-of-the-art algorithms from the literature
Cooperation in self-organized heterogeneous swarms
Cooperation in self-organized heterogeneous swarms is a phenomenon from nature with many applications in autonomous robots. I specifically analyzed the problem of auto-regulated team formation in multi-agent systems and several strategies to learn socially how to make multi-objective decisions. To this end I proposed new multi-objective ranking relations and analyzed their properties theoretically and within multi-objective metaheuristics. The results showed that simple decision mechanism suffice to build effective teams of heterogeneous agents and that diversity in groups is not a problem but can increase the efficiency of multi-agent systems
Recent Advances on GPU Computing in Operations Research
Abstract-In the last decade, Graphics Processing Units (GPUs) have gained an increasing popularity as accelerators for High Performance Computing (HPC) applications. Recent GPUs are not only powerful graphics engines but also highly threaded parallel computing processors that can achieve sustainable speedup as compared with CPUs. In this context, researchers try to exploit the capability of this architecture to solve difficult problems in many domains in science and engineering. In this article, we present recent advances on GPU Computing in Operations Research. We focus in particular on Integer Programming and Linear Programming
Recent Advances on GPU Computing in Operations Research
In the last decade, Graphics Processing Units (GPUs) have gained an increasing popularity as accelerators for High Performance Computing (HPC) applications. Recent GPUs are not only powerful graphics engines but also highly threaded parallel computing processors that can achieve sustainable speedup as compared with CPUs. In this context, researchers try to exploit the capability of this architecture to solve difficult problems in many domains in science and engineering. In this article, we present recent advances on GPU Computing in Operations Research. We focus in particular on Integer Programming and Linear Programming
Traveling Salesman Problem
The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance
Recommended from our members
A survey of swarm intelligence for dynamic optimization: algorithms and applications
Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given
Hybrid meta-heuristics for combinatorial optimization
Combinatorial optimization problems arise, in many forms, in vari- ous aspects of everyday life. Nowadays, a lot of services are driven by optimization algorithms, enabling us to make the best use of the available resources while guaranteeing a level of service. Ex- amples of such services are public transportation, goods delivery, university time-tabling, and patient scheduling.
Thanks also to the open data movement, a lot of usage data about public and private services is accessible today, sometimes in aggregate form, to everyone. Examples of such data are traffic information (Google), bike sharing systems usage (CitiBike NYC), location services, etc. The availability of all this body of data allows us to better understand how people interacts with these services. However, in order for this information to be useful, it is necessary to develop tools to extract knowledge from it and to drive better decisions. In this context, optimization is a powerful tool, which can be used to improve the way the available resources are used, avoid squandering, and improve the sustainability of services.
The fields of meta-heuristics, artificial intelligence, and oper- ations research, have been tackling many of these problems for years, without much interaction. However, in the last few years, such communities have started looking at each other’s advance- ments, in order to develop optimization techniques that are faster, more robust, and easier to maintain. This effort gave birth to the fertile field of hybrid meta-heuristics.openDottorato di ricerca in Ingegneria industriale e dell'informazioneopenUrli, Tommas
- …