Abstract
In this paper, we consider the orienteering problem with hotel selection (OPHS) and introduce an additional cap on the available budget, frequently experienced in practice but neglected in the literature. We present a heuristic solution approach for the modified problem configuration, which comprises the construction of initial solutions and the improvement of those solutions using a multi-start VNS heuristic with adaptive adjustment. Within computational studies on adjusted benchmark data, we evaluate the impact of the considered budget constraint by comparing the results of the original OPHS with the results of its budget constraint extension. Further, we show the efficiency of the proposed metaheuristic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Divsalar, A., Vansteenwegen, P., & Cattrysse, D. (2013). A variable neighborhood search method for the orienteering problem with hotel selection. International Journal of Production Economics, 145(1), 150–160.
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, 237(1), 29–49.
Sohrabi, S., Ziarati, K., & Keshtkaran, M. (2020). A greedy randomized adaptive search procedure for the orienteering problem with hotel selection. European Journal of Operational Research, 283(2), 426–440.
Sohrabi, S., Ziarati, K., & Keshtkaran, M. (2021). ACS-OPHS: Ant colony system for the orienteering problem with hotel selection. EURO Journal on Transportation and Logistics, 10(100), 036.
Divsalar, A., Vansteenwegen, P., Chitsaz, M., Sörensen, K., & Cattrysse, D. (2014). Personalized multi-day trips to touristic regions: A hybrid GA-VND approach. In European Conference on Evolutionary Computation in Combinatorial Optimization (pp. 194–205). Springer.
Vansteenwegen, P., & Gunawan, A. (2019). Orienteering problems. Springer.
Ben-Said, A., El-Hajj, R., & Moukrim, A. (2019). A variable space search heuristic for the capacitated team orienteering problem. Journal of Heuristics, 25(2), 273–303.
Lion, D., Chiu, A., Stumm, M., & Yuan, D. (2022). Investigating managed language runtime performance: Why JavaScript and Python are 8x and 29x slower than C++, yet Java and Go can be faster? In 2022 USENIX Annual Technical Conference (USENIX ATC 22) (pp. 835–852).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Päprer, P., Zipfel, B. (2023). Low Budget Traveling: The Orienteering Problem with Hotel Selection and Budget Constraint. In: Grothe, O., Nickel, S., Rebennack, S., Stein, O. (eds) Operations Research Proceedings 2022. OR 2022. Lecture Notes in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-031-24907-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-031-24907-5_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-24906-8
Online ISBN: 978-3-031-24907-5
eBook Packages: Business and ManagementBusiness and Management (R0)