대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제33권4호
  • /
  • Pages.439-446
  • /
  • 2007
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

기간별 수요가 변하는 상황에서의 입지선정 문제에 관한 연구

The Multi-period Demand Changing Location Problem

  • 최순식 (연세대학교 정보산업공학과) ;
  • 이영훈 (연세대학교 정보산업공학과)
  • Choi, Soon-Sik (Department of Information and Industrial Engineering, Yonsei University) ;
  • Lee, Young-Hoon (Department of Information and Industrial Engineering, Yonsei University)
  • 발행 : 2007.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A new location model, where the demand varies by periods, and the facility at each period can be open or closed depending on the demand, is discussed in this paper. General facility location problem is extended with the assumption that demands per period vary. A mixed integer programming is suggested and the solution is found for various instances which are randomly generated. Instances included various cases with respect to the length of periods, moving distance of customer locations, and cost structure. The characteristics of optimal solutions are analyzed for various cases, and it is shown that demand changing location model can be applied in a practical fields of supply chains.

키워드

참고문헌

  1. Al-sultan, K. S. and AI-Fawzan, M. A. (1999). A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research, 86, 91-103 https://doi.org/10.1023/A:1018956213524
  2. Akinc, U. and Khumawala, B. M. (1977). An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem. Management Science, 23, 585-594 https://doi.org/10.1287/mnsc.23.6.585
  3. Barcelo, J. and Casanovas, J. (1984). A heuristic lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research, 15, 212-226 https://doi.org/10.1016/0377-2217(84)90211-X
  4. Barreto, S., Ferreira, C., Paixao, J., and Santos, B. S, (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179, 968-977 https://doi.org/10.1016/j.ejor.2005.06.074
  5. Bektas, T. (2006). Capacitated facility location : Separation algorithms and computational experience, Mathematical Programming, 81, 149-175
  6. Brandeau, M. L. and Chiu, S. S. (1989). Anoverview of representative problems in location research. Management Science, 35, 645-674 https://doi.org/10.1287/mnsc.35.6.645
  7. Captivo, M. E. (1991). Fast primal and dual heuristic for the p-median location problem. European Journal of Operational Research, 52, 65-74 https://doi.org/10.1016/0377-2217(91)90336-T
  8. Cho, G. (2006). A study on developing an integrated Model of facility location problems and safety stock optimization problems in supply chain management. International Journal of Management Science, 31, 91-103
  9. Dobson, G. and Karmarkar, U. S. (1987). Competitive Location on a Network. Operations Research, 35, 467-486
  10. Erlenkotter, D. (1978). A dual-based procedure for uncapacitated facility location. Operations Research, 26, 992-1009 https://doi.org/10.1287/opre.26.6.992
  11. Gamal, M.D. H.and Salhi, S. (2001). Constructive heuristics for the uncapacitated continuous location-allocation problem. Journal of the Operational Research Society, 52, 821-829 https://doi.org/10.1057/palgrave.jors.2601176
  12. Geoffrion, A. M. and McBride, R. (1978). Lagrangian relaxation applied to capacitated facility location problems. AIlE Transactions, 10, 40-47 https://doi.org/10.1080/05695557808975181
  13. Ghosh, D. (2003). Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research, 150, 150-162 https://doi.org/10.1016/S0377-2217(02)00504-0
  14. Hinojosa, Y., Puerto, J., and Fernandez, F. R. (2000). A multiperiod two-echelon multicommodity capacitated plant location problem. European Journal of Operational Research, 123, 271-291 https://doi.org/10.1016/S0377-2217(99)00256-8
  15. Hong, S. H. and Lee, Y.H. (2004). The Maximal Covering Location Problem with Cost Restrictions. Journal of the Korean Institute of Industrial Engineers, 30, 93-106
  16. Jin, H. W. (2006). A study on the Budget Constrained Facility Location Problem. Journal Business Research, 21, 263-283
  17. Kang, I. S. (1984). An heuristic algorithm for the location-routing problem. Journal of the Korean Institute of Industrial Engineers, 10, 45-50
  18. Kim, E. J., Kang, D. H., Lee, K. S., and Park, S. S. (2003). An Optimization Algorithm for the Two-Echelon Capacitated Facility Location Problem. Journal of the Korean Institute of Industrial Engineers, 2003, 137-144
  19. Kuen, A. A. and Hamburger, M. J. (1963). A Heuristic Program for Locating Warehouses. Management Science, 9, 643-666 https://doi.org/10.1287/mnsc.9.4.643
  20. Lee, Y. H., Jong, B. J., and Park, K. T. (2002). Supply Chain Management : Strategy, Planning and Operation, book concern Sukjung
  21. Megiddo, N., Zemel, E., and Hakimi, S. L. (1983). The Maximum Coverage Location Problem, SIAM journal on Algebraic and Discrete Methods, 4, 253-261 https://doi.org/10.1137/0604028
  22. Melkote, S. and Daskin, M. S. (2001). Capacitated facility location / network design problems. European Journal of Operational Research, 129, 481-495 https://doi.org/10.1016/S0377-2217(99)00464-6
  23. Ndiaye, M. and Alfares, H. (2006). Modeling health care facility location for moving population groups. Computers and Operation Research, In Press, Corrected Proof, Available online 27 October 2006
  24. Neebe, A. E. and Rao, M. R. (1983). An algorithm for the fixed charge assigning users to sources problem. Journal of the Operational Research Society, 34, 1107-1113 https://doi.org/10.1057/jors.1983.242
  25. Sankaran, J. K. (2007). On solving large instances of the capacitated facility location problem. European Journal of Operational Research, 178, 663-676 https://doi.org/10.1016/j.ejor.2006.01.035
  26. Sun, M. (2006). Solving the uncapacitated facility location problem using tabu search. Computers and Operational Research, 33, 2563-2589 https://doi.org/10.1016/j.cor.2005.07.014
  27. Van Roy, T. J. and Erlenkotter, D. (1982). A dual-based procedure dynamic facility location. Management Science, 28, 1091-1105 https://doi.org/10.1287/mnsc.28.10.1091
  28. Wang, Q., Batta, R., Bhadury, J., and Rump, C. M. (2003). Budget constrained location problem with opening and closing of facilities. Computers and Operational Research, 30, 2047-2069 https://doi.org/10.1016/S0305-0548(02)00123-5
  29. Webb, M. H. J. (1968). Cost Functions in the Location of Depots for Multi-Delivery journeys. Opnl. Res. Q., 19. 311-328 https://doi.org/10.1057/jors.1968.74
  30. Wu, L. Y., Zhang, X. S., and Zhang, J.L. (2006). Capacitated facility location problem with general setup cost. Computers and Operational Research, 33, 1226-1241 https://doi.org/10.1016/j.cor.2004.09.012
  31. Yang, B. H. (1999). A study on Location-Allocation Problem with the Cost of Land. Journal of Military Operations Research Society Of Korea, 25, 117-129