Model and algorithm of multi-depot container truck transportation with time windows
Pages 209 - 214
Abstract
A multi-depot container truck transportation problem with time windows is studied in this paper. Two types of transportation resources as trucks and containers and four types of container movements as inbound/outbound full and inbound/outbound empty movements are considered. The problem is formulated as a graph and then mathematically modeled as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. A reactive tabu search (RTS) algorithm is developed and tested based on a number of randomly generated examples. The results compared with the commercial tool CPLEX indicate that the RTS algorithm can find the optimum solutions of small-sized examples in short time. Furthermore, the algorithm is robust and stable to solve large-sized example.
References
[1]
W. Y. Yun and Y. S. Choi, "A simulation model for container-terminal operation analysis using an object-oriented approach," International Journal of Production Economics, vol. 59, pp. 221-230, 1999.
[2]
K. Shintani, A. Imai, E. Nishimura, and S. Papadimitriou, "The container shipping network design problem with empty container repositioning," Transportation Research Part E: Logistics and Transportation Review, vol. 43, pp. 39-59, 2007.
[3]
C.-I. Hsu and Y.-P. Hsieh, "Routing, ship size, and sailing frequency decision-making for a maritime hub-and-spoke container network," Mathematical and Computer Modelling, vol. 45, pp. 899-916, 2007.
[4]
I. F. A. Vis and R. de Koster, "Transshipment of containers at a container terminal: An overview," European Journal of Operational Research, vol. 147, pp. 1-16, 2003.
[5]
C. Macharis and Y. M. Bontekoning, "Opportunities for OR in intermodal freight transport research: A review," European Journal of Operational Research, vol. 153, pp. 400-416, 2004.
[6]
D. Steenken, S. Voß, and R. Stahlbock, "Container terminal operation and operations research - a classification and literature review," OR Spectrum, vol. 26, pp. 3-49, 2004.
[7]
L. Coslovich, R. Pesenti, and W. Ukovich, "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, vol. 171, pp. 776-786, 2006.
[8]
A. Imai, E. Nishimura, and J. Current, "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, vol. 176, pp. 87-105, 2007.
[9]
K. H. Chung, C. S. Ko, J. Y. Shin, H. Hwang, and K. H. Kim, "Development of mathematical models for the container road transportation in Korean trucking industries," Computers & Industrial Engineering, vol. 53, pp. 252-262, 2007.
[10]
R. K. Cheung, N. Shi, W. B. Powell, and H. P. Simao, "An attribute-decision model for cross-border drayage problem," Transportation Research Part E: Logistics and Transportation Review, vol. 44, pp. 217-234, 2008.
[11]
R. Namboothiri and A. L. Erera, "Planning local container drayage operations given a port access appointment system," Transportation Research Part E: Logistics and Transportation Review, vol. 44, pp. 185-202, 2008.
[12]
H. Jula, M. Dessouky, P. Ioannou, and A. Chassiakos, "Container movement by trucks in metropolitan networks: modeling and optimization," Transportation Research Part E: Logistics and Transportation Review, vol. 41, pp. 235-259, 2005.
[13]
X. Wang and A. C. Regan, "Local truckload pickup and delivery with hard time window constraints," Transportation Research Part B: Methodological, vol. 36, pp. 97-112, 2002.
[14]
P. Toth and D. Vigo, The vehicle routing problem: SIAM (Society for Industrial and Applied Mathematics), 2002.
[15]
D. Wang, J. Wang, H. Wang, R. Zhang, and Z. Guo, Intelligent Optimization Methods. China, Beijing: Higher Education Press, 2007.
[16]
F. Glover, "Tabu search : part I," ORSA Journal on Computing, vol. 1, pp. 190-206, 1989.
[17]
W. P. Nanry and J. Wesley Barnes, "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, vol. 34, pp. 107-121, 2000.
[18]
R. Battiti and G. Tecchiolli, "The reactive tabu search," ORSA Journal on Computing, vol. 6, pp. 126-140, 1994.
[19]
U. Castellani, A. Fusiello, R. Gherardi, and V. Murino, "Automatic selection of MRF control parameters by reactive tabu search," Image and Vision Computing, vol. 25, pp. 1824-1832, 2007.
[20]
L. G. W. da Silva, R. A. Fernandes Pereira, J. R. Abbad, and J. R. Sanches Mantovani, "Optimised placement of control and protective devices in electric distribution systems through reactive tabu search algorithm," Electric Power Systems Research, vol. 78, pp. 372-381, 2008.
[21]
I. Blochliger and N. Zufferey, "A graph coloring heuristic using partial solutions and a reactive tabu scheme," Computers & Operations Research, vol. 35, pp. 960-975, 2008.
- Model and algorithm of multi-depot container truck transportation with time windows
Recommendations
Model and algorithm for the berth allocation problem with time windows
CCDC'09: Proceedings of the 21st annual international conference on Chinese control and decision conferenceThe berth allocation problem studies the optimal scheduling of assigning arrival ships to berths along a quay in container terminals. The objective is to minimize the total service time for all ships in the planning horizon. The time window constraints ...
Multi-depot vehicle routing problem with time windows under shared depot resources
A new variant of multi-depot vehicle routing problem with time windows is studied. In the new variant, the depot where the vehicle ends is flexible, namely, it is not entirely the same as the depot that it starts from. An integer programming model is ...
A New Variant of Truck Scheduling for Transporting Container Problem
SoICT '19: Proceedings of the 10th International Symposium on Information and Communication TechnologyWe consider in this paper the truck scheduling for container transportation problem in which trucks and trailers are separate objects which can attach together for transporting containers. It is called Truck-Trailer-Container Routing Problem (TTCRP). In ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2009
6219 pages
ISBN:9781424427222
Publisher
IEEE Press
Publication History
Published: 17 June 2009
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025