IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i1p108-114.html
   My bibliography  Save this article

The Traveling Backpacker Problem: A computational comparison of two formulations

Author

Listed:
  • Kátia Y. Nakamura
  • Leandro C. Coelho
  • Jacques Renaud
  • Mariá C. V. Nascimento

Abstract

The rise of low-cost airlines has influenced the tourism industry, particularly in trips known as backpacking. This form of travelling is mostly adopted by people on a tight budget, intending to visit a large number of touristic attractions. In the Travelling Backpacker Problem (TBP), the objective is to find the best sequence of visits, so as to minimise the total travel cost. This problem was first modelled as a routing problem. Nevertheless, for small-sized instances, an exact solver could not find any feasible solutions. In this paper, we propose a new formulation for the TBP, which is based on a network flow representation of the problem. We tested both models using a state-of-the-art MIP solver on instances generated from real data obtained from low-cost airlines. Computational experiments indicate that the network flow-based formulation outperforms the routing-based formulation and can yield high-quality solutions for instances of realistic size.

Suggested Citation

  • Kátia Y. Nakamura & Leandro C. Coelho & Jacques Renaud & Mariá C. V. Nascimento, 2018. "The Traveling Backpacker Problem: A computational comparison of two formulations," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(1), pages 108-114, January.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:1:p:108-114
    DOI: 10.1057/s41274-017-0205-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0205-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0205-8?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.

    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:taf:tjorxx:v:69:y:2018:i:1:p:108-114. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.