IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i8d10.1057_palgrave.jors.2600761.html
   My bibliography  Save this article

A tour construction heuristic for the travelling salesman problem

Author

Listed:
  • C-P Hwang

    (University of Mississippi)

  • B Alidaee

    (University of Mississippi)

  • J D Johnson

    (University of Mississippi)

Abstract

The tour construction heuristic that generates initial tours for the tour improvement heuristics plays an important role in solving the travelling salesman problem (TSP). With the help of an effective tour construction heuristic, the performance of a heuristic can be improved. In this study we present a new tour construction algorithm, the construction priority (CP). We incorporate the performance of the CP into metaheuristics such as tabu search, genetic algorithm, space smoothing, and noising methods. The performance of the CP is empirically compared with the nearest neighbour (NN) approach. Extensive computational comparison shows that the CP is considerably more effective compared to NN.

Suggested Citation

  • C-P Hwang & B Alidaee & J D Johnson, 1999. "A tour construction heuristic for the travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(8), pages 797-809, August.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:8:d:10.1057_palgrave.jors.2600761
    DOI: 10.1057/palgrave.jors.2600761
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600761
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600761?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. Charon, Irene & Hudry, Olivier, 2001. "The noising methods: A generalization of some metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 86-101, November.

    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:pal:jorsoc:v:50:y:1999:i:8:d:10.1057_palgrave.jors.2600761. 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.palgrave-journals.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.