The ant colony optimization meta-heuristic
New ideas in optimization
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An annealing framework with learning memory
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Path planning on a cuboid using genetic algorithms
Information Sciences: an International Journal
Computers and Industrial Engineering
Solving permutational routing problems by population-based metaheuristics
Computers and Industrial Engineering
Multi-colony ant colony optimization for the node placement problem
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Using machine learning in a cooperative hybrid parallel strategy of metaheuristics
Information Sciences: an International Journal
An efficient hybrid algorithm for resource-constrained project scheduling
Information Sciences: an International Journal
Computers and Operations Research
An analysis of communication policies for homogeneous multi-colony ACO algorithms
Information Sciences: an International Journal
Information Sciences: an International Journal
Reliability evaluation and optimal design in heterogeneous multi-state series-parallel systems
Information Sciences: an International Journal
MC-ANT: a multi-colony ant algorithm
EA'09 Proceedings of the 9th international conference on Artificial evolution
Information Sciences: an International Journal
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem
Information Sciences: an International Journal
A multi-metaheuristic combined ACS-TSP system
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Solving the traveling salesman problem using cooperative genetic ant systems
Expert Systems with Applications: An International Journal
An improved multi-agent approach for solving large traveling salesman problem
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
A cooperative ant colony system and genetic algorithm for TSPs
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
A modified inver-over operator for the traveling salesman problem
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
A discrete artificial bee colony algorithm for TSP problem
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Information Sciences: an International Journal
Computers & Mathematics with Applications
A novel bio-inspired approach based on the behavior of mosquitoes
Information Sciences: an International Journal
PREACO: A fast ant colony optimization for codebook generation
Applied Soft Computing
Pheromone trail initialization with local optimal solutions in ant colony optimization
International Journal of Knowledge-based and Intelligent Engineering Systems
Hi-index | 0.00 |
This paper presents a new metaheuristic approach called ACOMAC algorithm for solving the traveling salesman problem (TSP). We introduce multiple ant clans' concept from parallel genetic algorithm to search solution space utilizing various islands to avoid local minima and thus can yield global minimum for solving the traveling salesman problem. Moreover, we present two approaches named the multiple nearest neighbor (NN) and the dual nearest neighbor (DNN) to ACOMAC to enhance large TSPs. To validate the proposed methods, numerous simulations were conducted to compare ACOMAC and Dorigo's ACS with and without the addition of the multiple nearest neighbor (NN) method or the dual nearest neighbor (DNN) approach, using a range of TSP benchmark problems. According to the results of the simulation, adding the NN or DNN approach to ACOMAC or ACS, as initial solutions, also significantly enhances the performance of ACOMAC and ACS in solving the traveling salesman problem. Meanwhile, using ACOMAC + DNN with TSP can yield better solutions than the other stated approaches. Additionally, ACOMAC or ACOMAC + NN, utilizing five ant clans with a total of 20 ants, is verified to yield better solutions. Furthermore, ACOMAC with a local weighting (w) set to 0.6 can yield better solutions in terms of length.