CN1702655A - Optimized method for reducing container rotation amount during loading on board - Google Patents

Abstract

The present invention discloses an optimum processes for deceasing case overturning of container when loading ship, the steps of shipment order decided by the number of voyages and port as follows: a. fixing on the fuzzy mark state; b. searching the certain mark state; c. making the specific case overturning steps. Operating the step a and step b firstly when considering the container weight further on the said basic, then making the certain mark state as a new original state, and assortatively account the number of container in the new original state, and classifying the same number of voyages, the same port, the same weight of container as the same sort, and then repeating step b and step c.

Description

A kind of optimization method of reducing container rotation amount during loading on board

Technical field

The present invention relates to the automated production method of operating in container terminal, stockyard, more particularly relate to a kind of method that the computer arrangement production operation reduces container rotation amount when loading onto ship of passing through.

Background technology

The efficient of container terminal is to weigh the most important index of a harbour production capacity, can high efficiency loading and unloading ship for reducing cost of transportation, observing sailing date has great impact. Because the order when EXPORT CARTON enters the stockyard by the road junction is randomness, customs's again flow processs of examination that approach first that adopt more, and the truck drivers of employing or tyre crane driver personal experience when stacking EXPORT CARTON more, can't consider the factors such as EXPORT CARTON shipping sequence comprehensively, after EXPORT CARTON entered the case district, the stacking state was comparatively unordered. When loading onto ship, need the shipment of mould turnover limit, limit, not only the mould turnover number of times is more, and reduces shipment efficient. Make the tyre crane driver that the purpose mould turnover be arranged at one's leisure so set the optimization method of container rotation, can be with unordered container stacking state arrangement for orderly, thereby improve EXPORT CARTON shipment efficient, reduce the used time of shipment, and improve to a certain extent the shipment accuracy rate.

Summary of the invention

For the deficiency that exists in the existing container shipment method of operating, technical problem to be solved by this invention provides a kind of optimization method of reducing container rotation amount during loading on board, container carries out autotelic mould turnover arrangement to arranging of container between entering behind the corresponding stockyard at one's leisure, thereby unordered container stacking state arrangement in order, is improved EXPORT CARTON shipment efficient.

The technical solution used in the present invention: can only carry out a position mould turnover operation according to tyre crane, the actual conditions that can not suitcase move forward and backward, the present invention considers the Optimization Steps that carries out minimum rotation amount design on 2 dimensional planes that 7 stacks consist of side by side on the position in the physics case district. A kind of optimization method of reducing container rotation amount during loading on board, the step when determining shipping sequence by flight number and harbour is as follows:

(a) determine the fuzzy object state: first the container number in the stack is carried out sub-category statistics, be same classification with flight number with the container at harbour, then calculate the columns that container of all categories need to take, the classification that need to mix is then mixed, and then according to initial stack state most containers is not moved the container of identical category is assigned to identical row;

(b) dbjective state is determined in search: the algorithm that adopts the breadth first search, data structure is a formation, original state is first element of formation, begin to be handled as follows from first element that is untreated of formation, take out first element that is untreated as current stack state, current stack state is moved case once produce a new stack state, then judge whether this stack state meets the fuzzy object state, if meet then this stack state be designated as definite dbjective state, otherwise be inserted into formation, and then current stack state is moved case once produce new state, then judge whether to meet the fuzzy object state, repeat this operation until current stack state can not produce till the new stack state again, then take out again the most previous stack state in the formation and carry out aforesaid operations as current stack state until search out and determine till dbjective state or the queue full;

(c) determine concrete mould turnover step: determine dbjective state with algorithm in the step (b), and record searching is sequentially recalled in search procedure, is a concrete mould turnover step to the output of process of search after searching definite dbjective state.

