IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/538102.html
   My bibliography  Save this paper

Exact algorithms for the equitable traveling salesman problem

Author

Listed:
  • Joris Kinable
  • Bart Smeulders
  • Eline Delcour
  • Frits Spieksma

Abstract

Given a weighted graph G = (V, E), the Equitable Traveling Salesman Problem (ETSP) asks for two perfect matchings in G such that (1) the two matchings together form a Hamiltonian cycle in G and (2) the absolute difference in costs between the two matchings is minimized. The problem is shown to be NP-Hard, even when the graph G is complete. We present two integer programming models to solve the ETSP problem. One model is solved through branch-and-bound-and-cut, whereas the other model is solved through a branch-and-price-and-cut framework. A simple local search heuristic is also implemented. We conduct computational experiments on different types of instances, often derived from the TSPLib. It turns out that the behavior of the different approaches varies with the type of instances; however, the branch-and-bound-and-cut approach implemented in Cplex seems to work best overall.

Suggested Citation

  • Joris Kinable & Bart Smeulders & Eline Delcour & Frits Spieksma, 2016. "Exact algorithms for the equitable traveling salesman problem," Working Papers of Department of Decision Sciences and Information Management, Leuven 538102, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
    • Handle: RePEc:ete:kbiper:538102
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/retrieve/383122
    File Function: Exact algorithms for the equitable traveling salesman problem
    Download Restriction: no
    ---><---

    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:ete:kbiper:538102. 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: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    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.