IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v32y2024i2d10.1007_s10100-023-00895-9.html
   My bibliography  Save this article

The hiking tourist problem

Author

Listed:
  • Fabien Tricoire

    (University of Vienna)

  • Sophie N. Parragh

    (Johannes Kepler University Linz)

  • Margaretha Gansterer

    (University of Klagenfurt)

Abstract

Hiking is among the most popular outdoor activities. In this paper, we introduce the hiking tourist problem (HTP) to support hikers in their trip planning to attractive hiking spots in a certain region. In the HTP, a set of hikes out of a larger set of potential hikes is selected and the mode of transport between the hiking locations is determined. The considered constraints involve a minimum and a maximum number of travel days, a maximum total cumulative elevation gain of all selected hikes and a maximum number of hikes. Two objectives are optimized concurrently: the total attractiveness of the travel plan is maximized and its total emissions are minimized. Several families of valid inequalities are discussed and a bi-objective branch-and-bound algorithm is tailored to solve the proposed problem. In a computational study on realistic instances for different regions in France, the impact of the proposed valid inequalities is analyzed and the trade-off between attractiveness and emissions is discussed.

Suggested Citation

  • Fabien Tricoire & Sophie N. Parragh & Margaretha Gansterer, 2024. "The hiking tourist problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(2), pages 183-207, June.
    • Handle: RePEc:spr:cejnor:v:32:y:2024:i:2:d:10.1007_s10100-023-00895-9
    DOI: 10.1007/s10100-023-00895-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-023-00895-9
    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/s10100-023-00895-9?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.

    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:cejnor:v:32:y:2024:i:2:d:10.1007_s10100-023-00895-9. 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.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.