IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i4p615-626.html
   My bibliography  Save this article

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection

Author

Listed:
  • Andreas Baltz

    (Christian Albrechts University of Kiel, Kiel, Germany)

  • Mourad El Ouali

    (Christian Albrechts University of Kiel, Kiel, Germany)

  • Gerold J&aauml;ger

    (University of Umeå, Umeå, Sweden)

  • Volkmar Sauerland

    (Christian Albrechts University of Kiel, Kiel, Germany)

  • Anand Srivastav

    (Christian Albrechts University of Kiel, Kiel, Germany)

Abstract

We introduce and study the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection (TSP-MTWHS), which generalises the well-known Travelling Salesman Problem with Time Windows and the recently introduced Travelling Salesman Problem with Hotel Selection. The TSP-MTWHS consists in determining a route for a salesman (eg, an employee of a services company) who visits various customers at different locations and different time windows. The salesman may require a several-day tour during which he may need to stay in hotels. The goal is to minimise the tour costs consisting of wage, hotel costs, travelling expenses and penalty fees for possibly omitted customers. We present a mixed integer linear programming (MILP) model for this practical problem and a heuristic combining cheapest insert, 2-OPT and randomised restarting. We show on random instances and on real world instances from industry that the MILP model can be solved to optimality in reasonable time with a standard MILP solver for several small instances. We also show that the heuristic gives the same solutions for most of the small instances, and is also fast, efficient and practical for large instances.

Suggested Citation

  • Andreas Baltz & Mourad El Ouali & Gerold J&aauml;ger & Volkmar Sauerland & Anand Srivastav, 2015. "Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(4), pages 615-626, April.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:4:p:615-626
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n4/pdf/jors201417a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n4/full/jors201417a.html
    File Function: Link to full text HTML
    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.

    Citations

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


    Cited by:

    1. Reihaneh, Mohammad & Ghoniem, Ahmed, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 523-538.
    2. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    3. Du, Jiaoman & Zhou, Jiandong & Li, Xiang & Li, Lei & Guo, Ao, 2021. "Integrated self-driving travel scheme planning," International Journal of Production Economics, Elsevier, vol. 232(C).

    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:pal:jorsoc:v:66:y:2015:i:4:p:615-626. 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.