Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem

  • Jyh-Da Wei
  • D. T. Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)


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.


Genetic Algorithm Local Search Greedy Algorithm Travel Salesman Problem Travel Salesman Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Digalakis, J., Margaritis, K.: Performance comparison of memetic algorithms. Applied Mathematics and Computation 158, 237–252 (2004)MATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. 3.
    Arroyo, J., Armentano, V.: Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research 167, 717–738 (2005)MATHCrossRefMathSciNetGoogle Scholar
  4. 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. 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. 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
  7. 7.
    Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman tours. Operations Research 21, 498–516 (1973)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jyh-Da Wei
    • 1
  • D. T. Lee
    • 1
  1. 1.Institute of Information ScienceAcademia SinicaTaipeiTaiwan

Personalised recommendations