Vehicle Routing Problem: Past and Future
Vehicle Routing Problem: Past and Future
- New search for: Demir, Emrah
- New search for: Huckle, Katy
- New search for: Syntetos, Aris
- New search for: Lahy, Andrew
- New search for: Wilson, Mike
- New search for: Wells, Peter
- New search for: Demir, Emrah
- New search for: Huckle, Katy
- New search for: Syntetos, Aris
- New search for: Lahy, Andrew
- New search for: Wilson, Mike
Freight transportation is a critical part of any supply chain and has many facets, particularly when viewed from the multiple levels of decision-making. The most known problem at the operational level planning is the Vehicle Routing Problem (VRP), which is one of the most interesting and challenging optimization problems in the operations research literature. By definition, it consists of designing optimal collection or delivery routes for a set of vehicles from a depot to a set of geographically scattered customers, subject to various side constraints, such as vehicle capacity, time windows, precedence relations between customers, and, etc. This chapter discusses the basic principles of vehicle routing to provide readers with a complete introductory resource. More specifically, knowing the past of vehicle routing will help readers to understand the present and to prepare for the future of road freight transportation.
Document information
Vehicle Routing Problem: Past and Future
Contemporary Operations and Logistics ; Chapter : 7 ; 97-117
2019-04-24
21 pages
Article/Chapter (Book)
Electronic Resource
English
Similar titles
| Transportation Research Record | 2013
| SLUB | 2002
Vehicle Safety - Past Present & Future
| British Library Conference Proceedings | 1999