Publication Type

Book Chapter

Version

publishedVersion

Publication Date

8-2019

Abstract

In recent years, we observe from literature that the VRP and OP, including their variants, have been used to model many different planning and scheduling problems from practice, such as the routing of technicians, athlete recruitment, or military applications. Recently, other practical applications, such as the tourist trip design problem, the mobile crowdsourcing problem, the smuggler search problem, the wildfire routing problem, and the integration of vehicle routing, inventory management, and customer selection problems, have been studied and use the OP as a basic model. In this chapter, various practical applications will be discussed in more detail. We will describe how different aspects from practice can actually be modeled as OP variants. More details about the formulations of the most used OP variants and algorithms to tackle these variants, will be explained in Chap. 8.

Discipline

Artificial Intelligence and Robotics | 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

83

Last Page

93

ISBN

9783030297459

Identifier

10.1007/978-3-030-29746-6_7

Publisher

Springer

Additional URL

https://doi.org/10.1007/978-3-030-29746-6_7

Download

Share

COinS