Heuristic-based truck scheduling for inland container transportation
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.
KeywordsContainer transportation Traveling salesman problem (TSP) Time window Heuristics Container drayage operation Container as a resource in transportation planning
Unable to display preview. Download preview PDF.
- Appelgren LH (1971) Integer programming methods for a vessel scheduling problem. Transp Sci 5: 62–74Google Scholar
- Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6: 126–140Google Scholar
- Ileri Y (2006) Drayage optimization in truck/rail networks. PhD thesis, Georgia Institute of TechnologyGoogle Scholar
- Namboothiri R (2006) Planning container drayage operations at congested seaports. PhD thesis, Georgia Institute of TechnologyGoogle Scholar
- Namboothiri R, Erera AL (2008) Planning local container drayage operations given a port access appointment system. Transp Res Part E: Logist Transp Rev 44: 185–202Google Scholar
- Toth P, Vigo D (2002) The vehicle routing problem. SIAM (Society for Industrial and Applied Mathematics), PhiladelphiaGoogle Scholar
- Wen S, Zhou P (2007) A container vehicle routing model with variable traveling time. In: IEEE international conference on automation and logistics, 2007, pp 2243–2247Google Scholar
- Zhang RY, Yun WY (2008) An optimum route modeling for container truck transportation. In: Asia conference on intelligent manufacturing & logistics systems, Kitakyushu, Japan, pp 356–362Google Scholar