Journal Search Engine

to

Search Advanced Search Adode Reader(link)
Download PDF Export Citation Korean Bibliography PMC Previewer
ISSN : 1229-6783(Print)
ISSN : 2288-1484(Online)
Journal of the Korea Safety Management & Science Vol.14 No.4 pp.153-168
DOI :

기업 물류망 최적 설계 및 운영을 위한 알고리즘 설계 및 소프트웨어 구현 사례

한 재 현*, 김 장 엽**, 김 지 현*, 정 석 재*
*광운대학교 경영학부, **연세대학교 정보산업공학과

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

Suk-Jae Jeong*, Jae-Hyun Han*, Jang-Yeop Kim**, Ji-Hyun Kim*
*School of Business, Kwangwoon University
**Dept. of Information & Industrial Engineering, Yonsei University

Abstract

It has been recognized as an important issue to design optimally a firm's logistics network for minimizinglogistics cost and maximizing customer service. It is, however, not easy to get an optimal solution byanalyzing trade-off of cost factors, dynamic and interdependent characteristics in the logistics network decisionmaking. Although there has been some developments in a system which helps decision making for logisticsanalysis, it is true that there is no system for enterprise-wise's on-site support and methodical logisticsdecision. Specially, E-biz process along with information technology has been made dramatic advance in avarious industries, there has been much need for practical education closely resembles on-site work. Thesoftware developed by this study materializes efficient algorithm suggested by recent studies in key topics oflogistics such as location and allocation problem, traveling salesman problem, and vehicle routing problem andtransportation and distribution problem. It also supports executing a variety of experimental design and analysisin a way of the most user friendly based on Java. In the near future, we expect that it can be extended tointegrated supply chain solution by adding decision making in production in addition to a decision in logistics.
Logistics Decision-making,Location & Allocation Problem,Traveling Salesman Problem,Transportation-Distribution Problem,Logistic Software Development
2 정석재 153-168.pdf1.07MB

Reference

1. Brandão, J.C.S., Mercer, A.(1998), "The multi-trip vehicle routing problem," Journal of the Operational Research Society, 49, 799-805.
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.
3. Gillett, B., Miller, L.(1974), "A heuristic for the vehicle dispatching problem," Operations Research, 22, 340-349.
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.
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.
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.
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 Opérationnelle, 33(1), 1-14.
9.www.beanshell.org
10.www.eclipse.org
  1. SEARCH

  2. Online Submission

    http://submission.koreasafety.or.kr

  3. KSSM

    The Korean Society of Safety ManagementWaste Society

  4. Editorial Office
    Contact Information

    - Tel: +82.31.336.2844
    - Fax: +82.31.336.2845
    - E-mail: safety@mju.ac.kr