Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows
Junhyuk Park, Jongsung Lee, SeHwan Ahn, Jungryul Bae, Hyunchul Tae
Source abstract
The capacitated team orienteering problem with time windows (CTOPTW) is a problem to determine players’ paths that have the maximum rewards while satisfying the constraints. In this paper, we present the exact solution approach for the CTOPTW which has not been done in previous literature. We show that the branch‐and‐price (B&P) scheme which was originally developed for the team orienteering problem can be applied to the CTOPTW. To solve pricing problems, we used implicit enumeration acceleration techniques, heuristic algorithms, and ng ‐route relaxations.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.