书目名称 | The Vehicle Routing Problem: Latest Advances and New Challenges |
编辑 | Bruce Golden,S. Raghavan,Edward Wasil |
视频video | http://file.papertrans.cn/922/921977/921977.mp4 |
概述 | Vehicle routing problems (VRP), including the traveling salesman problem, have marked the success of operations research more than almost any other set of combinatorial optimization problems. Recent t |
丛书名称 | Operations Research/Computer Science Interfaces Series |
图书封面 |  |
描述 | Theoretical research and practical applications in the ?eld of vehicle routing started in 1959 with the truck dispatching problem posed by Dantzig and Ramser [1]: ?nd the “. . . optimum routing of a ?eet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. ” Using a method based on a linear programming formulation, their hand calculations produced a near-optimal solution with four routes to aproblemwithtwelve service stations. The authorsproclaimed:“Nopractical applications of the method have been made as yet. ” In the nearly 50 years since the Dantzig and Ramser paper appeared, work in the ?eld has exploded dramatically. Today, a Google Scholar search of the words vehicle routing problem (VRP) yields more than 21,700 entries. The June 2006 issue of OR/MS Today provided a survey of 17 vendors of commercial routing software whose packages are currently capable of solving average-size problems with 1,000 stops, 50 routes, and two-hour hard-time windows in two to ten minutes [2]. In practice, vehicle routing may be the single biggest success story in operations research. For example, each day 103,500 drivers at UPS follow |
出版日期 | Book 2008 |
关键词 | SAS; algorithm; genetic algorithms; health care logistics; inventory routing; linear optimization; local s |
版次 | 1 |
doi | https://doi.org/10.1007/978-0-387-77778-8 |
isbn_softcover | 978-1-4419-4603-4 |
isbn_ebook | 978-0-387-77778-8Series ISSN 1387-666X Series E-ISSN 2698-5489 |
issn_series | 1387-666X |
copyright | Springer-Verlag US 2008 |