Documente Academic
Documente Profesional
Documente Cultură
Abstract: - There are major differences between standard vehicle transportation problems and ship models.
Therefore, the classical transportation problem is not a good model for the maritime transportation. This paper
proposes the application of three dimensional transportation problems (3D) in maritime activity. We briefly
present the three dimensional maritime transportation models and the main known results obtained in solving
such difficult problems.
∑x
n as well as their cost structure. Due to
ij = ai , i = 1,...,m frequent fluctuations in the ship market,
j= 1
even two identical ships may have quite
∑x
m
bj, j = 1,...,n, different cost structures;
ij =
i=1 • ships do not necessarily return to their
xij ≥ o for all i , j origin;
We have to determine the optimal shipments • there are more sources of uncertainty and
from a given set of origins to a given set of much longer voyages in maritime
destinations in such a way as to minimize the total transportation.
transportation costs. The problem is constrained by All these arguments denote that the standard
known upper limits on the supply at the various transportation model can not apply to simulate ship
origins and by the necessity to satisfy the known problems.
demand at each destination.
The classical transportation model assumes that
the per unit cost for each potential origin destination 2 Maritime Transport Modeling
pair is known a priori. The model doesn’t take in Obviously, we have to consider more indices to
consideration the type of ship, the various build realistic maritime transportation models. By
commodities to be transported, the different introducing the third index for the types of vessel
characteristics of the vessels and other factors which used to transport homogeneous commodity, we
also can influence the total cost of transportation. obtain a three dimensional maritime transportation
Also, it cannot be assumed that carriers will be model. It is very clear that the multidimensional
able to serve every origin-destination pair for which transportation models could be very good
they are the least-cost carrier because of capacity representations of real situations, but the
constraints on the various carriers. Consequently, it computational problems are really very difficult.
is impossible to assign, a priori, the appropriate per More indices we introduce, more realistic the
unit transportation costs necessary to use classic maritime transportation models become; in the same
time, the problems become more and more difficult
There are two distinct types of constraints for the Finally it is obvious that the introduction of the
variables xijk : third index complicates very much the model
structure, although the model still remains a linear
a. Planar Constraints (PC)
programming problem. On the other hand, the three
Fixing two indexes of the matrix { xijk }, i, j, the
dimensional maritime transportation models allow a
summation of xijk , for all k, should be equal to the better representation of real studied systems.
3P - - - * * *
References:
3A * * * - - - [1] E. Constantinescu, Utilisation de divers modeles
2P - - - * * - mathematiques en transports maritime, Taol
Lagad, Vol. 70, 1995.
2A * * - - - - [2] G. B. Dantzig, Application of the Simplex
AP - - * * - - Method to a Transportation Problem, Activity
Analysis of Production and Allocation,
Koopmans Publishing House, 1951.
K.B. Haley [4] is the author of the algorithm for [3] B. Haley, The Solid Transportation Problem,
solving the three planar transportation problem. His Operations Research 10, 1962.
algorithm is an entirely spreading of “modi method”, [4] B. Haley, The Multi-Index Problem, Operations
a refinement of simplex applied to the classical Research 11, 1963.
transportation problem (G.B. Dantzig [2]). We have [5] W. Junginger, Zur Losung des
to point out that some problems remain concerning dreidimensionalen Transport problems,
the computational aspects and also nothing for its Operations Research Verfahren, 13, 1972.
solution is described by Haley. W. Junginger [5] [6] D. Ronnen, Ship Scheduling, European Journal
made some advances in the above mentioned of Operational Research, 71, 1993
problems.
It is not very difficult to see that the 2A, 2P and
AP transportation models are not representative for
the three dimensional case; more exactly, these three
mentioned models could be solved as classical
transportation problems [1].
Taking into account that we also know to reduce
the three axial model to a three planar transportation
problem, it’s easily to conclude that theoretically, we
can solve any three dimensional transportation
problem. Practically, it is difficult due to the loose of
triangularity of the bases in the multi dimensional