IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v28y2006i4p1082-1089.html
   My bibliography  Save this article

An new self-organizing maps strategy for solving the traveling salesman problem

Author

Listed:
  • Bai, Yanping
  • Zhang, Wendong
  • Jin, Zhen

Abstract

This paper presents an approach to the well-known traveling salesman problem (TSP) using self-organizing maps (SOM). There are many types of SOM algorithms to solve the TSP found in the literature, whereas the purpose of this paper is to look for the incorporation of an efficient initialization methods and the definition of a parameters adaptation law to achieve better results and a faster convergence. Aspects of parameters adaptation, selecting the number of nodes of neurons, index of winner neurons and effect of the initial ordering of the cities, as well as the initial synaptic weights of the modified SOM algorithm are discussed. The complexity of the modified SOM algorithm is analyzed. The simulated results show an average deviation of 2.32% from the optimal tour length for a set of 12 TSP instances.

Suggested Citation

  • Bai, Yanping & Zhang, Wendong & Jin, Zhen, 2006. "An new self-organizing maps strategy for solving the traveling salesman problem," Chaos, Solitons & Fractals, Elsevier, vol. 28(4), pages 1082-1089.
    • Handle: RePEc:eee:chsofr:v:28:y:2006:i:4:p:1082-1089
    DOI: 10.1016/j.chaos.2005.08.114
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077905007083
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2005.08.114?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. B. Mahadevan & S. Sivakumar & D. Dinesh Kumar & K. Ganeshram, 2013. "Redesigning Midday Meal Logistics for the Akshaya Patra Foundation: OR at Work in Feeding Hungry School Children," Interfaces, INFORMS, vol. 43(6), pages 530-546, December.
    2. Qu, Hong & Yi, Zhang, 2007. "A new algorithm for finding the shortest paths using PCNNs," Chaos, Solitons & Fractals, Elsevier, vol. 33(4), pages 1220-1229.

    More about this item

    Statistics

    Access and download statistics

    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:eee:chsofr:v:28:y:2006:i:4:p:1082-1089. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.