IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v3y2022i1d10.1007_s43069-021-00101-z.html
   My bibliography  Save this article

Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem

Author

Listed:
  • Nicos Christofides

    (Carnegie-Mellon University)

Abstract

An O(n3) heuristic algorithm is described for solving d-city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition. The algorithm involves as substeps the computation of a shortest spanning tree of the graph G defining the TSP and the finding of a minimum cost perfect matching of a certain induced subgraph of G. A worst-case analysis of this heuristic shows that the ratio of the answer obtained to the optimum TSP solution is strictly less than 3/2. This represents a 50% reduction over the value 2 which was the previously best known such ratio for the performance of other polynomial growth algorithms for the TSP.

Suggested Citation

  • Nicos Christofides, 2022. "Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem," SN Operations Research Forum, Springer, vol. 3(1), pages 1-4, March.
    • Handle: RePEc:spr:snopef:v:3:y:2022:i:1:d:10.1007_s43069-021-00101-z
    DOI: 10.1007/s43069-021-00101-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00101-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-021-00101-z?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.

    References listed on IDEAS

    as
    1. Samuel Eilon & Nicos Christofides, 1971. "The Loading Problem," Management Science, INFORMS, vol. 17(5), pages 259-268, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    2. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    3. Muñoz, Susana & Teresa Ortuño, M. & Ramírez, Javier & Yáñez, Javier, 2005. "Coloring fuzzy graphs," Omega, Elsevier, vol. 33(3), pages 211-221, June.
    4. Kumar Satyendra & Venkata Rao, V. & Tirupati Devanath, 2003. "A heuristic procedure for one dimensional bin packing problem with additional constraints," IIMA Working Papers WP2003-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. G, Young-Gun & Kang, Maing-Kyu, 2001. "A fast algorithm for two-dimensional pallet loading problems of large size," European Journal of Operational Research, Elsevier, vol. 134(1), pages 193-202, October.
    6. Akhundov, Najmaddin & Ostrowski, James, 2024. "Exploiting symmetry for the job sequencing and tool switching problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 976-987.
    7. Yu Fu & Amarnath Banerjee, 2020. "Heuristic/meta-heuristic methods for restricted bin packing problem," Journal of Heuristics, Springer, vol. 26(5), pages 637-662, October.
    8. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki & Poldi, Kelly Cristina & Gonçalves Vianna, Andréa Carla, 2014. "The one-dimensional cutting stock problem with usable leftovers – A survey," European Journal of Operational Research, Elsevier, vol. 236(2), pages 395-402.
    9. Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
    10. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    11. Sarin, Subhash C. & Aggarwal, Sanjay, 2001. "Modeling and algorithmic development of a staff scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 558-569, February.
    12. Simon, Jay & Apte, Aruna & Regnier, Eva, 2017. "An application of the multiple knapsack problem: The self-sufficient marine," European Journal of Operational Research, Elsevier, vol. 256(3), pages 868-876.

    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:spr:snopef:v:3:y:2022:i:1:d:10.1007_s43069-021-00101-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.