Abstract
With the recent development of container transportation, the imbalance of empty containers among ports has become more serious. We consider the problem of positioning empty containers. The goal of this study is to propose a plan for transporting empty containers between container ports (terminals) to reduce the imbalance. There is currently a demand at each port and any backlog of containers is not permitted. The objective is to minimize the total relevant costs such as transportation cost, handling cost, and holding cost, etc. In this study, we develop a model with respect to the leasing and purchasing of containers. Mixed integer programming and genetic algorithms are used to solve the model. A hybrid GA is also proposed to reduce the computation time while still obtaining an acceptable result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Crainic TG, Dejax P, Delorme L (1989) Models for multimode multicommodity location problems with interdepot balancing requirements. Ann Oper Res 18: 279–302
Crainic TG, Delorme L (1993) Dual-ascent procedures for multicommodity location–allocation problems with balancing requirements. Transport Sci 27: 90–101
Crainic TG, Gendreau M, Soriano P, Toulouse M (1993) A Tabu search procedure for multicommodity location/allocation with balancing requirements. Ann Oper Res 41: 359–383
Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York
Gendron B, Crainic TG (1997) A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Comput Oper Res 24: 829–847
Gendron B, Potvin JY, Soriano P (2003) A Tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Ann Oper Res 122: 193–217
Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, USA
Li JA, Liu K, Leung SCH, Lai KK (2004) Empty container management in a port with long-run average criterion. Math Comput Model 40: 85–100
Li JA, Leung SCH, Wu Y, Liu K (2007) Allocation of empty containers between multi-ports. Eur J Oper Res 182: 400–412
Lou YC, Guinard M, Chen CH (2001) A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization. J Intel Manufact 12: 509–919
Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, USA
Pedroso JP (1998) An evolutionary solver for linear integer programming. BSIS Technical Report No. 98–7
Rajasekharan M, Peters BA, Yang T (1998) A genetic algorithm for facility design in flexible manufacturing system. Int J Prod Res 36: 95–110
Shen WS, Khoong CM (1995) A DSS for empty container distribution planning. Decis Support Syst 15: 75–82
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moon, IK., Ngoc, AD.D. & Hur, YS. Positioning empty containers among multiple ports with leasing and purchasing considerations. OR Spectrum 32, 765–786 (2010). https://doi.org/10.1007/s00291-010-0197-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-010-0197-0