Publication Type
Book Chapter
Version
publishedVersion
Publication Date
8-2019
Abstract
In this chapter, single vehicle routing problems with profits are introduced anddefined. Three variants are considered: the profitable tour problem, the prizecollecting traveling salesperson problem, and the orienteering problem. The difference between these variants is the way in which the profit and the travel cost, mostlydistance or time, are modeled. Profit and travel cost can be modeled as (part of) theobjective or as a constraint. All three problems differ from the well-known travelingsalesperson problem, for which the only objective is to find the shortest route to visitall customers in a given set. In vehicle routing problems with profits, some customerswill be selected to be visited and others will not, based on the objective considered.
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
7
Last Page
19
ISBN
9783030297459
Identifier
10.1007/978-3-030-29746-6_2
Publisher
Springer
City or Country
Cham
Citation
VANSTEENWEGEN, Pieter and GUNAWAN, Aldy.
Definitions and mathematical models of single vehicle routing problems with profits. (2019). Orienteering problems: Models and algorithms for vehicle routing problems with profits. 7-19.
Available at: https://ink.library.smu.edu.sg/sis_research/10182
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_2