AbstractContainer movement by trucks with time constraints at origins and destinations is modeled as an asymmetric “multi-Traveling Salesmen Problem with Time Windows” (m-TSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes for a fleet of trucks. Since the m-TSPTW problem is NP-hard, the computational time for optimally solving large size problems becomes prohibitive. For large size problems, we develop a hybrid methodology consisting of DP in conjunction with genetic algorithms. The developed algorithms are compared with an insertion heuristic method. Computational results demonstrate the efficiency of the developed algorithms.
Container movement by trucks in metropolitan networks: modeling and optimization
Transportation Research Part E: Logistics and Transportation Review ; 41 , 3 ; 235-259
2004-03-19
25 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Container movement by trucks in metropolitan networks: modeling and optimization
Online Contents | 2005
|Longer Trucks for Climate-Friendly Transports in Metropolitan Regions
Springer Verlag | 2020
|Integration and Optimization of Quay Cranes and Trucks at Container Terminal
British Library Conference Proceedings | 2014
|