Team orienteering problem with nonidentical agents and balanced score
Gabriela Sánchez-Yepez,
M. Angélica Salazar-Aguilar and
Pamela J. Palomo-Martínez
International Journal of Production Research, 2023, vol. 61, issue 23, 7957-7971
Abstract:
In this work, we study a variant of the team orienteering problem motivated by a real-world situation faced by a Mexican telecommunications company. The problem consists of the daily assignment and scheduling of service orders to crews, aiming to balance their wages, and considering the compatibility between service orders and crews. We present a mixed-integer linear formulation with two different metrics to achieve balanced scores and two valid inequalities leveraging the structure of the problem. Afterward, we propose a practical adaptive multi-start heuristic that integrates the learning mechanism of a reactive Greedy Randomized Adaptive Search Procedure. We test the performance of the models and the proposed algorithm on a benchmark of instances adapted from the literature and in a case study based on real data. The results confirm the effectiveness of the proposed algorithm to support the decision-making process.
Date: 2023
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2022.2162146 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:61:y:2023:i:23:p:7957-7971
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20
DOI: 10.1080/00207543.2022.2162146
Access Statistics for this article
International Journal of Production Research is currently edited by Professor A. Dolgui
More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().