Browse > Article
http://dx.doi.org/10.12812/ksms.2012.14.4.153

A case study on algorithm development and software materialization for logistics optimization  

Han, Jae-Hyun (School of Business, Kwangwoon University)
Kim, Jang-Yeop (Dept. of Information & Industrial Engineering, Yonsei University)
Kim, Ji-Hyun (School of Business, Kwangwoon University)
Jeong, Suk-Jae (School of Business, Kwangwoon University)
Publication Information
Journal of the Korea Safety Management & Science / v.14, no.4, 2012 , pp. 153-168 More about this Journal
Abstract
It has been recognized as an important issue to design optimally a firm's logistics network for minimizing logistics cost and maximizing customer service. It is, however, not easy to get an optimal solution by analyzing trade-off of cost factors, dynamic and interdependent characteristics in the logistics network decision making. Although there has been some developments in a system which helps decision making for logistics analysis, it is true that there is no system for enterprise-wise's on-site support and methodical logistics decision. Specially, E-biz process along with information technology has been made dramatic advance in a various industries, there has been much need for practical education closely resembles on-site work. The software developed by this study materializes efficient algorithm suggested by recent studies in key topics of logistics such as location and allocation problem, traveling salesman problem, and vehicle routing problem and transportation and distribution problem. It also supports executing a variety of experimental design and analysis in a way of the most user friendly based on Java. In the near future, we expect that it can be extended to integrated supply chain solution by adding decision making in production in addition to a decision in logistics.
Keywords
Logistics Decision-making; Location & Allocation Problem; Traveling Salesman Problem; Transportation-Distribution Problem; Logistic Software Development;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Brandao, J.C.S., Mercer, A.(1998), "The multi-trip vehicle routing problem," Journal of the Operational Research Society, 49, 799-805.   DOI
2 Clarke, G., Wright, J.W.(1964), "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, 12, 568-581.   DOI   ScienceOn
3 Gillett, B., Miller, L.(1974), "A heuristic for the vehicle dispatching problem," Operations Research, 22, 340-349.   DOI   ScienceOn
4 Kalantari, B., Hill, A.V., Arora, S.R.(1985), "An algorithm for the traveling salesman problem with pickup and delivery customers". European Journal of Operational Research, 22, 377-386.   DOI   ScienceOn
5 Laporte, G., Nobert, Y., Taillefer, S.(1988), "Solving a family of multi-depot vehicle routing and location-routing problems," Transportation Science, 22, 161-172.   DOI   ScienceOn
6 Lau, H.C., Sim, M., Teo, K.M.(2003), "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, 148, 559-569.   DOI   ScienceOn
7 Sule, D.R.(1998), Manufacturing Facilities Location, Planning, and Design Second Edition, PWS Publishing Company.
8 Taillard, E.D.(1999), "A heuristic column generation method for the heterogeneous Fleet vrp," RAIRO Recherche Operationnelle, 33(1), 1-14.   DOI   ScienceOn
9 www.beanshell.org
10 www.eclipse.org