TY - BOOK ID - 48212157 TI - Orienteering Problems : Models and Algorithms for Vehicle Routing Problems with Profits AU - Vansteenwegen, Pieter. AU - Gunawan, Aldy. PY - 2019 SN - 3030297462 3030297454 PB - Cham : Springer International Publishing : Imprint: Springer, DB - UniCat KW - Business logistics. KW - Operations research. KW - Mathematical optimization. KW - Operations Research, Management Science. KW - Logistics. KW - Operations Research/Decision Theory. KW - Calculus of Variations and Optimal Control; Optimization. KW - Optimization (Mathematics) KW - Optimization techniques KW - Optimization theory KW - Systems optimization KW - Mathematical analysis KW - Maxima and minima KW - Operations research KW - Simulation methods KW - System analysis KW - Operational analysis KW - Operational research KW - Industrial engineering KW - Management science KW - Research KW - System theory KW - Supply chain management KW - Industrial management KW - Logistics KW - Traveling salesman problem. KW - Vehicle routing problem. KW - VRP (Vehicle routing problem) KW - Combinatorial optimization KW - Traveling salesman problem KW - TSP (Traveling salesman problem) KW - Graph theory KW - Vehicle routing problem KW - Management science. KW - Decision making. KW - Calculus of variations. KW - Isoperimetrical problems KW - Variations, Calculus of KW - Deciding KW - Decision (Psychology) KW - Decision analysis KW - Decision processes KW - Making decisions KW - Management KW - Management decisions KW - Choice (Psychology) KW - Problem solving KW - Quantitative business analysis KW - Statistical decision KW - Decision making UR - https://www.unicat.be/uniCat?func=search&query=sysid:48212157 AB - 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. ER -