The Journal of Society for e-Business Studies (한국전자거래학회지)

Society for e-Business Studies (한국전자거래학회)
권호 표지
DOI QR코드

DOI QR Code

A Study on Network Redesign for Supply Chain Expansion

공급 사슬 확장을 위한 네트워크 재설계에 관한 연구

  • Song, Byung Duk (Department of Industrial and Systems Engineering, KAIST) ;
  • Oh, Yonghui (Daejin University, Department of Industrial Management Engineering)
  • 송병덕 (KAIST 산업 및 시스템 공학과) ;
  • 오용희 (대진대학교 산업경영공학과)
  • Received : 2012.11.16
  • Accepted : 2012.11.23
  • Published : 2012.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

According to the environment change of market, supply chain network needs to be redesigned for efficient provision of product within the budget constraint. Also, it is desired that the customer satisfaction such as on time delivery should be considered as an important element at redesigning of supply chain network in addition to the cost reduction. In this paper redesign of supply chain network for its expansion is treated as a problem situation and a related mathematical model is suggested. Moreover, the numerical examples about the total weighted distance of the redesigned supply chain network are presented with various budget constraints by using genetic algorithm to help the managerial decision.

시장 상황의 변화에 따라 상품의 효율적인 공급을 위해 기업은 한정된 예산 내에서 공급 사슬을 변화시킬 필요가 있다. 또한, 경쟁의 심화로 공급 사슬 내에서의 비용 절감뿐만 아니라 적절한 공급 사슬의 구성을 통해 상품의 정시 배송 등 고객 만족도를 높이는 것은 점점 더 중요한 요소로 고려되고 있는 추세이다. 본 연구에서는 공급 사슬 확장에 따른 네트워크 재설계 문제를 다루고 있으며 이에 따른 수리 모형을 제안한다. 또한 유전 알고리즘을 이용하여 예산 제한의 변화에 따른 총 가중 거리의 변화를 계산하여 경영진의 의사결정을 도울 수 있는 방법을 모색한다.

Keywords

References

  1. Akinc, U. and Khumawala, B. M., "An Efficient Branch and Botmd Algorithm for the Capacitated Warehouse Location Problem," Management Science, Vol. 23, No. 6, pp. 585-594, 1977. https://doi.org/10.1287/mnsc.23.6.585
  2. Erlenkotter, D., "A Dual Based Procedure for Uncapacitated Facility Location," Operations Research, Vol. 26, No.6, pp. 992-1009, 1978. https://doi.org/10.1287/opre.26.6.992
  3. Harris, I., Mumford, C., and Naim, M., "The multi objective uncapacitated facility location problem for green logistics," GEC 09'. IEEE Congress 00 Evolutionary Computation, pp. 2732 - 2739, 2009.
  4. Kim, D. G. and Kim, Y. D., "A branch and bound algorithm for determining locations of long-term care facilities," European Journal of Operational Research, Vol. 206, No.1, pp. 168-177, 2010. https://doi.org/10.1016/j.ejor.2010.02.001
  5. Melachrinoudis, E. and Min, H., "The dynamic relocation and phase-out of a hybrid, two echelon plant/warehousing facility : a multiple objective approach," European Journal of Operational Research, Vol. 123, No.1, pp. 1-15, 2000. https://doi.org/10.1016/S0377-2217(99)00166-6
  6. Min, H. and Melachrinoudis, E., "The relocation of a hybrid manufacturing/distribution facility from supply chain perspectives : a case study," Omega. The International Journal of Management Science, Vol. 27, No.1, pp. 75-85, 1999. https://doi.org/10.1016/S0305-0483(98)00036-X
  7. Owen, S. H. and Daskin, M. S., "Strategic facility location : A review," European Journal of Operational Research, Vol. 111, No.3, pp. 423-447, 1998. https://doi.org/10.1016/S0377-2217(98)00186-6
  8. Pirkul, H. and Jayaraman, V., "A multicommodity, multi plant, capacitated facility location problem : formulation and efficient heuristic solution," Computers and Operatious Research, Vol. 25, No. 10, pp. 869-878, 1998. https://doi.org/10.1016/S0305-0548(97)00096-8
  9. Zhu, Z., Chu, F., and Su, L., "The capacitated plant location problem with customers and suppliers matching," Transportation Research Paer E : Logistics and Transportation Review, Vol. 46, No.3, pp. 469-480, 2010. https://doi.org/10.1016/j.tre.2009.09.002
  10. Wang, Q., Batra, R., Bhadury, J., and Rump, C. M., "Budget coustrained location problem with opening and closing facilities," Computers and Operations Research, Vol. 30, No. 13, pp. 2047-2069, 2003. https://doi.org/10.1016/S0305-0548(02)00123-5
  11. Tang, L., Jiang, W., and Saharidis, G. K. D., "An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions," Annals of Operations Research, DOI 1007/s10479-011-1050-9, 2012.
  12. Holland, J. H., Adaptation in natural and artificial systems, Michigan: University of Michigan Press, 1975.
  13. Jaramillo, J. H., Bhadury, J., and Batta, R., "On the use of genetic algorithms to solve location problems," Computers and Operations Research, Vol. 29, No.6, pp. 761-779, 2002. https://doi.org/10.1016/S0305-0548(01)00021-1

Cited by

  1. Minimizing the Total Stretch when Scheduling Flows of Divisible Requests without Interruption vol.20, pp.1, 2015, https://doi.org/10.7838/jsebs.2015.20.1.079