Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits

Jiaojiao Li, Jianghan Zhu, Guansheng Peng, Jianjiang Wang, Lu Zhen and Erik Demeulemeester

European Journal of Operational Research, 2024, vol. 319, issue 3, 793-807

Abstract: This paper studies the team orienteering problem (TOP), wherein each vertex requires two visits, and the service profit of each vertex depends on the time interval between these two visits. Motivated by scenarios like perishable product delivery, home health care scheduling, and earth observation satellite scheduling, the paper addresses two variants: the periodic orienteering problem with a focus on the number of days (NoDs) and the team orienteering problem with attention to a combination of time windows (CoTWs). It develops mixed-integer linear programming (MILP) models for both variants and devises exact Branch-Price-and-Cut (BPC) algorithms tailored to their block diagonal structures. Furthermore, this paper proposes two strategies to improve algorithm performance. A simplification strategy streamlines the directed graph network by removing redundant vertices and arcs without compromising optimality, thereby accelerating the solution of pricing problems. Additionally, a matheuristic algorithm is proposed to obtain integer solutions quickly. Computational results demonstrate the effectiveness of these algorithms, showcasing their superiority over CPLEX. The BPC algorithm, coupled with the simplification strategy, exhibits an average computational time reduction of 70 % compared to the basic strategy. The effectiveness of the matheuristic algorithm is also confirmed. Finally, the findings presented herein offer valuable insights for refining and applying BPC algorithms.

Keywords: Team orienteering problem; Interval-varying profits; Mixed-integer linear programming; Dantzig-Wolfe decomposition; Branch-Price-and-Cut (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724005563
Full text for ScienceDirect subscribers only

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:eee:ejores:v:319:y:2024:i:3:p:793-807

DOI: 10.1016/j.ejor.2024.07.015

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().