A kind of optimization method of reducing container rotation amount during loading on board, step when the basis of considering flight number and harbour further considers that Container Weight determines shipping sequence is as follows: carry out first above-mentioned steps (a), (b) the state that really set the goal as a new original state, container number in the new original state is carried out statistic of classification, same flight number, same harbour, be same classification with the container of weight, then calculate the columns that container of all categories need to take, the classification that need to mix is then mixed, and then according to initial stack state most containers is not moved the container of identical category is assigned to identical row; Adopt breadth first search's algorithm, data structure is a formation, original state is first element of formation, begin to be handled as follows from first element that is untreated of formation, take out first element that is untreated as current stack state, current stack state is moved case once produce a new stack state, then judge whether this stack state meets the fuzzy object state, if meet then this stack state be designated as definite dbjective state, otherwise be inserted into formation, and then current stack state is moved case once produce new state, then judge whether to meet the fuzzy object state, repeat this operation until current stack state can not produce till the new stack state again, then take out again the most previous stack state in the formation and carry out aforesaid operations as current stack state until search out and determine till dbjective state or the queue full; Determine dbjective state with algorithm in the step (b), and record searching is sequentially recalled in search procedure, is a concrete mould turnover step to the output of process of search after searching definite dbjective state.

Beneficial effect of the present invention: utilize tyre crane driver of the present invention in the free time of waiting for truck the purpose mould turnover to be arranged, can be with unordered container stacking state arrangement for orderly, truck needn't can directly be loaded onto ship from the stockyard delivery container through waiting for, thereby improve EXPORT CARTON shipment efficient, reduce the used time of shipment, and improved to a great extent the shipment accuracy rate.

Description of drawings

Fig. 1 is that the container under the original disordered state is arranged schematic diagram;

Fig. 2 is that container is arranged schematic diagram in the actual production operation;

Fig. 3 is that container is arranged schematic diagram in the situation of operation behind the first mould turnover;

Fig. 4 is flow chart of the present invention.

The specific embodiment

By reference to the accompanying drawings the present invention is described in further detail: a kind of optimization method of reducing container rotation amount during loading on board, step when determining shipping sequence by flight number and harbour is as follows: (a) determine the fuzzy object state: first the container number in the stack is carried out sub-category statistics, be same classification with flight number with the container at harbour, then calculate the columns that container of all categories need to take, the classification that need to mix is then mixed, and then according to initial stack state most containers is not moved the container of identical category is assigned to identical row; (b) dbjective state is determined in search: the algorithm that adopts the breadth first search, data structure is a formation, original state is first element of formation, begin to be handled as follows from first element that is untreated of formation, take out first element that is untreated as current stack state, current stack state is moved case once produce a new stack state, then judge whether this stack state meets the fuzzy object state, if meet then this stack state be designated as definite dbjective state, otherwise be inserted into formation, and then current stack state is moved case once produce new state, then judge whether to meet the fuzzy object state, repeat this operation until current stack state can not produce till the new stack state again, then take out again the most previous stack state in the formation and carry out aforesaid operations as current stack state until search out and determine till dbjective state or the queue full; (c) determine concrete mould turnover step: determine dbjective state with algorithm in the step (b), and record searching is sequentially recalled in search procedure, is a concrete mould turnover step to the output of process of search after searching definite dbjective state. Step when the basis of considering flight number and harbour further considers that Container Weight determines shipping sequence is as follows: first execution in step (a), (b) the state that really set the goal as a new original state, container number in the new original state is carried out statistic of classification, same flight number, same harbour, be same classification with the container of weight, then calculate the columns that container of all categories need to take, the classification that need to mix is then mixed, and then according to initial stack state most containers is not moved the container of identical category is assigned to identical row; Order obtains a concrete mould turnover step according to step (b), (c).

