• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.209-214
• /
• 2018

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.

• Journal of the Korea Safety Management & Science
• /
• v.6 no.3
• /
• pp.141-152
• /
• 2004

Supply chains for agricultural commodities with their various constraints such as production lead time, seasonal production, and methods of storage are limited in the extent to which techniques like Just-in-Time (JIT) inventory management can be applied. It is beyond the ability of producers to control harvest time and many agricultural products are perishable so that they can incur exceptional losses in storage if they are not handled correctly. This is a source of additional costs and inefficiency in supply chain management. The purpose of this study is to reduce or eliminate such sources of loss and inefficiency and to identify success factors for the JIT inventory management system where it can be applied for agricultural products. Where JIT techniques can be applied in supply chain management for agricultural products, costs such as transportation, inventory, and storage losses can be reduced with concurrent increases in efficiency. In the paper, some of the problems associated with applying JIT inventory control methods in supply chain management for agricultural commodities will be reported through a series of case studies.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.05a
• /
• pp.191-201
• /
• 2004

Supply chains for agricultural commodities with their various constraints such as production lead time, seasonal production, and methods of storage are limited in the extent to which techniques like Just-in-Time (JIT) inventory management can be applied. It is beyond the ability of producers to control harvest time and many agricultural products are perishable so that they can incur exceptional losses in storage if they are not handled correctly. This is a source of additional costs and inefficiency in supply chain management. The purpose of this study is to reduce or eliminate such sources of loss and inefficiency and to identify success factors for the JIT inventory management system where it can be applied for agricultural products. Where ]IT techniques can be applied in supply chain management for agricultural products, costs such as transportation, inventory, and storage losses can be reduced with concurrent increases in efficiency. In the paper, some of the problems associated with applying ]IT inventory control methods in supply chain management for agricultural commodities will be reported through a series of case studies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.135-143
• /
• 2012

This paper suggests the optimal blood distribution center algorithm that satisfies the minimum total transportation cost and within the allowable distribution time $T^*$. Zhang and Yang proposes shifting the location of each point that has less than the average distance of two maximum distance points from each point. But they cannot decide the correct facility location because they miscompute the shortest distance. This algorithm computes the shortest distance $l_{ij}$ from one area to another areas. Then we select the $v_i$ area to thecandidate distribution center location such that $_{max}l_{ij}{\leq}L^*$ and the $v_i$ such that $l_{ij}-L^*$ area that locates in ($v_i,v_k$) and ($v_j,v_l$) from $P_{ij}=v_i,v_k,{\cdots},v_l,v_j$ path and satisfies the $_{max}l_{ij}{\leq}L^*$ condition. Finally, we decide the candidate distribution area that has minimum transportation cost to optimal distribution area.