Parallelized genetic ant colony systems for solving the traveling salesman problem

Authors:
Shyi-Ming Chen;Chih-Yao Chien
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 13
Cited 2

A parallel tabu search algorithm for large traveling salesman problems

Discrete Applied Mathematics
MAX-MIN Ant system

Future Generation Computer Systems
Adaptive Selection Methods for Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Ant colony system with communication strategies

Information Sciences—Informatics and Computer Science: An International Journal
Exchange strategies for multiple Ant Colony System

Information Sciences: an International Journal
New robust and efficient ant colony algorithms: Using new interpretation of local updating process

Expert Systems with Applications: An International Journal
A Fast Elastic Net Method for Traveling Salesman Problem

ISDA '08 Proceedings of the 2008 Eighth International Conference on Intelligent Systems Design and Applications - Volume 01
Study of genetic algorithm with reinforcement learning to solve the TSP

Expert Systems with Applications: An International Journal
Multiagent optimization system for solving the traveling salesman problem (TSP)

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
A hybrid heuristic for 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
A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems

Expert Systems with Applications: An International Journal
A new genetic algorithm for the asymmetric traveling salesman problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper, we present a new method, called the parallelized genetic ant colony system (PGACS), for solving the traveling salesman problem. It consists of the genetic algorithm, including the new crossover operations and the hybrid mutation operations, and the ant colony systems with communication strategies. We also make an experiment with three classical data sets got from the TSP library to test the performance of the proposed method. The experiment results show that the performance of the proposed method is better than Chu et al.'s method (2004).