IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-43871-8_236.html
   My bibliography  Save this book chapter

A Hybrid Optimization Algorithm for Travelling Salesman Problem Based on Geographical Information System for Logistics Distribution

In: Liss 2014

Author

Listed:
  • Wei Gu

    (University of Science and Technology)

  • Yong Liu

    (Tobacco Company of Baotou City)

  • Lirong Wei

    (University of Science and Technology)

  • Bingkun Dong

    (University of Science and Technology)

Abstract

This paper represents a hybrid algorithm for travelling salesman problem. The main idea of the hybrid algorithm is to harness the strong global search ability of the genetic algorithm and the high local search capability of the simulated annealing algorithm. The real distance between customers has been used on the basis of GIS in order to make the result more suitable to be used in real-life. The algorithm has been tested on standard examples and it showed that the algorithm proposed in this paper has improved the results.

Suggested Citation

  • Wei Gu & Yong Liu & Lirong Wei & Bingkun Dong, 2015. "A Hybrid Optimization Algorithm for Travelling Salesman Problem Based on Geographical Information System for Logistics Distribution," Springer Books, in: Zhenji Zhang & Zuojun Max Shen & Juliang Zhang & Runtong Zhang (ed.), Liss 2014, edition 127, pages 1641-1646, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-43871-8_236
    DOI: 10.1007/978-3-662-43871-8_236
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-662-43871-8_236. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.