Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows
Joint Authors
Park, Junhyuk
Lee, Jongsung
Ahn, SeHwan
Bae, Jungryul
Tae, Hyunchul
Source
Mathematical Problems in Engineering
Issue
Vol. 2017, Issue 2017 (31 Dec. 2017), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2017-01-26
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Park, Junhyuk& Lee, Jongsung& Ahn, SeHwan& Bae, Jungryul& Tae, Hyunchul. 2017. Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows. Mathematical Problems in Engineering،Vol. 2017, no. 2017, pp.1-6.
https://search.emarefa.net/detail/BIM-1192657
Modern Language Association (MLA)
Park, Junhyuk…[et al.]. Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows. Mathematical Problems in Engineering No. 2017 (2017), pp.1-6.
https://search.emarefa.net/detail/BIM-1192657
American Medical Association (AMA)
Park, Junhyuk& Lee, Jongsung& Ahn, SeHwan& Bae, Jungryul& Tae, Hyunchul. Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows. Mathematical Problems in Engineering. 2017. Vol. 2017, no. 2017, pp.1-6.
https://search.emarefa.net/detail/BIM-1192657
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1192657
