Publication Type
Book Chapter
Version
publishedVersion
Publication Date
8-2019
Abstract
In Chaps. 2 and 3, different orienteering problems (or routing problems with profits) were introduced. The single vehicle problems were discussed in Chap. 2: the profitable tour problem (PTP), the prize-collecting traveling salesperson problem (PCTSP), and the orienteering problem (OP). The multi vehicle problems were discussed in Chap. 3: the team orienteering problem (TOP) and the team orienteering problem with time windows (TOPTW). For discussing the state-of-the-art solution techniques for these different orienteering problems in Chaps. 4, 5, and 6, the problems will be classified differently, based on the similarities between the solution techniques. Therefore, the PTP and PCTSP are discussed in this chapter, the OP and TOP in the next chapter and the problems with time windows, OPTW and TOPTW, in Chap. 6. Moreover, it should be noted that only a few solution techniques have been developed for the PTP and the PCTSP, while many more solution techniques have been developed for the OP, TOP, OPTW, and TOPTW.
Discipline
Numerical Analysis and Scientific Computing | Theory and Algorithms
Research Areas
Intelligent Systems and Optimization
Publication
Orienteering problems: Models and algorithms for vehicle routing problems with profits
Editor
Pieter Vansteenwegen; Aldy Gunawan
First Page
33
Last Page
40
ISBN
9783030297459
Identifier
10.1007/978-3-030-29746-6_6
Publisher
Springer
City or Country
Cham
Citation
VANSTEENWEGEN, Pieter and GUNAWAN, Aldy.
State-of-the-art solution techniques for OPTW and TOPTW. (2019). Orienteering problems: Models and algorithms for vehicle routing problems with profits. 33-40.
Available at: https://ink.library.smu.edu.sg/sis_research/10184
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/978-3-030-29746-6_6