Considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling salesman problem with two types of restrictions. When these restrictions are not too stringent, the problem can be solved optimally for relatively large sizes.
Vehicle routing with full loads
Fahrzeugverteilungssteuerung mit vollen Ladungen
Computers and Operations Research ; 15 , 3 ; 219-226
1988
8 Seiten, 7 Quellen
Article (Journal)
English
Full Truckload Vehicle Routing Problem with Profits
ASCE | 2014
|Vehicle Routing and Scheduling with Full Truckloads
Online Contents | 2003
|Vehicle Routing and Scheduling with Full Truckloads
British Library Online Contents | 2003
|Loads Cascading for Full Vehicle Component Design
British Library Conference Proceedings | 2020
|Loads Cascading for Full Vehicle Component Design
SAE Technical Papers | 2020
|