|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Multiple issues|essay-like=May 2012|unreferenced=May 2012}}
| | Hello! Permit me get started by expressing my title - Gail and I imagine it seems really excellent when you say it. Arkansas has constantly been my residence. [http://www.accounting.net/ Accounting] has been my day work for a whilst. To go to health is a single of the items I appreciate most. I've been working on my website for some time now. Look at it out in this article: http://icsi.sakura.ne.jp/shop/xoops/userinfo.php?uid=60094<br><br>Stop by my blog ... [http://icsi.sakura.ne.jp/shop/xoops/userinfo.php?uid=60094 Salomon Schuhe Kids] |
| | |
| The '''Transshipment problem''' has a long and rich history. It has its origins in medieval times when trading started to become a mass phenomenon. Firstly, obtaining the minimal—cost transportational route had been the main priority, however technological development slowly gave place to minimal—durational transportation problems. Transshipment problems form a subgroup of transportational problems, where [[transshipment]] is allowed, namely transportation can, or in certain cases has to shipped through intermediate nodes.
| |
| | |
| == Overview ==
| |
| | |
| Transshipment or Transhipment is the [[shipment]] of [[Cargo|goods]] or [[Intermodal container|containers]] to an intermediate destination, and then from there to yet another destination. One possible reason is to change the [[means of transport]] during the journey (for example from [[ship transport]] to [[road transport]]), known as [[transloading]]. Another reason is to combine small shipments into a large shipment (consolidation), dividing the large shipment at the other end (deconsolidation). Transshipment usually takes place in [[transport hub]]s. Much international transshipment also takes place in designated [[customs area]]s, thus avoiding the need for customs checks or duties, otherwise a major hindrance for efficient transport.
| |
| | |
| == Formulation of the problem ==
| |
| | |
| A few initial assumptions are required in order to formulate the transshipment problem completely:
| |
| | |
| * The system consists of ''m'' origins and ''n'' destinations, with the following indexing respectively: <math>i=1,\ldots, m</math>, <math>j=1,\ldots, n</math>
| |
| | |
| * One uniform good exists which needs to be shipped
| |
| | |
| * The required amount of good at the destinations equals the produced quantity available at the origins
| |
| | |
| * Transportation simultaneously starts at the origins and is possible from any node to any other (also to an origin and from a destination)
| |
| | |
| * Transportation costs are independent of the shipped amount
| |
| | |
| == Notations ==
| |
| | |
| * <math>t_{r,s}</math>: time of transportation from node ''r'' to node ''s''
| |
| | |
| * <math>a_i</math>: goods available at node ''i''
| |
| | |
| * <math>b_{m+j}</math>: demand for the product at node ''(m+j)''
| |
| | |
| * <math>x_{r,s}</math>: actual amount transported from node ''r'' to node ''s''
| |
| | |
| == Mathematical formulation of the problem ==
| |
| | |
| The goal is to minimize <math>\sum\limits_{i=1}^m \sum\limits_{j=1}^n t_{i,j} x_{i,j} </math> subject to:
| |
| | |
| * <math> x_{r,s}\geq 0 </math>; <math>\forall r=1\ldots m </math>, <math>s=1\ldots n</math>
| |
| | |
| * <math>\sum_{s=1}^{m+n}{x_{i,s}}-\sum_{r=1}^{m+n}{x_{r,i}}=a_i</math>; <math>\forall i=1\ldots m</math>
| |
| | |
| * <math>\sum_{r=1}^{m+n}{x_{r,m+j}}-\sum_{s=1}^{m+n}{x_{m+j,s}}=b_{m+j}</math>; <math>\forall j=1\ldots n</math>
| |
| | |
| * <math>\sum_{i=1}^{m}{a_i}=\sum_{j=1}^{n}{b_{m+j}}</math>
| |
| | |
| == Solution ==
| |
| | |
| Since in most cases an explicit expression for the objective function does not exist, an alternative method is suggested by [[Rajeev Garg|Rajeev]] and [[Satya Prakash|Satya]]. The method uses two consecutive phases to reveal the minimal durational route from the origins to the destinations. The first phase is willing to solve <math>n\cdot m</math> [[time-minimizing problem]], in each case using the remained <math>n+m-2</math> intermediate nodes as transshipment points. This also leads to the minimal-durational transportation between all sources and destinations. During the second phase a standard time-minimizing problem needs to be solved. The solution of the time-minimizing transshipment problem is the joint solution outcome of these two phases.
| |
| | |
| === Phase 1 ===
| |
| | |
| Since costs are independent from the shipped amount, in each individual problem one can normalize the shipped quantity to ''1''. The problem now is simplified to an assignment problem from ''i'' to ''m+j''. Let <math>x'_{r,s}=1</math> be ''1'' if the edge between nodes ''r'' and ''s'' is used during the optimization, and ''0'' otherwise. Now the goal is to determine all <math>x'_{r,s}</math> which minimize the objective function:
| |
| | |
| <math>T_{i,m+j}=\sum_{r=1}^{m+n}\sum_{s=1}^{m+n}{t_{r,s}\cdot x'_{r,s}}</math>,<br />
| |
|
| |
| such that
| |
| | |
| * <math>\sum_{s=1}^{m+n}{x'_{r,s}}=1</math>
| |
| | |
| * <math>\sum_{r=1}^{m+n}{x'_{r,s}}=1</math>
| |
| | |
| * <math>x'_{m+j,i}=1</math>
| |
| | |
| * <math>x'_{r,s}=0,1</math>.
| |
| | |
| ==== Corollary ====
| |
| | |
| * <math>x'_{r,r}=1</math> and <math>x'_{m+j,i}=1</math> need to be excluded from the model; on the other hand, without the <math>x'_{m+j,i}=1</math> constraint the optimal path would consist only of <math>x'_{r,r}</math>-type loops which obviously can not be a feasible solution.
| |
| | |
| * Instead of <math>x'_{m+j,i}=1</math>, <math>t_{m+j,i}=-M</math> can be written, where ''M'' is an arbitrarily large positive number. With that modification the formulation above is reduced to the form of a [[assignment problem|standard assignment problem]], possible to solve with the [[Hungarian method]].
| |
| | |
| === Phase 2 ===
| |
| | |
| During the second phase, a time minimization problem is solved with ''m'' origins and ''n'' destinations without transshipment. This phase differs in two main aspects from the original setup:
| |
| * Transportation is only possible from an origin to a destination
| |
| | |
| * Transportation time from ''i'' to ''m+j'' is the sum of durations coming from the optimal route calculated in Phase 1. Worthy to be denoted by <math>t'_{i,m+j}</math> in order to separate it from the times introduced during the first stage.
| |
| | |
| ==== In mathematical form ====
| |
| | |
| The goal is to find <math>x_{i,m+j}\geq 0</math> which minimize
| |
| | |
| <math>z=max\left\{t'_{i,m+j}: x_{i,m+j}>0\;\; (i=1\ldots m,\; j=1\ldots n)\right\}</math>,<br />
| |
| such that
| |
| | |
| * <math>\sum_{i=1}^{m}{x_{i,m+j}}=a_i</math>
| |
| | |
| * <math>\sum_{j=1}^{n}{x_{i,m+j}}=b_{m+j}</math>
| |
| | |
| * <math>\sum_{i=1}^{m}{a_i}=\sum_{j=1}^{n}{b_{m+j}}</math>
| |
| | |
| This problem is easy to be solved with the method developed by [[Satya Prakash|Prakash]]. The set <math>\left\{t'_{i,m+j}, i=1\ldots m,\; j=1\ldots n\right\}</math> needs to be partitioned into subgroups <math>L_k, k=1\ldots q</math>, where each <math>L_k</math> contain the <math>t'_{i,m+j}</math>-s with the same value. The sequence <math>L_k</math> is organized as <math>L_1</math> contains the largest valued <math>t'_{i,m+j}</math>'s <math>L_2</math> the second largest and so on. Furthermore, <math>M_k</math> positive priority factors are assigned to the subgroups <math>\sum_{L_k}{x_{i,m+j}}</math>, with the following rule:
| |
| | |
| <math>\alpha M_k-\beta M_{k+1}=\left\{\begin{array}{cc}-ve, & if\; \alpha<0\\ ve, & if\; \alpha>0 \end{array}\right.</math>
| |
| | |
| for all <math>\beta</math>. With this notation the goal is to find all <math>x_{i,m+j}</math> which minimize the goal function
| |
| | |
| <math>z_1=\sum_{k=1}^{q}{M_k}\sum_{L_k}{x_{i,m+j}}</math>
| |
| | |
| such that
| |
| | |
| * <math>\sum_{i=1}^{m}{x_{i,m+j}}=a_i</math>
| |
| | |
| * <math>\sum_{j=1}^{n}{x_{i,m+j}}=b_{m+j}</math>
| |
| | |
| * <math>\sum_{i=1}^{m}{a_i}=\sum_{j=1}^{n}{b_{m+j}}</math>
| |
| | |
| * <math>\alpha M_k-\beta M_{k+1}=\left\{\begin{array}{cc}-ve, & if\; \alpha<0\\ ve, & if\; \alpha>0 \end{array}\right.</math>
| |
| | |
| == Sources ==
| |
| * [http://www.new.dli.ernet.in/rawdataupload/upload/insa/INSA_2/20005a6a_449.pdf Rajeev Garg and Satya Prakash: Time Minimizing Transshipment Problem (1983)]
| |
| | |
| == References ==
| |
| <references/>
| |
| *R.J Aguilar, Systems Analysis and Design. Prentice Hall, Inc. Englewood Cliffs, New Jersey (1973) pp. 209–220
| |
| *H. L. Bhatia, K. Swarup, M. C. Puri, Indian J. pure appl. Math. 8 (1977) 920-929
| |
| *R. S. Gartinkel, M. R. Rao, Nav. Res. Log. Quart. 18 (1971) 465-472
| |
| *G. Hadley, Linear Programming, Addison-Wesley Publishing Company, (1962) pp. 368–373
| |
| *P. L. Hammer, Nav. Res. Log. Quart. 16 (1969) 345-357
| |
| *P. L. Hammer, Nav. Res. Log. Quart. 18 (1971) 487-490
| |
| *A.J.Hughes, D.E.Grawog, Linear Programming: An Emphasis On Decision Making, Addison-Wesley Publishing Company, pp. 300–312
| |
| *H.W.Kuhn, Nav. Res. Log. Quart. 2 (1955) 83-97
| |
| *A.Orden, Management Sci, 2 (1956) 276-285
| |
| *S.Parkash, Proc. Indian Acad. Sci. (Math. Sci.) 91 (1982) 53-57
| |
| *C.S. Ramakrishnan, OPSEARCH 14 (1977) 207-209
| |
| *C.R.Seshan, V.G.Tikekar, Proc. Indian Acad. Sci. (Math. Sci.) 89 (1980) 101-102
| |
| *J.K.Sharma, K.Swarup, Proc. Indian Acad. Sci. (Math. Sci.) 86 (1977) 513-518
| |
| * W.Szwarc, Nav. Res. Log. Quart. 18 (1971) 473-485
| |
| | |
| [[Category:Transport economics]]
| |
| [[Category:Transportation planning]]
| |
| [[Category:Commercial item transport and distribution]]
| |