Академический Документы
Профессиональный Документы
Культура Документы
ABSTRACT
The scheduling method of shiplock has a strong influence on the improvement of shiplock capacity. On the condition
that the number of the ships waiting for the lock was relatively stable, the paper constructed an optimization model for
joint scheduling of double line shiplock based on the nonlinear goal programming. The hard constraints included that
the number of ships arranged in the shiplocks couldn't exceed the number of the ships waiting for the lock. The soft
constraints included arranging the ships with the priority and time limit as far as possible, and maximizing the utility of
the lock chambers. Then the objective function was constructed. Considering the characteristics of the nonlinear goal
programming mode, the Hooke – Jeeves algorithm was used to solve the model. In the end, a double line shiplock of
Jiangsu province was taken to verify the scientificity and feasibility of the model.
Keywords: Double line shiplock, optimization of joint scheduling, nonlinear goal programming model, Hook- Jeeves
algorithm.
"
1. Introduction
Shiplocks are the major influence factors which will decision-making problem. Siswanto et al. [4]
restrict the navigation capacity of waterway [1]. presented a ship inventory routing and scheduling
With the rapid development of social economy, as problem with undedicated compartments, and their
infrastructure of logistics network, the inland objective of the problem is to find a minimum cost
waterway is valued more by people. But the solution while satisfying a number of technical and
shiplocks still affect the efficiency of inland physical constraints within a given planning
waterway transport. The optimization of shiplocks’ horizon. Andersson et al. [5] introduced and solved
scheduling is very important to improve the a planning problem faced by shipping companies
throughput of shiplocks and the utilization of lock operating in a special segment of tramp shipping
chamber. According to the number of ships sailing called project shipping. Guo [6] set up a dynamic
parallel on the channel the shiplocks can be model on the traffic capacity of the three gorges
divided into singel line, double line, three line etc. ship lock based on the structural and dynamic
As the number of double line and three line locks method to obtain the potential capacity, which
increases gradually, the study of how to realize describes the dynamic relationship between the
joint scheduling of double line locks and giving full cargo-boat tonnage, operating time, ship number,
play to the advantages of the combination is of efficiency of using area with traffic capacity. Xu et
great significance. al. [7] analyzed the concepts and features of
symmetric shiplock designed a dispatching
There’re many researches on the shiplock model of secondary symmetric ship lock with high
scheduling made by domestic and overseas feasibility and applicability, constructed an open
scholars. Kim et al. [2] proposed the general symmetric shiplock’s dispatching model contains
Packing aggregating model for the arrangement of information model, queue model, ship combination
ships and analyzed the two main advantages of in lock chamber model and joint scheduling model.
this method. Wang et al. [3] investigated a ship Li et al. [8] established a mathematical scheduling
lock scheduling problem and proposed a data- model considering the two goals of the utilization
driven approach, which is a typical optimizing and rate of lock chamber and the first come first serve
192" Vol."12,"April"2014"
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang."/"192ど200"
and made the Xiangjiang as an experiment. Shang the four types. The four types are: extremely large-
et al. [9] analyzed influential factors of multiple- sized (T, W>7m), large-sized (D, 6m<Wø7m),
lane lock’s joint scheduling for Changzhou hydro- medium-sized (Z, 5m <Wø 6m), small-sized (X, W
junction project and then built a computer ø 5m), where “W” represents the width of the ships.
simulation model based on the lockage operating
procedures, which included anchorage, channel & 2.2 Rules design for the queuing ships
approach channel, parallel four-lane ship lock,
ship’s joint scheduling, etc. Zhao [10] proposed a In combination with the practical operation
new model of lock service satisfaction degree scheduling of shiplock, the paper consider mainly
which is constructed by the method of structural four modes.
equation modeling based on the analysis of the
lock service theory and the satisfaction theory. Mode1: The first service for the first arrival way. The
Wang [11] made a simulation research on the principle of “first service for the first arrival” is
scheduling of shiplock from the perspective of applied to the common ships in the waiting queues.
quality of service. Liu [12] studied on how to
reduce two-dimensional packing problem to one- Mode2: The single service way. The principle of
dimension, the mathematical model is constructed “single service” is applied to the ships (such as the
and then algorithm for the problem based on ships with hazardous articles on it) which accord
greedy algorithm. With the technology with the condition to pass the ship lock separately.
development, the scheduling simulation is also It should be noted that the number of ships which
studied [13-15]. can meet this way is small, and usually
corresponding ship lock can be directly pre-
The above-mentioned studies mainly carried out arranged according to the size of the ship.
for single ship lock, rarely researched on specific Therefore, in the later discussion of the model,
model of double line lock operation. In fact, with related symbols are in the situation that ships
the increasing demand for shipping, double line which meet this way have been arranged in
and three line shiplock have become a very addition to the number of locks.
common phenomenon. Double line shiplock
scheduling problem is not a simple combination of Mode3: The priority service way. The principle of
single lock scheduling. It includes not only the “priority service” is applied to the ships (such as
design of single lock queue rules, the reasonable the ships which transport national emergency
arrangements of lock chamber, but also how to supplies) which accord with the preferential
realize the two lock joint scheduling to take condition to pass the ship lock.
advantage of the combination and realize the
maximization of the lock throughput. Mode4: The time limit service way. Define the
“waiting time limit” according to the different ships,
Basing on the situation that the number of ships and once the waiting time of some ships exceeds
waiting in line lock at a certain time is relatively the limit, these ships should be arranged to pass
stable, the paper aims at using the nonlinear goal the ship lock as soon as possible.
programming model to study the double lock joint
optimization scheduling model ,. It also uses a The ships that do not meet Mode 2 to Mode 4
global scheduling strategy based on the analysis of should be orderly arranged to pass the
the double line shiplock [16]. corresponding ship lock according to mode one.
Journal"of"Applied"Research"and"Technology 193
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang"/"192ど200"
different sizes, lengths and widths of the lock are ships waiting and the maximized utilization of lock
not the same. chamber. Suppose that the frequency of shiplock E
adopting feasible scheme Ei is xEi, the frequency of
The first shiplock E, specification lE×qE, the second shiplock F adopting feasible scheme Fj is xFj.
shiplock F, specification lF×qF. If two shiplocks are
of the same specification, it can be seen as an 3.2 The construction of nonlinear programming
exception of the above-mentioned situation, the model
model of this paper can be used as well.
(1) The tough constraints
(2) In the queue line, after ships of the Mode 2 has
been scheduled, four types of ships are recorded The actual arrangement number of the extremely
respectively as {bT, bD, bZ, bX}. Ships of the large-sized ships in the two large chamber does
Mode 3 are recorded as {bPT, bPD, bPZ, bPX}. not exceed the number of the extremely large-
Ships of the Mode 4 are recorded as {bLT, bLD, sized ships in the waiting queues, it means:
r? ·100%.
TB complete the arrangements as far as possible
(1)
before the priority lockage of ordinal number of the
CB two shiplocks. For the extremely large-sized ships
that meets the he Mode 3, we can get:
194" Vol."12,"April"2014"
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang."/"192ど200"
Âa EDi © x Ei - Â a FDj © xFj +d iD - d iD ? biD Â aEXi © xEi - Â aFXj © xFj +dlX- / dlX+ ? blX
m
iD
niD mlX nlX
- +
(7) (13)
i ?1 j ?1 i ?1 j ?1
i ?1 j ?1
EZi iZ iZ
Å i ?1 Ö Å i ?1 Ö
The symbol meaning of miD, niD, miZ, niZ, miX, nix, d , + r · x x (14)
j ?1 j ?1
iD
- d r / d r ? ri
d-iD, d+iZ, d-iZ, d+iX and d-iX are the same with the Eq. (6).
/ -
ÂxEi - ÂxFj - d s/ / d s- ? Si
Where mlt and nlt are the ordinal number of E and
F shiplocks' priority lockage that meets the Mode m n
4, which can be calculated according to the each (15)
lockage time and the limit of the allowed lockage i ?1 j ?1
time. d+iT and d-iT stand for the positive and negative
deviation value of the extremely large-sized ships Si is the ideal total lockage of the two shiplocks
between the actual arrangement number of the and it can be set according to the actual data of
extremely large-sized ships and the number of the shiplock's operation, d-s and d+s are positive and
ships that need to be arranged before ordinal negative deviation between the actual value and
number of the allowing priority arrangements of the ideal value of two shiplocks' total arrangement
shiplocks' lockage. of the lockage.
Similarly, as for the large, medium and small ships 5) Considering the point of the technology and
which meet the type four respectively: safety of the combined operation, the number of
Journal"of"Applied"Research"and"Technology 195
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang"/"192ど200"
the two shiplock's lockage should be basically the Where wlT, wlD, wlZ, wlX are the weights of four
same. Then: different types of ships in the service time-limited
f 3 ? min }d r/
utilization rate of the lock chamber maximum, then:
f 4 ? min }d s-
scheduling and goal programming, the decision be as little as possible, then:
variables have the following constraints:
(21)
Ê
Í xES 0
Íx
Í FS
5) In level 5, the number of the two shiplock's
0
Í xEi 0
f5 ? min }d p/ - d p-
lockage should be basically the same, then:
Í
Ë xFj 0
Í -
(17) (22)
Íd h 0
Í /
Íd h 0
On the basis of Eq. (17) - (21), the objective
Íd - © d - ? 0
Ì h h
function is:
min z ? P1 f1 - P2 f 2 - P3 f3 - P4 f 4 - P5 f5
? Â Pi fi
Where i=1,2,…,m; j=1,2,…,n; h=iT$iD$iZ$iX$ 5 (23)
lT$lD$lZ$IX$s$r$p.
i ?1
f1 ? min }wiT di/T - wiD di/D - wiZ di/Z - wiX di/X (18)
service, then: In summary, this paper constructs the optimal joint
operation model of the double line shiplock and the
objective function is the Eq. (23) and constraints
are the Eq. (2)- (17). The model can be written as
Eq. (24). In Eq. (24), xEs, xFs, xEi, xFj, d+h , d¢h œ 0,
Where wiT, wiD, wiZ ,wiX stand for the weights of four
d+h · dh¢ =0, here i = 1, 2, …, m; j = 1, 2, …, n; h =iT,
different types of ships in the service prior
iD, iZ, iX, lT, lD, lZ, IX, s, r, p. From Eq. (24), it can
arrangements. Propose that wiT △ wiD △ wiZ △ wiX.
be seen that the model is a nonlinear goal
programming model.
2) In level 2$to meet the ships with the time-limited
196" Vol."12,"April"2014"
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang."/"192ど200"
impossible to use simplex method to solve the movement moves along the decreasing direction of
problem. According to the features of this model, the objective function in order to further reduce the
we are ready to adopt the Hooke-Jeeves algorithm value of the objective function. The effectiveness
[18] to solve the model. of this model is based on goal programming
problems in each priority class that has multiple
Hooke - Jeeves algorithm was originally a method solutions for constraint conditions, but the number
to solve unconstrained problem and its calculation of solutions decreases as the priority decreases.
includes two kinds of motion: detection motion and Combining the detection motion and imitation
imitation motion. The detection motion moves motion, Hooke - Jeeves algorithm is used to solve
along the axis direction to find out the decreasing the joint optimization scheduling model.
direction of the objective function. The imitation of
ÂPf
The steps that the paper constructed are as follows:
m in z ?
5
T
i ?1 Step1: Fix the initial point x=(x1, x2, …, xN) , the
i i
Í Â a ETi © x Ei - Â a FTj © x Fj bT
Ê m movement step h=(h1, h2, …, hN) T
n and the
calculation precision i.
Í i ?1 j ?1
Í Â a EDi © x Ei - Â a FDj © x Fj bD
Í m n
Step2: Set x(0)=x, start from x(0) to detect motion by
Í i ?1 j ?1
Í m
Í Â a EZi © x Ei - Â a FZj © x Fj bZ
using Hooke- Jeeves algorithm.
n
Í i ?1 j ?1
Í m
Step3: Whether the detective movement is
Í Â a EXi © x Ei - Â a FXj © x Fj b X
n successful? If it is successful, turn to Step5,
Í i ?1 otherwise, turn to Step4.
Í miT
j ?1
ÍÂ Â
Í a ·x - a ·x - d / / d - ? b
niT
Step4: Determine whether hiøi for all i=1,…,N is
Í
i ?1 j ?1
ETi Ei FTj Fj iT iT iT
right. If it is successful, the calculation is over.
Í m iD
Í Â a EDi © x Ei - Â a FDj © x Fj + d iD- / d iD
Otherwise, setting hi=hi/10, turn to Step2 and
? biD
n iD
Í
+
continue the calculation.
? ?
Í m iZ
 Â
