Orienteering Problems Models and Algorithms for Vehicle Routing Problems with Profits /
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 problem...
| Κύριοι συγγραφείς: | , |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Cham :
Springer International Publishing : Imprint: Springer,
2019.
|
| Έκδοση: | 1st ed. 2019. |
| Σειρά: | EURO Advanced Tutorials on Operational Research,
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Introduction
- Definitions and Mathematical Models of Single Vehicle Routing
- Definitions and Mathematical Models of OP Variants
- State-of-the-Art Solution Techniques for PTP and PCTSP
- State-of-the-Art Solution Techniques for OP and TOP
- State-of-the-Art Solution Techniques for OPTW and TOPTW
- Applications of the OP
- Other Orienteering Problem Variants.