Browse > Article
http://dx.doi.org/10.7236/JIIBC.2013.13.5.173

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)
Publication Information
The Journal of the Institute of Internet, Broadcasting and Communication / v.13, no.5, 2013 , pp. 173-181 More about this Journal
Abstract
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.
Keywords
Transportation Problem; Multicommodity Transportation Problem; Linear Programming; Heuristic Method;
Citations & Related Records
연도 인용수 순위
  • Reference
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.