Abstract
Positioning empty containers is one of the most effective ways to solve the container imbalance problem and is affected by the capacity of depots. A shipping company will be more competitive if the depot capacity is large. This study provides a decision tool for planning the expansion of depot capacity. Mathematical models are utilized to minimize the total relevant costs that include the capacity expansion cost, storage space leasing cost, inventory holding cost, container leasing cost, and positioning cost. The problem is formulated as a mixed integer program. Then, we develop a heuristic algorithm that is based on Lagrangian relaxation. Computational experiments are conducted to evaluate the performance of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berman O, Ganz Z (1994) The capacity expansion problem in the service industry. Comput Oper Res 21:557–572
Chen H (2007) A lagrangian relaxation approach for production planning with demand uncertainty. Eur J Ind Eng 1:370–390
Crainic TG, Delorme L (1993) Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements. Transp Sci 27:90–101
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, Gendreau M, Soriano P, Toulouse M (1993) A tabu search procedure for multicommodity location/allocation with balancing requirements. Ann Oper Res 41:359–383
Dong JX, Song DP (2009) Container fleet sizing and empty repositioning in liner shipping systems. Transp Res E 45:860–877
Fisher ML (1985) An application oriented guide to lagrangian relaxation. Interfaces 15:10–21
Francesco MD, Crainic TG, Zuddas P (2009) The effect of multi-scenario policies on empty container repositioning. Transp Res E 45:758–770
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
Guignard M (2003) Lagrangean relaxation. Top 11:151–228
Herrera CAA, Özdemir D, Ríos MC (2009) Capacity planning in a telecommunications network: a case study. Int J Ind Eng - Theory, Appl Pract 16:82–90
Imai A, Sintani K, Papadimitriou S (2009) Multi-port vs. hub-and-spoke port calls by containerships. Transp Res E 45:740–757
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
Luss H (1982) Operation research and capacity expansion problem: a survey. Oper Res 30:907–947
Moon IK, Do Ngoc AD, Hur YS (2010) Positioning empty container among multiple ports with leasing and purchasing consideration. OR Spectr 32:765–786
Shen WS, Khoong CM (1995) A DSS for empty container distribution planning. Decis Support Syst 15:75–82
Acknowledgments
The authors are grateful to the careful and constructive reviews from the associate editor and two anonymous referees. This work was supported by the Grant of the Korean Ministry of Education, Science and Technology (The Regional Core Research Program/Institute of Logistics Information Technology).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Do Ngoc, AD., Moon, IK. The storage capacity expansion and space leasing for container depots. Flex Serv Manuf J 23, 364–384 (2011). https://doi.org/10.1007/s10696-011-9075-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10696-011-9075-6