Can only carry out a position mould turnover operation according to tyre crane, the actual conditions that can not suitcase move forward and backward, as shown in Figure 1, dark case is that middle control is specified and needed the chest that sends, grey is for wouldn't send out case. Scope involved in the present invention is that the calculating that 2 dimensional planes that consist of on 7 stacks side by side on the position in a physics case district carry out minimum rotation amount provides corresponding operating procedure. The model that provides for Fig. 1 is can hold five casees and one by six can hold maximum five casees (i.e. the position of falling the case), and 35 case positions of totally seven stacks consist of the two-dimensional space physical model. For the stack on each on the stockyard, all can only first outmost case be shifted out, just can shift out following case, i.e. their principle that satisfies that last in, first out. Describe this physical model with the storehouse stack in the computer technology, stack is that last in, first out equally, and only has pop and two kinds of operations of push. Because when practical operation; the tyre crane driver can at first kill the case of sending out that is exposed to the surface, stockyard usually; and then consider to carry out the mould turnover operation to being embedded in the case of sending out of not sending out under the case; so our computing of at first casing before operation mould turnover operative algorithm; namely on the current stockyard directly the case of entrucking process; pop is out from stack separately with them; in the model that the case of remainder consists of, carry out again afterwards the mould turnover operation; as shown in Figure 2, doing so more, closing to reality operates and can shortcut calculation. In the algorithm of limit mould turnover limit entrucking, after chest is translated into the surface, need not to continue to stay on the stockyard, namely need not to continue to stay in the storehouse, at this moment should be with their POP out, and adjust the two-dimensional array of describing the stockyard state. With not sending out case and move on to other stack in the stack time, we can be high-rise after according to first bottom to the remaining empty position in current stockyard, less than 5 layers time, pay the utmost attention to from the nearest position of the current case that will move, when having two positions all to be fit to, pay the utmost attention to the stack that climbs over chest, namely the right is near the stack of the position of falling the case; At the 5th layer of stack of only considering need not mould turnover,, preferential near No. 1 position, if abovely do not satisfy, just the principle such as the consideration position of falling the case to select suitable position for the chest of current movement. Be different from limit mould turnover limit operation, in the situation of carrying out operation behind the first mould turnover, send out case and do not left the stockyard, be that they have just changed other stack with continuing to stay in the stack, so algorithm is different with the former when calculating, at this moment we require this to send out case can not cause by the stack of PUSH later on and also want mould turnover having changed stack, obtain Fig. 3 through aforesaid operations.

The mathematical theory basis of invention is as follows:

One. the assumed condition of original state:

1. each stack has six row, and arbitrary row container number is no more than 5;

2. the container number of each stack is no more than 21;

3. container is divided 3～5 grades according to factors such as weight, shipment precedences, represents with 1～5. That is: the container of (1)-expression override level;

(2)-expression the second priority container;

(3)-expression the 3rd priority container;

(4)-expression the 4th priority container;

(5)-expression the 5th priority container;

The division of grade is given in advance as the case may be;

4. the container of supposing same stack is the goods at the same harbour of same ship; (do not satisfy such as 4, we are not defined as least unit to stack; And with classify as one " stack " at the same harbour of same ship);

5. suppose the not position of falling the case.

Certain original state A sees Table 1.

Certain original state A of table 1.

1	2	3
						1	2	3	1	4	3
1	1	2	1	3	4
						2	1	1	2	3	3

Row: 123456 complexity σ (A_i)：  0      2       3      0          1         2$\underset{i=1}{\overset{6}{\mathrm{\Σ}}}\mathrm{\σ}\left(A_i\right)=8$Totally 21 containers divide 1,2,3,4 grades. Each stack representation: (0111200221120332130011200043310034328)

Two. the definition of mathematical variable

1. the expression of stack:

Were it not for the position of falling the case, represent with 30 dimension groups:

(a₁a₂...a₃₀)＝(011120221103321001120043300343)

If the position of falling the case is arranged, represents with 31 dimension groups:

(a₁a₂...a₃₁), a wherein₃₁＝O or 1，2，3，4。

2. the definition of complexity and expression: σ (A_i)

$\mathrm{\σ}\left(A\right)=\underset{i=1}{\overset{6}{\mathrm{\Σ}}}\mathrm{\σ}\left(A_i\right)$(the not position of falling the case)

$\mathrm{\σ}\left(A\right)=\underset{i=1}{\overset{7}{\mathrm{\Σ}}}\mathrm{\σ}\left(A_i\right)$(position of falling the case is arranged)

σ(A_i): make A in i (1≤i≤6) row among the expression stack A_iBecome a complexity and be 0 and | A_i|≤4, need at least mobile container number.

If a₃₁≠ 0, σ (A then₇)＝1

If a₃₁=0, σ (A then₇)＝0

