Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem
Genetic algorithms and genetic local search are population based general-purpose search algorithms. Nevertheless, most of combinatorial optimization problems have critical requirements in their definition and are usually not easy to solve due to the difficulty in gene encoding. The traveling salesman problem is an example that requires each node to be visited exactly once. In this paper, we propose a genetic local search method with priority-based encoding. This method retains generality in applications, supports schema analysis during searching process, and is verified to gain remarkable search results for the traveling salesman problem.
KeywordsGenetic Algorithm Local Search Greedy Algorithm Travel Salesman Problem Travel Salesman Problem
Unable to display preview. Download preview PDF.
- 2.Marchiori, E., Steenbeek, A.: A genetic local search algorithm for random binary constraint satisfaction problems. In: SAC (1), pp. 458–462 (2000)Google Scholar
- 4.Zeng, Y., Wang, Y.P.: A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem. In: Proc. Fifth International Conference on Computational Intelligence and Multimedia Applications, pp. 218–222 (2003)Google Scholar
- 5.Freisleben, B., Merz, P.: A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pp. 616–621 (1996)Google Scholar
- 6.Larranaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problems: A review of representations and operators. In: Artificial Intelligence Review, vol. 13, pp. 129–170. Kluwer Academic Publishers, Netherlands (1999)Google Scholar
- 8.Reinelt, G.: TSPLIB website, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/