Memetic algorithms: a short introduction
New ideas in optimization
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Applying adaptive algorithms to epistatic domains
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A tutorial for competent memetic algorithms: model, taxonomy, and design issues
IEEE Transactions on Evolutionary Computation
An evolutionary algorithm for large traveling salesman problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Transformations of generalized ATSP into ATSP
Operations Research Letters
A new approach for solving the generalized traveling salesman problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A hybrid heuristic approach for solving the generalized traveling salesman problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject consider different variations of a memetic algorithm approach to the GTSP. The aim of this paper is to present a new memetic algorithm for GTSP with a powerful local search procedure. The experiments show that the proposed algorithm clearly outperforms all of the known heuristics with respect to both solution quality and running time. While the other memetic algorithms were designed only for the symmetric GTSP, our algorithm can solve both symmetric and asymmetric instances.