한국인터넷방송통신학회논문지 (The Journal of the Institute of Internet, Broadcasting and Communication)

  • 제13권5호
  • /
  • Pages.173-181
  • /
  • 2013
  • /
  • 2289-0238(pISSN)
  • /
  • 2289-0246(eISSN)
한국인터넷방송통신학회 (The Institute of Internet, Broadcasting and Communication)
권호 표지
DOI QR코드

DOI QR Code

복합상품 운송 문제의 간단한 해법

Simple Solution for Multi-commodity Transportation Problem

  • 이상운 (강릉원주대학교 멀티미디어공학과) ;
  • 최명복 (강릉원주대학교 멀티미디어공학과)
  • Lee, Sang-Un (Dept. of Multimedia Engineering, Gangnung-Wonju National University) ;
  • Choi, Myeong-Bok (Dept. of Multimedia Engineering, Gangnung-Wonju National University)
  • 투고 : 2013.02.20
  • 심사 : 2013.10.11
  • 발행 : 2013.10.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문은 복합상품 운송 문제의 최적해를 구하는 단순한 발견적 방법을 제안한다. 제안 알고리즘은 첫 번째로, 복합상품 중개운송 문제인 경우 일반적인 운송 문제로 변환시킨다. 이 과정에서 중개지를 공급지로, 중개지의 수용량 제약조건을 공급량으로 치환한다. 다음으로 단일 상품으로 분해한다. 두 번째로, 복합상품 운송문제인 경우 상품별로, 복합상품 중개운송 문제인 경우는 직접 열 (수요지) 기준으로 최소 비용을 선택한다. 행 (공급지) 기준으로 선택된 비용 오름차순으로 공급량, 수용량과 요구량 제약조건을 만족하도록 수송량을 배정한다. 주어진 요구량을 모두 만족할 때까지 이 과정을 반복한다. 이렇게 얻은 초기해에 대해 세 번째로, 수송비용을 감소시킬 수 있는 조건을 만족하면 배정량을 조정한다. 이와 같이 단순한 알고리즘을 2개의 복합상품 운송 문제와 3개의 복합상품 중개운송 문제에 적용한 결과, 선형계획법으로 최적해를 제시한 3개 문제 중 2개 문제에서 최적해를 개선하는 효과를 얻었다. 결국, 제안된 알고리즘은 선형계획법을 적용하는 방법보다 좋은 알고리즘으로 판명되었다.

This paper proposes a heuristic optimal solution of multicommodity transportation problem. The proposed algorithm has 3 steps. First the proposed algorithm transforms multicommodity transshipment problem to a general transportation problem, but if the problem is a multicommodity transportation problem, it is not transformed. And the multicommodity is disassembled to a single commodity. Second if it is a multicommodity transportation problem, the algorithm selects the minimum cost according to commodity, on the other hand if it is a multicommodity transshipment problem, the algorithm directly selects the minimum cost based on demand area. And the algorithm assigns carloadings to be satisfied the supply and demand quantity. The algorithm repeats these processes until a given demand quantity is satisfied. Last if it has a condition that is able to reduce the transportation expense, the proposed algorithm controls the assignment quantity of the initial value that got from the step 2. The proposed algorithm was applied to two multicommodity transportation problem and three multicommodity transshipment problem and it got more good result than an existing linear programming method.

키워드

참고문헌

  1. Wikipedia, "Transportation Problem," http://en. wikipedia.org/wiki/Transportation_problem, Wikimedia Foundation Inc., 2008.
  2. W. L. Winston, J. B. Goldberg, and M. Venkataramanan, "Introduction to Mathematical Programming: Operations Research," Vol. 1, 4th edition, Duxbury Pr, 2003.
  3. L. Ntaimo, "Transportation and Assignment Problems," http://ie.tamu.edu/INEN420_2005Spring/SLIDES/Chapter 7.pdf, 2005.
  4. 강진규, "Operations Research," http://secom.hanbat.ac.kr/or/ch06/right04.html, 한밭대학교, 2006.
  5. Wikipedia, "Multi-commodity Flow Problem," http://en.wikipedia.org/wiki/Multi-commodity_Flow_Problem, Wikimedia Foundation Inc., 2008.
  6. J. Lindstr"om, "Multicommodity Network Flow - Methods and Applications," Linkoping University, http://www.ida.liu.se/-TDDB19/reports-2003/mcnf.pdf, 2003.
  7. I-Lin, "Shortest Paths and Multicommodity Network Flows," Ph. D Thesis, Department of Industrial and Information Management, National Cheng Kung University, Taiwan, 2003.
  8. P. M. Pardalos and E. Romeijn, "Heuristic Procedures for Supply Chain Problems with Multi-commodities and Fixed Charge Cost Functions," Sandra Duni Eusioglu, http://www.ise.ufl.edu/Scimec/sandra.pdf, 2002.
  9. C. Barnhart and N. H. M. Wilson, "Network Problems - Transportation Operations, Planning and Control: Carrier Systems", reference to Network Flows: Theory, Algorithms, and Applications (Ahuja, Magnanti, Orlin), http://ocw.mit.edu/NR/rdonlyres/Civil-and-Environmental-Engineering/, 2004.
  10. C. M. Monsere, "A Review of a Multicommodity Network Flow Models for Freight Transportation Planning," Department of Civil and Construction Engineering, Iowa State University, http://web.cecs.pdx.edu/-monserec/papers/econ576.pdf, 1999.
  11. Sugoo.com, "Distribution/Logistics Examples," http://info.sugoo. com/CN/Ebook/电子书籍/运作管理/Distribution Examples.xls, 2007.
  12. R. W. Woodruff, "SAS/OR User's Guide: Mathematical Programming," http://www.sph.emory.edu/computing/unix/ sas/sas8OnlineDoc/ormp/chap3/sect59.htm, Emory University, 2005.
  13. Sang-Un Lee, "A Reverse-Delete Algorithm for Assignment Problems," Journal of Advanced Information Technology and Convergence, pp. 117-126, vol. 10, no. 8, 2012. 8.
  14. Sang-Un Lee, Myeong-Bok Choi, "Optimal Algorithm for Transshipment Problem", The Institute of Internet, Broadcasting and Communication (IIBC), pp. 153-162, vol. 1, no. 13, 2013. 02.