Some Exciting New Problems in Vehicle Routing
Daniele Vigo  1@  , Bruce Golden  2, *@  
1 : Alma Mater Università di Bologna - Department of Electric, Electronic and Information Engineering  (DEI)
Viale Risorgimento, 2 40136 Bologna -  Italy
2 : University of Maryland - Department of Decision, Operations and Information Technologies Robert H. Smith School of Business
College Park, MD 20742-1815 -  United States
* : Corresponding author

The Vehicle Routing Problem (VRP) is one of the most studied optimization problems because it has many practical applications in logistics and transportation and it is so challenging to solve. During the last decade, many new variants of the VRP have been proposed. Some incorporate new constraints (e.g., parallelization and balance) or practical features, such as the on-board rearrangement of the load. Others integrate various phases of the supply chain planning process, as in inventory routing, or consider new technologies, such as electric/hybrid vehicles, RFID, telemetry, robots, and drones. Still others focus on the environmental consequences of vehicle routing. In addition, connections between vehicle routing and big data are starting to emerge. We outline some of this exciting, recent work in our presentation.


Online user: 1