LEADER 00000nam a2200505 i 4500 
001    978-3-030-29746-6 
003    DE-He213 
005    20200701021442.0 
006    m     o  d         
007    cr nn 008maaau 
008    190830s2019    sz      s         0 eng d 
020    9783030297466|q(electronic bk.) 
020    9783030297459|q(paper) 
024 7  10.1007/978-3-030-29746-6|2doi 
040    GP|cGP|erda 
041 0  eng 
050  4 QA402.6|b.V36 2019 
082 04 519.72|223 
100 1  Vansteenwegen, Pieter,|eauthor 
245 10 Orienteering problems :|bmodels and algorithms for vehicle
       routing problems with profits /|cby Pieter Vansteenwegen, 
       Aldy Gunawan 
264  1 Cham :|bSpringer International Publishing :|bImprint: 
       Springer,|c2019 
300    1 online resource (xvii, 112 pages) :|billustrations (some
       color), digital ;|c24 cm 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
347    text file|bPDF|2rda 
490 1  EURO advanced tutorials on operational research,|x2364-
       687X 
505 0  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    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 Vehicle routing problem 
650 14 Operations Research, Management Science 
650 24 Logistics 
650 24 Operations Research/Decision Theory 
650 24 Calculus of Variations and Optimal Control; Optimization 
700 1  Gunawan, Aldy,|eauthor 
710 2  SpringerLink (Online service) 
773 0  |tSpringer Nature eBook 
830  0 EURO advanced tutorials on operational research 
856 40 |uhttps://doi.org/10.1007/978-3-030-29746-6