| Document Type
|
:
|
BL
|
| Record Number
|
:
|
862885
|
| Main Entry
|
:
|
Vansteenwegen, Pieter
|
| Title & Author
|
:
|
Orienteering problems : : models and algorithms for vehicle routing problems with profits /\ Pieter Vansteenwegen, Aldy Gunawan.
|
| Publication Statement
|
:
|
Cham :: Springer,, [2019]
|
|
|
:
|
, ©2019
|
| Series Statement
|
:
|
EURO advanced tutorials on operational research,
|
| Page. NO
|
:
|
1 online resource :: illustrations (some color)
|
| ISBN
|
:
|
3030297462
|
|
|
:
|
: 3030297470
|
|
|
:
|
: 3030297489
|
|
|
:
|
: 9783030297466
|
|
|
:
|
: 9783030297473
|
|
|
:
|
: 9783030297480
|
|
|
:
|
3030297454
|
|
|
:
|
9783030297459
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references.
|
| Contents
|
:
|
Intro; Preface; Acknowledgements; Contents; Acronyms; 1 Introduction; 1.1 Classification; 1.2 History of Orienteering Problem; 1.3 Relevance of Orienteering Problems; 1.4 Outline; 1.5 Related Literature; References; 2 Definitions and Mathematical Models of Single Vehicle Routing Problems with Profits; 2.1 Profitable Tour Problem; 2.1.1 Formal Definition and Mathematical Model PTP; 2.1.2 Subtour Elimination; 2.1.3 Complexity; 2.2 Prize-Collecting Traveling Salesperson Problem; 2.2.1 Formal Definition and Mathematical Model PCTSP; 2.2.2 Complexity; 2.3 Orienteering Problem
|
|
|
:
|
2.3.1 Formal Definition and Mathematical Model OP2.3.2 Complexity; 2.4 Related Literature; References; 3 Definitions and Mathematical Models of OP Variants; 3.1 Team Orienteering Problem; 3.1.1 Formal Definition and Mathematical Model TOP; 3.1.2 Complexity; 3.2 Orienteering Problem with Time Windows; 3.2.1 Formal Definition and Mathematical Model OPTW; 3.2.2 Complexity; 3.3 Team Orienteering Problem with Time Windows; 3.3.1 Formal Definition and Mathematical Model TOPTW; 3.3.2 Complexity; 3.4 Related Literature; References; 4 State-of-the-Art Solution Techniques for PTP and PCTSP
|
|
|
:
|
4.1 Benchmark Instances4.2 Exact Approaches; 4.3 Heuristics; 4.4 Related Literature; References; 5 State-of-the-Art Solution Techniques for OP and TOP; 5.1 Benchmark Instances; 5.1.1 OP Benchmark Instances; 5.1.2 TOP Benchmark Instances; 5.2 Exact Approaches; 5.2.1 Exact Approaches for the OP; 5.2.2 Exact Approaches for the TOP; 5.3 Metaheuristics; 5.3.1 Local Search Moves for the OP and the TOP; 5.3.2 Metaheuristics for the OP; 5.3.3 Metaheuristics for the TOP; 5.4 Related Literature; References; 6 State-of-the-Art Solution Techniques for OPTW and TOPTW; 6.1 Benchmark Instances
|
|
|
:
|
6.2 Exact Techniques for the OPTW6.3 Metaheuristics; 6.4 Related Literature; References; 7 Applications of the OP; 7.1 Logistics; 7.2 Tourism; 7.3 Other Applications from Practice; References; 8 Other Orienteering Problem Variants; 8.1 Capacity Constraints; 8.2 Multi-objective Routing Problems with Profits; 8.3 Time Dependency; 8.3.1 Mathematical Formulation with Time Dependent Travel Times; 8.3.2 Solution Approaches for Time Dependent Travel Times; 8.3.3 Benchmark Instances for Time Dependent Travel Times; 8.3.4 Time Dependent Profits; 8.3.5 Related Literature; 8.4 Stochasticity
|
|
|
:
|
8.4.1 Problems with Stochastic Travel Times8.4.2 Solution Approaches for Stochastic Travel Times; 8.4.3 Benchmark Instances with Stochastic Travel Times; 8.4.4 Stochastic Profits; 8.4.5 Related Literature; 8.5 Inventory Orienteering Problem; References
|
| Abstract
|
:
|
This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded. The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.
|
| Subject
|
:
|
Vehicle routing problem.
|
| Subject
|
:
|
Vehicle routing problem.
|
| Dewey Classification
|
:
|
519.7/2
|
| LC Classification
|
:
|
QA402.6.V36 2019eb
|
| Added Entry
|
:
|
Gunawan, Aldy
|