Exact algorithms for routing problems under vehicle capacity constraints |
| |
Authors: | Roberto Baldacci Paolo Toth Daniele Vigo |
| |
Institution: | 1.DEIS,University of Bologna,Cesena,Italy;2.DEIS,University of Bologna,Bologna,Italy |
| |
Abstract: | The solution of a vehicle routing problem calls for the determination of a set of routes, each performed by a single vehicle
which starts and ends at its own depot, such that all the requirements of the customers are fulfilled and the global transportation
cost is minimized. The routes have to satisfy several operational constraints which depend on the nature of the transported
goods, on the quality of the service level, and on the characteristics of the customers and of the vehicles. One of the most
common operational constraint addressed in the scientific literature is that the vehicle fleet is capacitated and the total
load transported by a vehicle cannot exceed its capacity. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|