Browse > Article

Empty Containers Distribution Problem considering the Container Ship Route  

Shin, Sang-Hoon (Department of Industrial Engineering, Pusan National University)
Moon, Il-Kyeong (Department of Industrial Engineering, Pusan National University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.35, no.1, 2009 , pp. 92-100 More about this Journal
Abstract
Today international trade through maritime transportation is significantly increasing. Due to this increase, shipping companies are faced with problems concerning the repositioning of empty containers from import dominant ports. The liner shipping service network has been provided to transport containers which load customers' freights. Container ships are moved on the liner shipping service network by observing the predetermined route and transportation time. This research deals with the empty containers distribution problem considering the container ship route. A mathematical model based on the mixed integer program has been introduced in this study. The objective is to minimize the total relevant costs of empty containers such as handling, leasing, and inventory holding, etc. Due to the complexity of the problem, a genetic algorithm has been suggested to solve large sized problems within a reasonable time. Numerical experiments have been conducted to show the efficiency of the genetic algorithm.
Keywords
Empty Containers Distribution; Container Ship Route; Genetic Algorithm; Mixed Integer Program;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Gen, M. and Cheng, R. (1997), Genetic Algorithm and Engineering Design, (New York : Wiley)
2 Li, J. A., Liu, K., Leung, S. C., Lai, K. K. (2004), Empty container management in a port with long-run average criterion, Mathematical and Computer Modeling, 40, 85-100   DOI   ScienceOn
3 Luca C., Raffaele P., Walter U. (2006), Minimizing fleet operating costs for a container transportation company, European Journal of Operational Research, 171, 776-786   DOI   ScienceOn
4 Gendron B. and Crainic T. G. (1997), A parallel branch and bound algorithm for multicommodity location with balancing requirements, Computers and Operations Research, 24, 829-847   DOI   ScienceOn
5 Wan K. and Levary R. R. (1995), A linear-programming based price negotiation procedure for contracting shipping companies, Transportation Research A, 29(3), 173-186
6 Li, J. A., Leung, S. C., Wu, Y., Liu, K. (2007), Allocation of empty containers between multi-ports, European Journal of Operational Research, 182, 400-412   DOI   ScienceOn
7 Crainic, T. G., Gendreau, M., Soriano, P., Toulouse M. (1993), A tabu search procedure for multicommidity location/allocation with balancing requirements, Annals of Operations research, 41, 359-383   DOI
8 Shen, W.S., Khoong, C. M. (1995), A DSS for empty container distribution planning, Decision Support Systems, 15, 75-82   DOI   ScienceOn
9 Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, (Addison Wesley)
10 Koichi S., Akio I., Etsuko N., Stratos P. (2007), The container shipping network problem with empty container repositioning, Transportation Research Part E, 43, 39-59   DOI   ScienceOn
11 Crainic T. G. and Delorme L. (1993), Dual ascent procedures for multicommodity location allocation problems with balancing requirements, Transportation Science, 27(2), 90-101   DOI
12 Hossein J., Anastasios C., Petros I. (2006), Port dynamic empty container reuse, Transportation Research Part E, 42, 4360
13 Crainic T. G., Dejax P. and Delorme L. (1989), Models for multimode multicommodity location problems with interdepot balancing requirements, Annals of Operations Research, 18, 279-302
14 Hyundai Merchant Marine co., Ltd, HMM. (2008), http://www.hmm21.com