國立高雄大學圖資館 |

Language: English

Back

Orienteering problemsmodels and algo...

Gunawan, Aldy.

Orienteering problemsmodels and algorithms for vehicle routing problems with profits /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Orienteering problemsby Pieter Vansteenwegen, Aldy Gunawan.
Reminder of title:	models and algorithms for vehicle routing problems with profits /
Author:	Vansteenwegen, Pieter.
other author:	Gunawan, Aldy.
Published:	Cham :Springer International Publishing :2019.
Description:	xvii, 112 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Vehicle routing problem.
Online resource:	https://doi.org/10.1007/978-3-030-29746-6
ISBN:	9783030297466$q(electronic bk.)

Orienteering problemsmodels and algorithms for vehicle routing problems with profits /
Vansteenwegen, Pieter.

Orienteering problemsmodels and algorithms for vehicle routing problems with profits /[electronic resource] :by Pieter Vansteenwegen, Aldy Gunawan. - Cham :Springer International Publishing :2019. - xvii, 112 p. :ill. (some col.), digital ;24 cm. - EURO advanced tutorials on operational research,2364-687X. - EURO advanced tutorials on operational research..

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.

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.

ISBN: 9783030297466$q(electronic bk.)

Standard No.: 10.1007/978-3-030-29746-6doiSubjects--Topical Terms:

285561
Vehicle routing problem.

LC Class. No.: QA402.6 / .V36 2019

Dewey Class. No.: 519.72

Orienteering problemsmodels and algorithms for vehicle routing problems with profits /
LDR:02685nmm a2200349 a 4500 001 587236
003 DE-He213
005 20200701021442.0
006 m d
007 cr nn 008maaau
008 210326s2019 sz s 0 eng d
020 $a 9783030297466$q(electronic bk.)
020 $a 9783030297459$q(paper)
024 7 $a 10.1007/978-3-030-29746-6 $2 doi
035 $a 978-3-030-29746-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.6 $b .V36 2019
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJM $2 thema
082 0 4 $a 519.72 $2 23
090 $a QA402.6 $b .V281 2019
100 1 $a Vansteenwegen, Pieter. $3 878804
245 1 0 $a Orienteering problems $h [electronic resource] : $b models and algorithms for vehicle routing problems with profits / $c by Pieter Vansteenwegen, Aldy Gunawan.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xvii, 112 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a EURO advanced tutorials on operational research, $x 2364-687X
505 0 $a 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.
520 $a 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.
650 0 $a Vehicle routing problem. $3 285561
650 1 4 $a Operations Research, Management Science. $3 511451
650 2 4 $a Logistics. $3 200159
650 2 4 $a Operations Research/Decision Theory. $3 273963
650 2 4 $a Calculus of Variations and Optimal Control; Optimization. $3 274198
700 1 $a Gunawan, Aldy. $3 878805
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a EURO advanced tutorials on operational research. $3 726323
856 4 0 $u https://doi.org/10.1007/978-3-030-29746-6
950 $a Mathematics and Statistics (SpringerNature-11649)