Browse > Article
http://dx.doi.org/10.7236/JIIBC.2018.18.3.209

Improvement for Facility Location Problem of Perishable Commodities  

Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.18, no.3, 2018 , pp. 209-214 More about this Journal
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.
Keywords
Perishable Commodity; Transportation Time Constraints; Facility Location Problem;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
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   DOI
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   DOI
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   DOI
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   DOI
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