i 1 j 1
Ë i ?1
- +
(24) Step6: Judge whether the imitative movement is
j ?1
Í m lT
Í Â a ETi © x Ei - Â a FTj © x Fj + d lT- / d lT+ ? blT
nlT
successful. If it is successful , this process is
Í i ?1
— —
completed. If not, set x=x′x is a new base
Í mlD
j ?1
 Â
Í a © x - lD a © x + d - / d + ? b
point″, turn to Step2 and continue the calculation.
Í i ?1
n
Otherwise, keep the value of x, turn to Step2and
Í
j ?1
EDi Ei FDj Fj lD lD lD
Í mlZ
Í Â a EZi © x Ei - Â a FZj © x Fj + d lZ / d lZ ? blZ
continue the calculation.
nlZ
Í i ?1
- +
j ?1
Detection motion and imitation motion in the
Í mlX
Í Â a EXi © x Ei - Â a FXj © x Fj + d lX- / d lX+ ? blX
nlX calculation of Hooke-Jeeves algorithm can refer to
Í i ?1
reference [19].
j ?1
Í m
Í Ä Â rEi · x Ei - Â rFj · x F j Õ Ä Â x Ei - Â x Fj Õ
Í Ã n Ô Ã m n Ô 5. Case study
Í Å i ?1 j ?1 Ö Å i ?1 j ?1 Ö
Í - d r/ / d r- ? ri We take the lockage case of a ship in a double
Í m
Í Â x Ei - Â x Fj - d s / d s ? S i
Í
lock of Jiangsu, PR China as an example to verify
/ -
n
that the model is scientific and feasible. The size of
Í i ?1 j ?1
Í Â x Ei - x Es - d p / d p ? Â x Fi - x Fs
Í m
the first shiplock E of the double lock is 23×90m,
/ -
n
the size of the second shiplock F is 18×70m. We
Ì i ?1 j ?1 take randomly one day's ship data. There’re totally
Journal"of"Applied"Research"and"Technology 197
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang"/"192ど200"
198" Vol."12,"April"2014"
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang."/"192ど200"
combination mode “3D2Z2X” of shiplock E, (3) A double line shiplock of Jiangsu province is
utilization rate of lock chamber is 55.64% and taken to verify the scientificity and feasibility of the
54.55% respectively. model. it should be pointed out that the data of the
double line shiplock is randomly selected. The
From Table 1 , we can see that after using joint results show that the analytical techniques are
nonlinear optimization model, two lockages of lock appropriate for the theory and research questions
E and F are reduced respectively, and the average and they are applied appropriately.
utilization rates of lock chamber of E and F are
raised to 54.46% and 53.99% which exceed the It is noted that Because of the limitation of
setting ideal utilization rate of lock chamber. The objective conditions, such as data accuracy,
optimization is useful to reduce operating costs of emergencies, a feasibility study is needed before
lock scheduling. Actually, if we take the shipping applying the model.
tonnage of each ship into consideration, the
optimization will have greater economic benefits. It Acknowledgements
indicates that the joint optimization model is
scientific and feasible. This research was supported by the Fundamental
Research Funds for the Central Universities (No.
2012B13914)
6. Conclusions
References
Shiplock scheduling directly affects the shipping
capacitity of the waterway. When the size of [1] X. Q. Niu et al., “The way to give full play to
shiplock is of certain, the optimization of shiplock navigation capability of three gorges project ship-lock,”
scheduling is of particularly importance to improve Yangtze River, vol. 44, no. 5, pp. 6-10, 2013.
channel efficiency and economic efficiency. The
previous researches were more about single-line [2] S. H. Kim, et al, “An optimization-based decision
shiplock. But with the development of social support system for ship scheduling,” Computers &
economy, double line shiplock is more and more Industrial Engineering, vol. 23, no. 12, pp. 689-692, 2009.
popular and its scheduling is more complicated.
[3] X. P. Wang et al., “An analysis on convergence of
data-driven approach to ship lock scheduling,”
(1) In our paper, the ships are divided into four Mathematics and Computers in Simulation, vol. 88, no.
types according to the width: extremely large- 7, pp. 31-39, 2013.
sized, large-sized, medium-sized and small-sized,
and service rules includes four modes: the first [4] N. Siswanto et al., “Solving the ship inventory routing
service for the first arrival way, the single service and scheduling problem with undedicated
way, the priority service way and the time limit compartments,” Computer & Industrial Engineering, vol.
service way. It is the same as the practical 61, no. 2, pp. 289-299, 2011.
operation scheduling of shiplock, which lays a
[5] H. Andersson et al., “Ship routing and scheduling with
good theoretical premise for the application of the cargo coupling and synchronization constraints,”
scheduling model of double line shiplock. Computer & Industrial Engineering, vol. 61, no. 4, pp.
1107-1116, 2011.
(2) The paper uses the actual arrangement
number of the ships to construct the hard [6] T. Guo, “Dynamic model on traffic capacity of three
constraints, and uses the average utilization rate of gorges ship lock,” Port & Waterway Engineering, vol. 24,
the two lock chamber et al to construct the soft no. 6, pp.130-135, 2012.
constraints, then establishes the optimization
[7] C. X. Xu et al., “Study on the dispatching model of
model of the joint scheduling of double line
open secondary symmetric ship lock,” Modern
shiplock, which is a nonlinear programming model. transportation technology, vol. 8, no. 1, pp. 68-72, 2011.
According to the feature of the model, we [8] N. Li et al, “Scheduling algorithm for Xiang river lock
demonstrate the Hooke-Jeeves algorithm to solve chamber,” Port & Waterway Engineering, vol. 7, no. 3,
the model. pp. 171-175, 2013.
Journal"of"Applied"Research"and"Technology 199
Optimization"Scheduling"Model"of"Double"Line"Shiplock"Based"on"Nonlinear"Goal"Programming, Q."H."Pang"/"192ど200"
"
"
"
200" Vol."12,"April"2014"