[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Simulated Evolution and Learning (SEAL 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4247))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Digalakis, J., Margaritis, K.: Performance comparison of memetic algorithms. Applied Mathematics and Computation 158, 237–252 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  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. Arroyo, J., Armentano, V.: Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research 167, 717–738 (2005)

    Article  MATH  MathSciNet  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 

  7. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman tours. Operations Research 21, 498–516 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  8. Reinelt, G.: TSPLIB website, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science, Academia Sinica, Taipei, Taiwan

    Jyh-Da Wei & D. T. Lee

Authors
  1. Jyh-Da Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. T. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Management, Cheng Shiu University, Kaohsiung County Taiwan, ROC

    Tzai-Der Wang

  2. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  3. AI-ECON Research Center, Department of Economics, National Chengchi University, 11623, Taipei, Taiwan

    Shu-Heng Chen

  4. Department of Computer Science and Technology, University of Sci. & Tech. of China, 230026, Hefei, Anhui, P.R. China

    Xufa Wang

  5. School of Information Technology and Electrical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, Australia

    Hussein Abbass

  6. The Univertity of Tokyo, Japan

    Hitoshi Iba

  7. Department of Computer, University of Science and Technology of China, 230027, Hefei, China

    Guo-Liang Chen

  8. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, JD., Lee, D.T. (2006). Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_54

Download citation

  • DOI: https://doi.org/10.1007/11903697_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47331-2

  • Online ISBN: 978-3-540-47332-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics