A real‐life situation in which a trucker has to collect a cargo of similar size from n different customers spread out in a given region and to deliver them to n locations spread out in another far‐away region has been formulated as a route‐design problem for a single vehicle. The minimal total time of loading, shipping and unloading is considered for different reshuffling methods, and the optimal method is determined. A solution procedure by enumeration is suggested to solve an actual small size problem, and an illustration is provided.
Optimal routing of a single vehicle with loading and unloading constraints
Transportation Planning and Technology ; 8 , 4 ; 301-306
1984-01-01
6 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Kraftfahrwesen | 1982
|Loading and unloading device, vehicle and vehicle loading and unloading method
Europäisches Patentamt | 2021
|A Multi-Compartment Vehicle Routing Problem with Loading and Unloading Costs
British Library Online Contents | 2019
|