书目名称 | Orienteering Problems | 副标题 | Models and Algorithm | 编辑 | Pieter Vansteenwegen,Aldy Gunawan | 视频video | | 概述 | Provides an overview of the orienteering problem and its most latest variants and applications.Clearly explains and illustrates the available definitions and models for routing problems with profits.S | 丛书名称 | EURO Advanced Tutorials on Operational Research | 图书封面 |  | 描述 | 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.. | 出版日期 | Textbook 2019 | 关键词 | Vehicle routing optimization; Routing in mobile crowdsourcing; Routing in healthcare; Routing in touris | 版次 | 1 | doi | https://doi.org/10.1007/978-3-030-29746-6 | isbn_softcover | 978-3-030-29748-0 | isbn_ebook | 978-3-030-29746-6Series ISSN 2364-687X Series E-ISSN 2364-6888 | issn_series | 2364-687X | copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl |
The information of publication is updating
|
|