DIGITAL LIBRARY ARCHIVE
HOME > DIGITAL LIBRARY ARCHIVE
< Previous   List   Next >  
A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo
Full-text Download
Hyun Soo Kim (Division of MIS, Dong-A University)
Hyung Rim Choi (Division of MIS, Dong-A University)
Nam Kyu Park (Department of Distribution Management, Tongmyong University)
Jae Hyung Cho (School of International Business and Area Studies, Busan University of Foreign Studies)
Vol. 12, No. 1, Page: 75 ~ 93
Keywords
Logistics, Optimal shipment, Ship selection, EPDS, LPDS, SBF
Abstract
The ship selection by consignors has two steps to carry their cargo. The first step is to select according to time schedule of ships and amount of cargo, and the second one is re-selection by concentrating different consignors' cargo into a unit that can be carried by single ship. Up to now, these steps are usually done by hands leading to inefficiency. The purpose of our paper is to form a logistics chain to minimize the overall sum of logistics cost by selecting ships for consignors' cargo using negotiation methodology between agents. Through concentration and distribution of cargo, maximization of global profit derived from searching optimal point in trade-off between inventory cost and freight rate cost. It is settled by the negotiation between consignors. In the experiments, two methods of the first-step of ship selection: EPDS(Earliest Possible Departure-Date Scheduling) and LPDS(Latest Possible Departure-Date Scheduling) coupled with the second-step ship concentration method using the negotiation were shown. From this, we deduced inventory cost, freight rates and logistics cost according SBF(Scheduling Bundle Factor) and analyzed the result. We found it will minimize the total logistics cost if we use negotiation method with EPDS.
Show/Hide Detailed Information in Korean
최적 화물 선적을 위한 화주 에이전트 기반의 협상방법론
김현수 (동아대학교 경영정보과학부)
최형림 (동아대학교 경영정보과학부)
박남규 (동명대학교 유통경영학과)
조재형 (부산외국어대학교 국제통상지역원)
Abstract
화주의 선박 선정과정은 선박과 화물의 일정에 따른 1차 선정과 화물을 재선적하여 하나의 단위로 선복을 집중시키는 2차 선정으로 구분된다. 지금까지 3자 물류업체는 이러한 선적업무가 수작업으로 진행됨으로써 비효율성을 초래하였다. 그러므로 본 연구에서는 에이전트 협상을 통해 전체 물류비를 감소시킬 수 있는 방안을 제안하고자 한다. 화물의 집중과 배분을 통해 얻을 수 있는 물류비 절감을 최대화시키기 위해 재고비와 운송비간의 상관관계에 서 최적점을 찾아야 하며 이를 화주간 협상으로 해결할 수 있다. 실험에서는 현업에서 이루어지는 화물 선적방법인 EPDS(Earliest Possible Departure-Date Scheduling)와 LPDS(Latest Possible Departure-Date Scheduling)에 본 협상방법론을 접목하여 SBF(Scheduling Bundle Factor, 선적동시 처리량)에 따른 재고비, 운송비 그리고 물류비등을 도출하고 실험결과를 분석하였다. 분석결과, 에이전트 기반의 협상방법론이 EPDS와 사용될 경우 전체 물류비를 최소화시킬 수 있었다.
Cite this article
JIIS Style
Kim, H. S., H. R. Choi, N. K. Park , and J. H. Cho, "A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo", Journal of Intelligence and Information Systems, Vol. 12, No. 1 (2006), 75~93.

IEEE Style
Hyun Soo Kim, Hyung Rim Choi, Nam Kyu Park , and Jae Hyung Cho, "A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo", Journal of Intelligence and Information Systems, vol. 12, no. 1, pp. 75~93, 2006.

ACM Style
Kim, H. S., Choi, H. R., Park , N. K., and Cho, J. H., 2006. A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo. Journal of Intelligence and Information Systems. 12, 1, 75--93.
Export Formats : BiBTeX, EndNote
Advanced Search
Date Range

to
Search
@article{Kim:JIIS:2006:249,
author = {Kim, Hyun Soo and Choi, Hyung Rim and Park , Nam Kyu and Cho, Jae Hyung},
title = {A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo},
journal = {Journal of Intelligence and Information Systems},
issue_date = {March 2006},
volume = {12},
number = {1},
month = Mar,
year = {2006},
issn = {2288-4866},
pages = {75--93},
url = {},
doi = {},
publisher = {Korea Intelligent Information System Society},
address = {Seoul, Republic of Korea},
keywords = { Logistics, Optimal shipment, Ship selection, EPDS, LPDS and SBF },
}
%0 Journal Article
%1 249
%A Hyun Soo Kim
%A Hyung Rim Choi
%A Nam Kyu Park
%A Jae Hyung Cho
%T A Negotiation Method based on Consignor's Agent for Optimal Shipment Cargo
%J Journal of Intelligence and Information Systems
%@ 2288-4866
%V 12
%N 1
%P 75-93
%D 2006
%R
%I Korea Intelligent Information System Society