c - IARIA Journals
c - IARIA Journals
c - IARIA Journals
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
International Journal on Advances in Systems and Measurements, vol 5 no 3 & 4, year 2012, http://www.iariajournals.org/systems_and_measurements/<br />
Note that when and are nonempty, the total<br />
number of estimated EC supplies could be not<br />
equal to the total number of estimated EC demands<br />
. Thus, we propose to move as many excess ECs of<br />
surplus ports as possible to the deficit ports to satisfy their<br />
demands. Hence, when<br />
, a<br />
transportation model is formulated as follows to determine<br />
the repositioned quantities in each period:<br />
R<br />
min S DCi,<br />
j zi,<br />
j, t<br />
z iP <br />
i, j , t<br />
t jP (9)<br />
t<br />
(10)<br />
s.t. , , , ,<br />
S S<br />
D zi j t u<br />
j P i t i P<br />
<br />
t<br />
t<br />
, , , ,<br />
D D<br />
S zi j t u<br />
i P j t j P<br />
<br />
t<br />
(11)<br />
t<br />
S D<br />
zi, j, t 0, i Pt , j Pt<br />
(12)<br />
Constraints (10) ensure that the repositioned out ECs of a<br />
surplus port should not exceed its estimated EC supply;<br />
constraints (11) ensure that the EC demand of a deficit port<br />
can be fully satisfied; constraints (12) are the non-negative<br />
quantity constraints. When<br />
, similar<br />
model is built by substituting<br />
and<br />
, for (10) and (11), respectively.<br />
B. The Optimization Problem<br />
Let be the expected total cost per period with the<br />
fleet size and policy . The problem, which is to optimize<br />
the fleet size and the parameters of the policy in terms of<br />
minimizing the expected total cost per period, can be<br />
formulated as<br />
min J( N,<br />
γ )<br />
(13)<br />
N , γ<br />
subject to the inventory dynamic equations (1)~(3) and the<br />
single-level threshold policy. As in many papers on empty<br />
container movement (see, e.g., [9] [11]), the variables that<br />
relate to the flow of ECs are considered as continuous<br />
variables in this study. That is, the fleet size and the<br />
parameters of the policy are considered as real numbers in<br />
this study. It is fine when the values of these variables are<br />
large.<br />
In general, it is difficult to solve problem (13), since there<br />
is no closed-form formulation for the computation of<br />
involving the repositioned empty container quantities<br />
determined by transportation models. However, when the<br />
transportation model is balanced in period , i.e., the total the<br />
total number of estimated EC supplies, namely is<br />
equal to the total number of estimated EC demands,<br />
namely , the excess ECs in all surplus ports can be<br />
fully repositioned out to satisfy the demands of all deficit<br />
ports. Hence, the inventory position of each port can be kept<br />
at its target threshold level in this period, i.e., .<br />
Further, the EC repositioning cost in next period will be only<br />
related to the customer demands in this period. From (3), (7)<br />
and (8), we obtain that<br />
if and only<br />
if<br />
. Hence, an important property of the problem<br />
is presented as follows:<br />
Property I: When the fleet size is equal to the sum of<br />
thresholds, the inventory position of a port can be always<br />
maintained at its target threshold value and then the EC<br />
repositioning cost in a period is only dependent on the<br />
customer demands.<br />
Let Scenario-I (Scenario-II) be the scenario in<br />
which<br />
. Taking advantage of this<br />
property, we propose two approaches to solve problem (13)<br />
under both scenarios, respectively.<br />
1) Scenario-I<br />
Consider the problem under Scenario-I. From Property I,<br />
it implies that , and only the EC holding<br />
and leasing cost in a period is related to values of and .<br />
Hence, the optimal solution which minimizes should<br />
be equivalent to the optimal solution which minimizes the<br />
expected EC holding and leasing cost per period. From (6),<br />
since that holding and leasing cost function for each port is<br />
independent, the problem (13) under Scenario-I can be<br />
simplified to an non-linear programming (NLP) problem as<br />
follows:<br />
H O L O <br />
p p p p p <br />
p <br />
min E C ( ) C ( )<br />
2012, © Copyright by authors, Published under agreement with <strong>IARIA</strong> - www.iaria.org<br />
N , γ<br />
<br />
pP s.t. N p<br />
pP where the subscript in the notation of is dropped since<br />
customer demands in each period are independent and<br />
identically distributed. The NLP problem can be further<br />
decomposed into independent newsvendor problems with<br />
the optimal solutions as follows:<br />
<br />
F C C C<br />
(14)<br />
* 1<br />
L L H<br />
p p p p p<br />
N <br />
(15)<br />
* *<br />
pP p<br />
where is the inverse function of .<br />
2) Scenario-II<br />
The problem under Scenario-II is more complex than that<br />
under Scenario-I, since the EC repositioning cost is also<br />
affected by the values of and . Consider that the<br />
minimum expected holding and leasing cost of problem (13)<br />
can only be achieved under Scenario-I due to the convexity<br />
of the holding and leasing cost function. The problem under<br />
Scenario-II is worth to study if and only if the minimum<br />
expected EC repositioning cost under this scenario could be<br />
less than that under Scenario-I.<br />
167