Three. the definition of dbjective state: complexity is 0, simultaneously the same as far as possible grade of same row

Four. the mathematics conclusion that obtains by studying the mould turnover rule, particularly:

1.6 step DFS search: remove complexity after 4 steps and increase by 2, remove after 4 steps fully motionless (Th3) of complexity, remove after 5 steps that complexity increases.

2. look for the minimum part state of complexity to search for 6 step DFS again as original state after per 6 steps.

3. reduce searching times infront 3 steps:

A) once in the middle of mobile the making certain row exceed 4, need not move.

With original isomorphism after b) mobile, need not move.

C) if from A_iRemove a chest and be placed on A_jRow, but σ (A_i) ≠ 0, and σ (A_j) ≠ 0, next step can not be from other row A so_kMove chest and be placed on A_i。

D) if | A_i|=4 and σ (A_i)=0, so A_iLocking.

Five. mathematical proof:

It is M (A) that Th1 defines minimum mould turnover number of times, then M (A) 〉=σ (A).

Th2 A turns over 6 times and obtains later on B, and satisfying among the B of σ (B)＜σ (A) necessarily has optimal path.

Inference: A turns over 5 times to A₅，σ(A₅)＞σ (A) can remove.

A turns over 4 times to A₄，σ(A₄)＞σ (A)+2 can remove.

Th3 A → A1 → A2 → A3 → A4 is if σ (A)=σ (A1)=σ (A2)=σ (A3)=σ (A4) then A4 can remove.

If the maximum grade of Th4 is k, be located at again the container of the most the lower layer of k of not having of all row, then necessarily certain row is emptied!

Six. the priority target in moving the case process:

1. it is preferential null to occur.

2. the most beneath grade large (being light) is preferential.

3.σ(A_i) ≠ 0 and min{ σ (A_i)|σ(A_iThe row of) ≠ 0} are preferential

4. the row of A1 and A6 are preferential

5. preferentially put case on chest little on the chest of ad eundem or than it (namely 2press 1, rather than 2press 3, if the row complexity at 3 places is 0, then 2press 3 can).

Above said content only is the basic explanation of the present invention under conceiving, and according to any equivalent transformation that technical scheme of the present invention is done, all should belong to protection scope of the present invention.

Claims (2)

1. the optimization method of a reducing container rotation amount during loading on board, the step when determining shipping sequence by flight number and harbour is as follows:

(a) determine the fuzzy object state: first the container number in the stack is carried out sub-category statistics, be same classification with flight number with the container at harbour, then calculate the columns that container of all categories need to take, the classification that need to mix is then mixed, and then according to initial stack state most containers is not moved the container of identical category is assigned to identical row;

(b) dbjective state is determined in search: the algorithm that adopts the breadth first search, data structure is a formation, original state is first element of formation, begin to be handled as follows from first element that is untreated of formation, take out first element that is untreated as current stack state, current stack state is moved case once produce a new stack state, then judge whether this stack state meets the fuzzy object state, if meet then this stack state be designated as definite dbjective state, otherwise be inserted into formation, and then current stack state is moved case once produce new state, then judge whether to meet the fuzzy object state, repeat this operation until current stack state can not produce till the new stack state again, then take out again the most previous stack state in the formation and carry out aforesaid operations as current stack state until search out and determine till dbjective state or the queue full;

(c) determine concrete mould turnover step: determine dbjective state with algorithm in the step (b), and record searching is sequentially recalled in search procedure, is a concrete mould turnover step to the output of process of search after searching definite dbjective state.

2. the optimization method of a kind of reducing container rotation amount during loading on board according to claim 1, step when the basis of considering flight number and harbour further considers that Container Weight determines shipping sequence is as follows: first execution in step (a), (b) the state that really set the goal as a new original state, container number in the new original state is carried out statistic of classification, same flight number, same harbour, be same classification with the container of weight, then calculate the columns that container of all categories need to take, the classification that need to mix is then mixed, and then according to initial stack state most containers is not moved the container of identical category is assigned to identical row; Order obtains a concrete mould turnover step according to step (b), (c).

Images