Hybrid Chromosome Genetic Algorithm for Generalized Traveling Salesman Problems
Generalized Traveling Salesman Problem (GTSP) is one of the challenging combinatorial optimization problems in a lot of applications. In general, GTSP is more complex than Traveling Salesman Problem (TSP). In this paper, a novel hybrid chromosome genetic algorithm (HCGA), in which the hybrid binary and integer codes are adopted, is proposed as an improvement of generalized chromosome genetic algorithm (GCGA). In order to examine the effectiveness of HCGA, 16 benchmark problems are simulated. The experimental results show that HCGA can perform better than GCGA does in solving GTSP.
Unable to display preview. Download preview PDF.
- 1.Henry-Labordere, A.L.: The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem. RAIRO B 2, 43–49 (1969)Google Scholar
- 4.Easwaran, M., Pitt, J., Poslad, S.: The agent service brokering problem as a generalized travelling salesman problem. In: Proceedings of the Third Annual Conference on Autononlous Agents, Seattle WA, USA, pp. 414–415 (1999)Google Scholar
- 10.Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Working paper, University of Bologna (1993)Google Scholar