Team orienteering problem with nonidentical agents and balanced score

Gabriela Sánchez-Yepez, M. Angélica Salazar-Aguilar*, Pamela J. Palomo-Martínez

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)7957-7971
Number of pages15
JournalInternational Journal of Production Research
Issue number23
Publication statusPublished - 2023

Bibliographical note

Publisher Copyright:
© 2023 Informa UK Limited, trading as Taylor & Francis Group.

All Science Journal Classification (ASJC) codes

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Team orienteering problem with nonidentical agents and balanced score'. Together they form a unique fingerprint.

Cite this