Highlights Operational planning of drayage operations around intermodal container terminals. Integration of allocation and routing decisions. For the first time a bi-objective approach: number of vehicles and distance. Three meta-heuristics based on deterministic annealing are proposed and compared. Hybrid deterministic annealing and tabu search algorithm provides the best results.
Abstract A full truckload vehicle routing problem in drayage operations around intermodal container terminals is studied. Loaded and empty containers need to be transported in a small geographical area. Either the origin or the destination of empty container transports is unknown in advance. The problem is formulated as an asymmetric multiple vehicle Traveling Salesman Problem with Time Windows (am-TSPTW). For the first time, this type of problem is considered from a bi-objective perspective. Three solution algorithms are proposed and compared with each other. Best results are obtained by a two-phase hybrid deterministic annealing and tabu search algorithm.
Bi-objective optimization of drayage operations in the service area of intermodal terminals
2013-01-01
20 pages
Article (Journal)
Electronic Resource
English
Bi-objective optimization of drayage operations in the service area of intermodal terminals
Online Contents | 2014
|Container Drayage Operations at Intermodal Terminals: A Deterministic Annealing Approach
Springer Verlag | 2012
|Approaches to Improving Drayage in Rail-Truck Intermodal Service
British Library Conference Proceedings | 1995
|Using Marginal Costs To Evaluate Drayage Rates in Rail-Truck Intermodal Service
Online Contents | 1993
|Dispatching trucks for drayage operations
Online Contents | 2014
|