Orienteering Problems : Models and Algorithms for Vehicle Routing Problems with Profits
2019 ed.
Book Details
Format
Hardback or Cased Book
Book Series
EURO Advanced Tutorials on Operational Research
ISBN-10
3030297454
ISBN-13
9783030297459
Edition
2019 ed.
Publisher
Springer Nature Switzerland AG
Imprint
Springer Nature Switzerland AG
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Sep 13th, 2019
Print length
112 Pages
Weight
322 grams
Dimensions
33.00 x 49.30 x 0.90 cms
Product Classification:
Management decision makingDistribution & warehousing managementOperational researchOptimization
Ksh 12,600.00
Manufactured on Demand
Delivery in 29 days
Delivery Location
Delivery fee: Select location
Delivery in 29 days
Secure
Quality
Fast
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.
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.
Get Orienteering Problems by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer Nature Switzerland AG and it has pages.
