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

The travelling salesperson problem with hotel selection

Author

Listed:
  • P Vansteenwegen

    (1] Ghent University, Ghent, Belgium[2] Centre for Industrial Management, Katholieke Universiteit Leuven, Katholieke, Belgium)

  • W Souffriau

    (Centre for Industrial Management, Katholieke Universiteit Leuven, Katholieke, Belgium)

  • K Sörensen

    (University of Antwerp, Antwerpen, Belgium)

Abstract

In this paper, we present the travelling salesperson problem with hotel selection (TSPHS), an extension of the TSP with a number of interesting applications. We present a mathematical formulation, explain the difference with related optimization problems and indicate what makes this problem inherently more difficult. We develop a simple but efficient heuristic that uses two constructive initialization procedures and an improvement procedure consisting of several neighbourhood search operators designed specifically for this problem, as well as some typical neighbourhoods from the literature. We generate several benchmark instances of varying sizes and compare the performance of our heuristic with CPLEX (10.0). We also generate some problems with known optimal solutions and use these to further demonstrate that our heuristic achieves good results in very limited computation times.

Suggested Citation

  • P Vansteenwegen & W Souffriau & K Sörensen, 2012. "The travelling salesperson problem with hotel selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 207-217, February.
    • Handle: RePEc:pal:jorsoc:v:63:y:2012:i:2:p:207-217
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v63/n2/pdf/jors201118a.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/v63/n2/full/jors201118a.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. Divsalar, A. & Vansteenwegen, P. & Sörensen, K. & Cattrysse, D., 2014. "A memetic algorithm for the orienteering problem with hotel selection," European Journal of Operational Research, Elsevier, vol. 237(1), pages 29-49.
    2. Gabriel Bazi & John Khoury & F. Jordan Srour, 2017. "Integrating Data Collection Optimization into Pavement Management Systems," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 59(3), pages 135-146, June.
    3. 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.
    4. Sohrabi, Somayeh & Ziarati, Koorush & Keshtkaran, Morteza, 2020. "A Greedy Randomized Adaptive Search Procedure for the Orienteering Problem with Hotel Selection," European Journal of Operational Research, Elsevier, vol. 283(2), pages 426-440.
    5. 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).
    6. Divsalar, A. & Vansteenwegen, P. & Cattrysse, D., 2013. "A variable neighborhood search method for the orienteering problem with hotel selection," International Journal of Production Economics, Elsevier, vol. 145(1), pages 150-160.

    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:63:y:2012:i:2:p:207-217. 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.