IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v34y2019i3p409-429.html
   My bibliography  Save this article

A new local search heuristic based on nearest insertion into the convex hull for solving Euclidean TSP

Author

Listed:
  • Mir Mohammad Alipour
  • Seyed Naser Razavi

Abstract

The travelling salesman problem (TSP) is probably the most famous and extensively studied problem in the field of combinatorial optimisation. This problem is in the fields of logistics, transportation, and distribution. Since the TSP is NP-hard, many heuristics for the TSP have been developed. In this paper, we developed a novel local search heuristic, based on nearest insertion into the convex hull construction heuristic for solving Euclidean TSP. The proposed method, nearest insertion into the convex hull local search (NICH-LS) is used to improve the initial tour, which is taken from a tour construction heuristic, multi-agent reinforcement learning (MARL) heuristic, by locally manipulating the order of nodes in the consecutive partial tours of the initial tour. Changing the order of nodes in a partial tour is done via constructing the NICH tour of these nodes and replacing the partial tour with the modified partial tour, if its length is reduced. The proposed novel local search heuristic is applied to 29 benchmark instances from TSPLIB. The computational results show the efficiency of the proposed local search compared with five state-of-the-art heuristics.

Suggested Citation

  • Mir Mohammad Alipour & Seyed Naser Razavi, 2019. "A new local search heuristic based on nearest insertion into the convex hull for solving Euclidean TSP," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 34(3), pages 409-429.
    • Handle: RePEc:ids:ijores:v:34:y:2019:i:3:p:409-429
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=98314
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijores:v:34:y:2019:i:3:p:409-429. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.