Abstract
Busan is one of the busiest seaports in the world where millions of containers are handled every year. The space of the container terminal at the port is so limited that several small container yards are scattered in the city. Containers are frequently transported between the container terminal and container yards, which may cause tremendous traffic problems. The competitiveness of the container terminal may seriously be aggravated due to the increase in logistics costs. Thus, there exist growing needs for developing an efficient fleet management tool to resolve this situation. This paper proposes a new fleet management procedure based on a heuristic tabu search algorithm in a container transportation system. The proposed procedure is aimed at simultaneously finding the minimum fleet size required and travel route for each vehicle while satisfying all the transportation requirements within the planning horizon. The transportation system under consideration is static in that all the transportation requirements are predetermined at the beginning of the planning horizon. The proposed procedure consists of two phases: In phase one, an optimization model is constructed to obtain a fleet planning with minimum vehicle travel time and to provide a lower bound on the fleet size. In phase two, a tabu search based procedure is presented to construct a vehicle routing with the least number of vehicles. The performance of the procedure is evaluated and compared with two existing methods through computational experiments.
This work was supported by Korea Research Foundation Grant. KRF-2001-003-E00080.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bae J W, Kim K H (2000) A pooled dispatching strategy for automated guided vehicles in port container terminals. International Journal of Management Science 6: 47–67
Beaujon G J, Turnquist M A (1991) A model for fleet sizing and vehicle allocation. Transportation Science 25: 19–45
Bish E K, Leong T Y, Li C L, Ng J W C (2001) Analysis of a new vehicle scheduling and location problem. Simchi-Levi D. Naval Research Logistics 48: 363–386
Bodin, L D, Golden, B L, Assad A A, Ball M O (1983) Routing and scheduling of vehicles and crews: the state of the art. Computers and Operation Research 10: 63–211
Breedam A V (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers and Operations Research 28: 289–315
Chao IM (2002) A tabu search method for truck and trailer routing problem. Computers and Operations Research 29: 33–51
Crainic T G, Laporte G (1998) Fleet management and logistics. Kluwer, Amsterdam
Du Y, Hall R (1997) Fleet sizing and empty equipment redistribution for center-terminal transportation networks. Management Science 43: 145–157
Fourer R, Gay D M, Kernighan B W (1993) AMPL a modeling language for mathematical programming. Boyd and Fraser, Massachusetts
Franca P M, Gendreau M, Laporte G, Muller F M (1996) A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. International Journal of Production Economics 43: 79–89
Gambardella L M, Rizzoli A E, Zaffalon M (1998) Simulation and planning of an intermodal container terminal. Simulation 71: 107–116
Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Computers and Operations Research 26: 699–714
Glover F (1989) Tabu search, part I. ORSA Journal on Computing 1: 190–206
Glover F (1997) Tabu search. Kluwer, Boston
Grunow M, Gunther H O, Lehmann M (2004) Dispatching multi-load AGVs in highly automated seaport container terminals. OR Spectrum 26: 211–235
Kim K H, Bae J W (1999) A dispatching method for automated guided vehicles to minimize delays of containership operations. International Journal of Management Science 5(1): 1–26
Kim K Y, Kim K H (1999) A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics 59: 425–433
Ko C S, Chung K H, Shin J Y (2000) Determination of vehicle fleet size for container shuttle service. Korean Management Science Review 17: 87–95
Kobza J E, Shen Y C, Reasor R J (1998) A stochastic model of empty-vehicle travel time and load request service time in light-traffic material handling systems. IIE Transactions 30: 133–142
Koo P H, Suh J D (2002) Fleet sizing under dynamic vehicle dispatching. Journal of Korean Institute of Industrial Engineering 28: 256–263
Kozan E, Preston P (1999) Genetic algorithms to schedule container transfers at multimodal terminals. International Transactions in Operational Research 6: 311–329
Laporte G, Osman H (1995) Routing problems: a bibliography. Annals of Operations Research 61: 227–262
Legato P, Mazza R M (2001) Berth planning and resources optimization at a container terminal via discrete event simulation. European Journal of Operational Research 133: 537–547
Maxwell W L, Muckstadt J A (1982) Design of automated guided vehicle systems. IIE Transactions 14: 114–124
Nanry W P, Barnes J W (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B 34: 107–121
Osman I H, Laporte G (1996) Metaheuristics: a bibliography. Annals of Operations Research 63: 513–628
Osman I H, Wassan N A (2002) A reactive tabu search metaheuristic for the vehicle routing problem with backhauls. Journal of Scheduling 5: 263–285
Park C H, Jun G S, Koh S Y, Kim D N, Kim Y C, Suh S D, Seol J H, Yun H M, Lee S M, Jang H B, Choi G J, Choe J S (2000) Introduction to transportation engineering. Yongji Monhwasa, Seoul
Rajotia S, Shanker K, Batra J L (1998) Determination of optimalAGV fleet size for an FMS. International Journal of Production Research 36: 1177–1198
Shabayek A A, Yeung W W (2002) A simulation model for the Kawi Chung container terminals in Hong Kong. European Journal of Operational Research 140: 1–11
Vis, I F A, de Koster R, Roodbergen K J (2001) Determination of the number of automated guided vehicles required at a semi-automated container terminal. Journal of the Operational Research Society 52: 409–417
Vis, I F A, de Koster R (2003) Transshipmment of containers at a container terminal: An overview. European Journal of Operational Research 147: 1–16
Yun W Y, Choi Y S (1999) A simulation model for container-terminal operation analysis using an object-oriented approach. International Journal of Production Economics 59: 221–230
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Koo, P.H., Lee, W.S., Jang, D.W. (2005). Fleet sizing and vehicle routing for container transportation in a static environment. In: Günther, HO., Kim, K.H. (eds) Container Terminals and Automated Transport Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26686-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-26686-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22328-3
Online ISBN: 978-3-540-26686-0
eBook Packages: Business and EconomicsBusiness and Management (R0)