The Journal of the Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회논문지)

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Improvement for Facility Location Problem of Perishable Commodities

부패상품 임시물류센터에 대한 위치 문제 개선

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 과학기술대학 멀티미디어공학과)
  • Received : 2018.04.01
  • Accepted : 2018.06.08
  • Published : 2018.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper suggests simple algorithm of facility location problem in perishable commodities that satisfy with minimum total transportation cost and within the transportation time constraint $L^*$. For this problem, Lee[4] suggests very complex algorithm that decides candidate facility locations, computes total transportation cost for each candidate facility location, then moving the location to optimal location for top two facilities. On the other hand, this paper simply determines the candidate facility locations within $L^*$ using subtree concept, and decides optimal minimal total transportation cost for top two locations in centralized area of required quantity using neighborhood concept.

본 논문은 부패상품의 수송시간 제약조건 $L^*$이내로 총 수송비용을 최소화시키는 물류센터 위치를 결정하는 문제의 단순한 알고리즘을 제안하였다. 이 문제에 대해 Lee[4]는 후보 물류센터 위치를 선정하고, 각 물류센터의 총 수송비용을 구한 후, 상위 2개 물류센터에 대해 최적의 위치로 이동시키는 복잡한 방법을 제안하였다. 반면에 본 논문에서는 서브트리 개념을 도입하여 $L^*$ 이내가 되는 후보 물류센터의 위치를 간단히 결정하고, 근방 개념을 도입하여 요구량이 집중화된 지역 상위 2개 지역에 대해 총 수송비용이 최소화되는 지점을 단순히 최적의 위치로 결정하였다.

Keywords

References

  1. M. Zhang and J. Yang, "Optimization Modeling and Algorithm of Facility Location Problem in Perishable Commodities Emergency System," The International Conference on Natural Computation (ICNC), IEEE Computer Society, pp. 246-250, Aug. 2007. doi:10.1109/ICNC.2007.525
  2. K. H. Hahn, H. Hwang, and S. W. Shinn, "A Returns Policy for Distribution Channel Coordination of Perishable Items," European Journal of Operational Research, Vol. 152, No. 3, pp. 770-780, Feb. 2004. doi:10.1016/S0377-2217(02)00753-1
  3. H. A. Eiselt and C-L, Sandblom, "Decision Analysis, Location Models, and Scheduling Problems, Part II: Location and Layout Decisions, Chapter 2. Location Models on Networks," pp. 169-210, Springer-Verlag Berlin Heidelberg, 2004. ISBN:978-3-540-24722-7
  4. S. U. Lee, "Facility Location Problem for Blood Logistics Center," Journal of The Institute of Internet, Broadcasting and Communication (IIBC), Vol. 12, No. 2, pp. 135-143, Apr. 2012. doi:10.7236/JIWIT.2012.12.2.135
  5. H. S. Hwang, "A Stochastic Set-covering Location Model for Both Ameliorating and Deteriorating Items," Computers & Industrial Engineering, Vol. 46, No. 2, pp. 313-319, Apr. 2004. doi:10.1016/j.cie.2003.12.010
  6. O. Berman, Z. Drezner, and G. O. Wesolowsky, "Locating Service Facilities Whose Reliability is Distance Dependent," Computers and Operations Research, Vol. 30, No. 11, pp. 1683-1695, Sep. 2003. doi:10.1016/S0305-0548(02)00099-0
  7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms (2nd ed.), Section 24.3: Dijkstra's Algorithm", MIT Press and McGraw-Hill. pp. 595-601, 2001. ISBN-13:978-0262032933