지능정보연구 (Journal of Intelligence and Information Systems)

  • 제12권4호
  • /
  • Pages.39-51
  • /
  • 2006
  • /
  • 2288-4866(pISSN)
  • /
  • 2288-4882(eISSN)
한국지능정보시스템학회 (Korea Intelligent Information System Society)
권호 표지

공 컨테이너의 임대 계획을 위한 수리계획모형 및 해법

Mathematical Models for Leasing Purchasing Empty Containers

  • 박선욱 (부산대학교 공과대학 산업공학과) ;
  • 전수민 (부산대학교 공과대학 산업공학과) ;
  • 김갑환 (부산대학교 공과대학 산업공학과)
  • Park, Sun Wook (Department of Industrial Engineering, Pusan National University) ;
  • Jeon, Su Min (Department of Industrial Engineering, Pusan National University) ;
  • Kim, Kap Hwan (Department of Industrial Engineering, Pusan National University)
  • 발행 : 2006.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

선사에서 화물을 수송하기 위해 필요한 공(빈) 컨테이너 수요를 만족시키기 위해서 컨테이너를 구매하고 임대하는 계획을 작성하는 방법에 대해서 다루었다. 수요의 변동을 고려하여 각 기간별로 구매 또는 임대하여야 할 컨테이너의 개수와 임대기간을 결정하는 방법을 제시하였다. 컨테이너 구매 및 임대 계획작성을 위한 확정적 수리계획 모형을 제안하였으며 이 모형의 해를 구하기 위한 발견적 기법을 제안하였다.

This study addresses how to plan purchasing and leasing of containers to satisfy the demand on containers. The problem can be further decomposed into the long-term planning and the short-term scheduling. The long-term plan specifies the composition of owned containers, long-term leasing containers, and short-term containers. The short-term plan considers the seasonality of demand and determines the time of leasing and the amount of the short-term and the long-term leasing containers. The length of the planning horizon is 10-20 years for the long-term planning, while it is one year for the short-term planning. The time unit is one year for the long-term planning, while it is one month for the short-term planning. This study discusses how to estimate the demand of containers and proposes deterministic models for scheduling purchasing and leasing of containers.

키워드

참고문헌

  1. Abrache, J., Crainic, T. G., Gendreau, M. A New Decomposition Algorithm for the Deterministic Dynamic Allocation of Empty Containers, http://www.crt.umontreal. ca/～theo/articles.html. 2001.
  2. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. Network flows, Prentice‐hall, (1993), 304-305.
  3. Cheung, R. K., Chen, C. Y. A Two‐Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem, Transportation Science, Vol.32, No.2 (1998), 142-162. https://doi.org/10.1287/trsc.32.2.142
  4. Crainic, T. G., Dejax, P., and Delorme, L. Models for Multimode Multicommodity Location Problems with Interdepot Balancing Requirements, Annals of Operations Research, 18(1989), 279-302.
  5. Crainic, T. G. and Gendreau, M. Modelling the Container Fleet management Problem using a Stochastic Dynamic Approach, CRT-685, Centre de recherche sur les transports. 1990.
  6. Crainic, T. G., Gendreau, M., Soriano, P., Toulouse M. A Tabu Search Procedure for Multicommidity Location/Allocation with Balancing Requirements, Annals of Operations research, 41(1993a), 359-383. https://doi.org/10.1007/BF02023001
  7. Crainic, T. G., Gendreau, M., and Dejax, P. Dynamic and Stochastic Models for the Allocation of Empty Containers, Operations Research, Vol.41, No.1(1993b), 105-125.
  8. Crainic, T. G. and Delorme, L. Dual- Ascent Procedures for Multicommodity Location‐Allocation Problems with Balancing Requirement, Transportation Science, 27 (1993c), 90-101. https://doi.org/10.1287/trsc.27.2.90
  9. Crainic, T. G. and Laporte, G. Planning Models for Freight Transportation, European Journal of Operational Research 97, (1997), 409-438. https://doi.org/10.1016/S0377-2217(96)00298-6
  10. Dejax, P. J. and Crainic, T. G. A Review of Empty Flows and Fleet Management Models on Freight Transportation, Transportation Science, 21(1987), 227-247. https://doi.org/10.1287/trsc.21.4.227
  11. Du, Y. and Hall, R. (1997), Fleet Sizing and Empty Equipment Redistribution for Center-Terminal Transportation Networks, Management Science, Vol.43, No.2, 145-157. https://doi.org/10.1287/mnsc.43.2.145
  12. Gedron, B. and Crainic, T. G., A Parallel Branch‐and Bound Algorithm for Multicommodity Location with Balancing Requirements, Computers & Operations Research, Vol.24, No.9(1997), 829-847. https://doi.org/10.1016/S0305-0548(96)00094-9
  13. Hall, R. W. Stochastic Freight Flow Patterns: Implications for Fleet Optimization, Transportation Research A,33, (1999), 449-465.
  14. Lai, K. K., Lam, K. K. and Chan, D. Shipping Container Logistics and Allocation, Journal of the Operational Research Society, 46(1995), 687-697. https://doi.org/10.1057/jors.1995.98
  15. Lowe, J. W., Francis, R. L., and Reinhardt, E. W. A Greedy Network Algorithm for a Warehouse Leasing Problem, AI IE Transactions, Vol.11, No.3(1979), 170-182. https://doi.org/10.1080/05695557908974459
  16. Veinott, A. F. and Wagner, H. M. Optimal Capacity Scheduling-I, Operations Research, 10(1962), 518-532. https://doi.org/10.1287/opre.10.4.518
  17. Veinott, A. F. and Wagner, H. M. Optimal Capacity Scheduling-I, Operations Research, 10(1962), 533-546. https://doi.org/10.1287/opre.10.4.533