Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows

Junhyuk Park, Jongsung Lee, SeHwan Ahn, Jungryul Bae and Hyunchul Tae

Mathematical Problems in Engineering, 2017, vol. 2017, 1-6

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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/9285403.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/9285403.xml (text/xml)

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:hin:jnlmpe:9285403

DOI: 10.1155/2017/9285403

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().