Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Energy-constrained orienteering problem for green tourist trip design: Mathematical formulation and heuristic solution approaches
Date
2025-02-01
Author
Karabaş, Tolga
Tural, Mustafa Kemal
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
29
views
0
downloads
Cite This
Planning a touristic itinerary is a challenging task that requires personalized tour generation for tourists interested in visiting available points of interest (POIs). The negative externalities of using vehicles (e.g., emissions) can be reduced by considering such aspects in itinerary planning. To address this need, we propose the Energy-Constrained Tourist Trip Design Problem to plan environmentally friendly touristic itineraries. We model this problem as an Energy-Constrained Orienteering Problem (ECOP), where we consider continuous vehicle speed, speed-dependent travel time, and fuel consumption −accordingly emissions− which have not been considered in the scope of the OP before. First, the ECOP is formulated as a mixed-integer second-order cone programming (MISOCP) model which is able to solve only small-size instances to optimality within a reasonable time. Second, for large-size instances, we develop two heuristic methods, namely Greedy Insertion (GI) and Iterated Local Search (ILS) algorithms. In the latter, several improvement heuristics are coupled with an SOCP-based speed optimization procedure. Based on our computational experiments, the GI heuristic is the fastest among the proposed methods, while generally yielding suboptimal solutions compared to the ILS algorithm, but for larger instances, these solutions are better than the ones obtained via the exact method. The ILS algorithm outperforms the exact method by reaching good-quality solutions in a relatively short computing time. The ECOP has prospective applications on selective routing problems involving other transportation modes (e.g., cruise, aerial) and has a significant potential on reducing transportation-related GHG emissions.
Subject Keywords
Conic programming
,
Green logistics
,
Iterated local search
,
Orienteering problem
,
Speed optimization
,
Tourist trip planning
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85214816685&origin=inward
https://hdl.handle.net/11511/113098
Journal
Computers and Industrial Engineering
DOI
https://doi.org/10.1016/j.cie.2024.110853
Collections
Department of Industrial Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
T. Karabaş and M. K. Tural, “Energy-constrained orienteering problem for green tourist trip design: Mathematical formulation and heuristic solution approaches,”
Computers and Industrial Engineering
, vol. 200, pp. 0–0, 2025, Accessed: 00, 2025. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85214816685&origin=inward.