Paper Info
Title
Heuristic-based truck scheduling for inland container transportation
Abstract
A truck scheduling problem for container transportation in a local area with multiple depots and multiple terminals including containers as a resource for transportation is addressed. Four types of movements of containers as inbound full, outbound full, inbound empty and outbound empty movements as well as the time windows at both the origin and the destination are considered. The total operating time of all trucks in operation is taken as the optimization criterion that has to be minimized. The problem is mathematically modeled based on a preparative graph formulation and falls into an extension of the multiple traveling salesman problem with time windows (m-TSPTW). The window partition based solution method for the m-TSPTW in Wang and Regan (Transp Res Part B: Methodol 36:97–112, 2002) is modified so that its computation time is reduced greatly. The experiments based on a number of randomly generated instances indicate that the modified method is quite fast and the quality of solutions is relatively high for the m-TSPTW. These experiments also demonstrate that our approach is able to generate high-quality results for the equivalent truck scheduling and inland container movement problem in container drayage operations.
Year
DOI
Venue
2010
10.1007/s00291-010-0193-4
Or Spektrum
Keywords
Field
DocType
container as a resource in transportation planning,container drayage operation,container transportation,heuristics,time window,traveling salesman problem (tsp),mathematical model,scheduling problem,traveling salesman problem
Truck,Graph,Heuristic,Mathematical optimization,Economics,Truck scheduling,Heuristics,Travelling salesman problem,Partition (number theory),Operations management,Computation
Journal
Volume
Issue
ISSN
32
3
14366304
Citations 
PageRank 
References 
28
1.22
9
Authors
3
Name
Order
Citations
PageRank
Ruiyou Zhang1282.57
Won Young Yun2738.14
Herbert Kopfer349960.75