[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN101893854B - Multiple delivering sequence decision-making system for container terminal shipment - Google Patents

Multiple delivering sequence decision-making system for container terminal shipment Download PDF

Info

Publication number
CN101893854B
CN101893854B CN2010102499603A CN201010249960A CN101893854B CN 101893854 B CN101893854 B CN 101893854B CN 2010102499603 A CN2010102499603 A CN 2010102499603A CN 201010249960 A CN201010249960 A CN 201010249960A CN 101893854 B CN101893854 B CN 101893854B
Authority
CN
China
Prior art keywords
box
container
sequence
module
matrix
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN2010102499603A
Other languages
Chinese (zh)
Other versions
CN101893854A (en
Inventor
赵宁
宓为建
严伟
苌道方
何军良
陆后军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Maritime University
Original Assignee
Shanghai Maritime University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shanghai Maritime University filed Critical Shanghai Maritime University
Priority to CN2010102499603A priority Critical patent/CN101893854B/en
Publication of CN101893854A publication Critical patent/CN101893854A/en
Application granted granted Critical
Publication of CN101893854B publication Critical patent/CN101893854B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a multiple delivering sequence decision-making system for container terminal shipment. The decision-making system consists of a production database, a multiple information extraction module, an information processing module, a dynamic modeling module, a model solving module and a scheme feedback module, wherein the multiple information extraction module is communicated with the production database, and is communicated with the information processing module; the information processing module is communicated with the dynamic modeling module, while the dynamic modeling module is communicated with the model solving module; and the model solving module and the scheme feedback module are communicate with each other, and the scheme feedback module and the production database are communicated with each other. The system analyzes the decision of delivering sequence of shipping containers, realizes minimum number of container repacking in shipment, and possibly reduces frequency of crane replacement, thereby realizing optimization of the final decision.

Description

Container terminal shipping time-to-time internal delivery sequence decision-making system
The technical field is as follows:
the invention relates to a control system for container terminal shipment service, in particular to a container terminal shipment time internal distribution sequence decision system.
Background art:
the container terminal is a hub of sea-land combined transportation and is one of the link points of sea transportation and land transportation. In order to adapt to the trend of containerization of cargo transportation and the development of container transportation industry, the container terminal needs to improve the management level and the logistics operation level while investing and modifying hardware facilities, improve the container processing efficiency by reasonably allocating the existing resources of the terminal, and reduce the cost of single containers of the terminal, a shipping company and a cargo owner.
The efficiency of a container terminal can generally be measured by two types of operating efficiency. One is a work on a ship, which refers to a loading and unloading operation on a container; another is an accepting and sending operation of the container, which refers to accepting and stacking the container from the outside of the dock into the yard, and taking out and sending the container to the outside of the yard when the container is taken by the owner.
The whole container terminal shipping business process is as follows (as shown in fig. 1):
and (4) rechecking the outlet box: comparing the information of the container in the port collecting box with the information of the container in the export manifest, thereby rechecking the information of the container which has entered the field and ensuring the effectiveness and continuity of the subsequent operation; meanwhile, customs custom.
Carrying out loading on the outlet box: the cargo allocation is also called 'real allocation' at a wharf, and is equivalent to a plan, and the main task is to carry out one-to-one correspondence between containers which are subjected to information review and customs clearance on a site and designated container positions on a corresponding ship, namely to plan the position of each container to be loaded on the ship in the future.
Scheduling the operating line: after the loading is finished, a complete box volume distribution map can be obtained, and a ship controller can perform specific operation line scheduling (namely bridge crane scheduling) according to the distribution map.
Site mechanical scheduling: appointed operation areas are arranged for site machines such as a site bridge, a front crane and a forklift respectively, and mechanical coverage of corresponding site areas is guaranteed.
Sending a shipping instruction: in order to control the sequence and rhythm of the sending of the containers, the ship control personnel firstly need to arrange the order serial numbers of the containers in the current operation time, namely, to decide which containers are sent out first and how to arrange the order.
Calculating a box sending task and assigning a collection card: after receiving the command, the boxes with the box sending sequence numbers are sequentially selected by the server and generate box sending tasks, designated empty collecting cards are distributed to receive the boxes, and a collecting card driver can drive to a certain position of a designated box area to wait for the box sending of the field crane after receiving the tasks.
Confirming the ship on the shore: after the yard crane sends the box and confirms, the truck driver can receive the shipment task and drive to the designated bridge crane in the task, and after the bridge crane driver loads the box on the truck into the stowage position, the tally staff needs to submit the shipment state of the box to the server through the wireless handheld machine, so that the shipment operation of a single box is completed.
In summary, shipping operations are required for containers at the departure. The container is taken out from a storage yard by a yard crane and placed on a container truck, and is horizontally transported to a wharf coastal area by the container truck, and then is hoisted by a bridge on the shore to carry out ship loading operation. Therefore, the first step of the shipping operation is the in-site box-dispatching operation, and the ship control scheduler is required to specify which box is dispatched first and then, and the process is the double in-box sequence instruction dispatching operation. Therefore, the ship loading command is a group of sequence numbers compiled by a ship control dispatcher, and can control the sequence of sending the export boxes within a certain time from the site to the shore for loading, and the sending has the following meanings:
(1) controlling the rhythm of the shipping and box-sending operation;
(2) carrying out necessary adjustment on the unreasonable loading sequence to reduce the box turnover rate;
(3) controlling the box sending sequence to reduce the frequency of field crane moving as much as possible;
(4) and controlling the sequence of the multiple ship installations to ensure the ship installation operation to be carried out smoothly.
In summary, shipping instruction sending is an important process in the shipping operation process, the compilation work of the instruction sequence number is completed by a shipping control dispatcher, the influence factors to be considered are more, and the dispatcher easily ignores certain box sending principles under high-intensity operation to cause unnecessary box overturning or field hoisting and moving of the machine, and even influences the smooth operation of the shipping operation. Therefore, the intelligent and automatic ship loading command sending can effectively reduce the working strength of a ship controller and more effectively ensure the smoothness of the ship loading operation.
The invention content is as follows:
the invention provides a double-inner-box-sending sequence decision-making system for container wharf shipping, aiming at the defects of shipping instructions in the existing container wharf shipping business process.
In order to achieve the purpose, the invention adopts the following technical scheme:
a container terminal shipping time internal distribution sequence decision-making system comprises:
a production database for storing data required for operation of the production system;
the system comprises a one-time internal information extraction module, a data processing module and a data processing module, wherein the one-time internal information extraction module acquires original production data required by construction and solving of a related shipping-time internal distribution box sequential model from the production database;
the information processing module maps the related data acquired by the intra-doubling information extraction module according to the dimension set in the model to form a corresponding parameter matrix required by constructing a shipping intra-doubling and outbox sequence model;
the dynamic modeling module constructs corresponding constraint conditions and a target function by utilizing a parameter matrix formed by processing of the information processing module according to actual business requirements so as to form a corresponding ship-loading time internal distribution box sequential model;
the model solving module is used for solving a shipping time internal distribution box sequence model constructed by the dynamic modeling module to form a corresponding distribution box sequence instruction;
and the scheme feedback module writes the box sending sequence instruction formed by solving by the model solving module into the production database to finish the automatic sending of the box sending sequence instruction.
Original production data extracted by the double-inner-time information comprise stowage information, box information of double-inner-time boxes, site stacking information and box position information of double-inner-time ships.
The dynamic modeling module includes:
a ship-loading suspension preventing module for restraining the sequence of the boxes so as to prevent the ship from being suspended during the box-sending operation;
an in-yard turning control module for constraining the order of the boxes so as to avoid the boxes from turning over during the box sending operation;
a yard crane mover control module for constraining the order of the bundle sending boxes so as to control the line of the yard crane mover during the box sending operation;
the unique constraint module is used for constraining the order of the containers so that the container sending order number and the corresponding container in the multiple form a unique one-to-one corresponding relation;
a model induction module for balancing the weighting coefficients between the sub-goals.
The method and the system perform decision analysis on the delivery sequence of the shipping containers according to the information of the shipping containers, the positions in the container yard, the positions in the ship time and the like. The number of times of turning boxes in the shipping operation is minimized, and the frequency of field hoisting and moving machines is reduced as much as possible, so that the optimization of final decision is realized. The loading efficiency of the container terminal is improved to the maximum extent.
The invention can improve the efficiency of sending the shipping instruction and ensure the smooth operation of the whole shipping process. The method controls the ship loading and box dispatching rhythm, adjusts the unreasonable loading sequence, and reduces the box turnover rate and the machine moving frequency.
Description of the drawings:
the invention is further described below in conjunction with the appended drawings and the detailed description.
FIG. 1 is a flow chart of the shipping service at a container terminal;
FIG. 2 is a schematic diagram of the system of the present invention;
FIG. 3a is a schematic view of a sequence of ship positions;
FIG. 3b is a schematic view of a sequence of ship berths;
FIG. 4a is a schematic illustration of a box-out and-turn-over diagram;
FIG. 4b is a schematic illustration of the effect of the unpacking sequence on the in-yard flipping;
FIG. 4c is a schematic illustration of the effect of the binning sequence on in-dock rollover;
FIG. 5a is a schematic diagram of a field crane frequently shifting a shipping box;
FIG. 5b is a schematic view of a field delivery box moving machine;
the specific implementation mode is as follows:
in order to make the technical means, the creation characteristics, the achievement purposes and the effects of the invention easy to understand, the invention is further explained below by combining the specific drawings.
Referring to fig. 2, the container terminal shipment time-delivery sequence decision system provided by the invention is composed of a production database, a time-delivery information extraction module, an information processing module, a dynamic modeling module, a model solving module and a scheme feedback module.
The production database is used for storing and producing data required by the operation of the system.
The system comprises an internal information extraction module, a data extractor, a data storage module and a data processing module, wherein the internal information extraction module is used for acquiring original production data required by construction and solving of a related shipping internal distribution box sequence model from a production database, and comprises the following steps: stowage information, box information of the double inner boxes, site stacking information and box position information of the double inner ships. In order to obtain complete and accurate information, the extraction of specific data can be realized by means of a view tool if necessary.
The information processing module is used for performing matrixing processing on the extracted data, and mapping the required data according to the dimensionality defined in the model by means of concurrent combination aiming at each parameter matrix so as to obtain the corresponding parameter matrix required by the model.
For example, there are parameters Stoway in the modelcvRepresenting the stowage position of the container on the ship, two dimensions: c represents a box, v represents a ship box position, the parameter is a 01 matrix related to c and v, therefore, whether an element corresponding to a certain c and a certain v is 0 or 1 needs to be judged according to the extracted Stowage information, and a required parameter matrix Stoway is obtained after one-to-one mappingcv
The symbols such as dimensions and parameters required by a specific model are defined as follows:
(1) representation of dimensions
C, the container waiting for the delivery container in the field is represented by the C, the dimension is marked by the container number of the container, and C represents the set of all containers waiting for the delivery container in a certain time.
v, m, which represents the v (m) th container position, namely the container position number, namely the stowage position of the container on the ship, the first three digits represent the 'multiple number', the middle two digits represent the 'column number', and the last two digits represent the 'layer number'. For example, 10H0902 indicates that the container is to be loaded on the ship at 10 th 09 th column 02.
And y and t represent the y (t) th site position, namely the site box position number of the container, namely the specific position of the to-be-sent box in the storage yard, and the data is obtained from the database. The first two bits represent the bin area number, the middle two bits represent the bit number, the 5 th bit represents the row, and the last bit represents the layer. Such as "a 12134" indicates that the container is located at the position of the A1 box area 21 at row 3 and layer 4.
s, n, the s (n) th sequence number, namely the sequence of the box sending, represents the sequence of the box sending, and S (N) represents the set of all the sequence numbers.
And b, representing the zone number in the site, namely the zone number (multiplied by the site) of the container needing to be sent. For example, "A312" indicates 12 bits of A3 box.
(2) Notation of known parameters
Stowagecv01 matrix ofThe stowage position of the container on the ship is described, wherein 1 denotes stowage of the c-th container to the v-th container bay.
StorecyAnd 01 matrix for describing the yard stacking position of the containers, wherein 1 represents that the c-th container is stacked at the y-th yard position.
VP_topmvAnd 01 matrix for describing the up-down position relationship between the ship boxes, wherein 1 represents that the mth ship box is positioned above the vth ship box.
YP_toptyAnd 01 matrix for describing the upper and lower relationship between the field positions, wherein 1 represents that the t field box position is positioned above the y field box position.
SEQ_numsAnd the one-dimensional matrix represents a group of sequential numbers by integer numbers.
Yardbay_seqbAnd auxiliary parameters, namely the number of each zone bit in the site is uniquely marked, and the method is mainly used for distinguishing each zone bit.
Yardpos_bayybAnd the matrix 01 is used for describing whether the y site position is located in the b location, wherein 1 represents that the y site position is located in the b location.
If_nextnsAnd the 01 matrix and the auxiliary parameter are used for describing whether the nth sequence number is behind the s-th sequence number, wherein 1 represents that the nth sequence number is behind the s-th sequence number.
(3) Symbols representing variables
SendcsDecision variables of the model, 01 matrix, are used to calculate whether the c-th container is sent out in the s-th order.
RestowyAnd the 01 matrix represents whether the container corresponding to the y-th container position can be turned over during the container sending process.
If_move_positives01 matrix, auxiliary variable, wherein 1 represents that the s-th box sending task needs to be hoisted to move left。
If_move_negativesAnd 01, matrix and auxiliary variable, wherein 1 represents that the s-th box sending task needs to be hoisted to the right to move.
Move _ times, Object _ stop, Total _ Object are the objective function variables.
And the dynamic modeling module is used for constructing corresponding constraint conditions and objective functions by utilizing a parameter matrix formed by processing of the information processing module according to actual business requirements so as to form a corresponding shipping time internal distribution sequence model for decision of a distribution sequence. In order to form a correct and efficient box sending sequence, the dynamic modeling module also comprises a plurality of modules for constructing constraint conditions and objective functions, and the modules mainly comprise a ship loading suspension preventing module, an in-field box turning control module, an in-field crane moving control module, a uniqueness constraint module and a model summarizing module.
1) And the ship-loading-prevention suspension module is used for restraining the sequence of the beam boxes so as to prevent the ship from being suspended during the box-sending operation.
The shipping sequence of the containers needs to be considered when shipping the containers. The containers are stacked in layers on the ship, so that the containers on the upper layer cannot be loaded firstly and the containers on the lower layer cannot be loaded later when the ship is loaded, and the operation inevitably causes the containers on the upper layer to be suspended when the ship is loaded, so that the ship loading process cannot be smoothly carried out.
Referring to fig. 3 a-3 b, if the loading positions and the distribution sequence of the two boxes 1 and 2 are as shown in fig. 3a, the loading sequence of the upper ship box position is prior to the loading sequence of the lower ship box position, which causes the hanging of the box position of the box 1, and obviously this loading operation sequence is not preferable. In fig. 3b, the shipping sequence of the lower ship box positions is prior to that of the upper ship box positions, so that the lower ship box position of the box 2 is completely shipped when the box is shipped, and the problem of suspension cannot occur.
For this reason, the constraint equation for preventing the ship-in-air module is as follows:
<math> <mrow> <munder> <mi>&Sigma;</mi> <mi>cs</mi> </munder> <mrow> <mo>(</mo> <msub> <mi>Send</mi> <mi>cs</mi> </msub> <mo>*</mo> <msub> <mi>Storage</mi> <mi>cv</mi> </msub> <mo>*</mo> <mi>SEQ</mi> <mo>_</mo> <msub> <mi>num</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> </mrow> </math> (1)
<math> <mrow> <mo>&le;</mo> <munder> <mi>&Sigma;</mi> <mi>m</mi> </munder> <mrow> <mo>(</mo> <munder> <mi>&Sigma;</mi> <mi>cs</mi> </munder> <mrow> <mo>(</mo> <msub> <mi>Send</mi> <mi>cs</mi> </msub> <mo>*</mo> <msub> <mi>Storage</mi> <mi>cv</mi> </msub> <mo>*</mo> <mi>SEQ</mi> <mo>_</mo> <msub> <mi>num</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> <mo>*</mo> <mi>VP</mi> <mo>_</mo> <msub> <mi>top</mi> <mi>mv</mi> </msub> <mo>)</mo> </mrow> <mo>&ForAll;</mo> <mi>v</mi> </mrow> </math>
on the left side of the inequality, a two-dimensional matrix Send representing the sending sequence numbercsWith a two-dimensional matrix Stoway representing the future loading position of each container on the shipcvObtaining a three-dimensional matrix related to s, c and v after multiplication, obtaining the sum of the two dimensions of c and s after the multiplication of the three-dimensional matrix and the one-dimensional matrix representing the sequence number
Figure BSA00000224384800073
I.e. the future sequence number of each bin v.
On the right of the inequality, a matrix representing the future sequence number of each binAnd a matrix VP _ top representing the top-bottom order between the two tanksmvAnd after multiplication, summing the m dimensions to obtain the ship-to-be-transferred sequence number of the upper layer of the mth ship box position.
If the suspension phenomenon cannot occur during shipment, the ship box sending sequence number corresponding to the mth ship box position needs to be smaller than the ship box sending sequence number corresponding to the ship box position on the upper layer. Namely, the left formula is less than or equal to the right formula.
2) And the in-field turning control is used for restraining the sequence of the bundle sending boxes so as to avoid the turning of the boxes during the box sending operation.
In the process of the container sending operation, if the container with the former sending sequence is stacked below the container with the latter sending sequence in the field, the container is turned over if the operation is carried out according to the sending sequence. Therefore, on the premise of meeting all the constraints, boxes stacked on the same bit string should be sent out as early as possible, so that the occurrence of box overturning is avoided, and the efficiency of sending boxes in the yard is improved.
Referring to fig. 4a, 1, 2, 3 and 4 are shown in the corresponding shipping sequence for the containers to be shipped. The container with the container sending sequence 1 is positioned above the container with the container sending sequence 2. Therefore, the case will not be turned over during the operation. The container with the container sending sequence of 3 is positioned below the container with the container sending sequence of 4, and the field crane can firstly operate the container with the container sending sequence of 3 during operation, so that the container is turned over, the whole operation flow is influenced, and the container sending operation efficiency is reduced.
The total number of times of the box turnover in the box sending operation process can be expressed as follows:
<math> <mrow> <mi>Object</mi> <mo>_</mo> <mi>restow</mi> <mo>=</mo> <munder> <mi>&Sigma;</mi> <mi>y</mi> </munder> <msub> <mi>Restow</mi> <mi>y</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </math>
restow in the above formulayWhether the box needs to be turned when the box corresponding to the y-th site position is sent is shown, and whether the box needs to be turned is finally determined by a decision variable SendcsThe determined, i.e., multiple, in-line delivery sequence number determines the in-line delivery rollover rate.
Referring to fig. 4b, the three boxes are loaded, and if the sending sequence of A, B, C boxes on a certain time of the ship is 1, 2 and 3 respectively, the boxes are arranged in sequence from top to bottom when being sent in a field, and the phenomenon of turning over the boxes is avoided.
If A, B, C three boxes are loaded according to the figure 4c, if the original box distribution sequence is still adopted, the box B needs to be turned over when the boxes are distributed, in order to avoid the box B from turning over, the box distribution sequence of A, B, C three boxes can be adjusted to 1, 3 and 2, and the ship can be loaded according to the original loading plan without turning over the boxes after the adjustment.
In summary, RestowyAnd SendcsThere is a logical relationship between two variables that needs to be constrained, the constraint equation of which is as follows:
<math> <mrow> <msub> <mi>Restow</mi> <mi>y</mi> </msub> <mo>&GreaterEqual;</mo> <mrow> <mo>(</mo> <munder> <mi>&Sigma;</mi> <mi>t</mi> </munder> <mrow> <mo>(</mo> <munder> <mi>&Sigma;</mi> <mi>cs</mi> </munder> <mrow> <mo>(</mo> <msub> <mi>Send</mi> <mi>cs</mi> </msub> <mo>*</mo> <msub> <mi>Store</mi> <mi>ct</mi> </msub> <mo>*</mo> <mi>SEQ</mi> <mo>_</mo> <msub> <mi>num</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> <mo>*</mo> <mi>YP</mi> <mo>_</mo> <msub> <mi>top</mi> <mi>ty</mi> </msub> <mo>)</mo> </mrow> </mrow> </mrow> </math>
(3)
<math> <mrow> <mo>-</mo> <munder> <mi>&Sigma;</mi> <mi>cs</mi> </munder> <mrow> <mo>(</mo> <msub> <mi>Send</mi> <mi>cs</mi> </msub> <mo>*</mo> <msub> <mi>Store</mi> <mi>cy</mi> </msub> <mo>*</mo> <mi>SEQ</mi> <mo>_</mo> <msub> <mi>num</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> <mo>)</mo> <mo>&divide;</mo> <mn>1000</mn> <mo>&ForAll;</mo> <mi>v</mi> </mrow> </math>
in order to restrict the number of times of box turnover, a variable is needed to indicate whether the box is to be turned over when the container yard is carried, so a parameter reset which indicates whether the box is to be turned over is neededyThe constraint is a 0-1 matrix. An approximation constraint is used in this constraint to transform the constraint into a linear model.
To the right of the inequality, a two-dimensional matrix Send representing the sequence number of each containercsWith a two-dimensional matrix Store representing the respective position of each container on the yardctMultiplied by a one-dimensional matrix SEQ _ num representing the sequence numbersMultiplying to obtain a three-dimensional matrix related to c, s and t, and summing the three-dimensional matrix in two dimensions of c and s to obtain the conveying sequence corresponding to the corresponding stacking position on the yard. The one-dimensional matrix for t and a matrix YP _ top showing the vertical positional relationship of the stacking position in the yard are usedtyAfter multiplication, the dimension is aligned againThe degrees t are summed to obtain a one-dimensional matrix about y, which represents the order of handling of the upper stacking positions of a certain stacking position within the stack. Subtracting the carrying sequence number of the lower layer stacking position from the carrying sequence number of the upper layer stacking position in the stack yard, and if the numerical value is positive, indicating that the box needs to be turned over during carrying; if the value is negative or zero, it means that the box-turning operation is not necessary during transportation. In order to use 0-1 matrix to represent whether the box needs to be turned, namely 0 represents that the box does not need to be turned and 1 represents that the box needs to be turned, a forcing constraint mode is adopted, the subtracted value is divided by 1000 to obtain a number between 0 and 1 or a number between-1 and 0, and simultaneously the right Restow of the inequality is madeyGreater than or equal to the quotient from the left side of the inequality, due to RestowyIs a variable from 0 to 1, i.e. can only take values from 0 to 1, and has a RestowyTaking the minimum value, when the quotient obtained by the left formula is a decimal number between 0 and 1 (namely the box turning operation is required), RestowyThe value of (1); similarly, when the quotient obtained by the left formula is 0 or a decimal between-1 and 0 (namely, the box turning operation is not required), RestowyThe value of (d) takes 0.
3) And the yard crane moving machine control is used for restraining the sequence of the bundle sending boxes so as to control the line of the yard crane moving machine during the box sending operation.
Containers in the same time on the ship are often distributed in different field double positions, as shown in fig. 5a, after the distribution sequence is specified, the times of moving the corresponding field crane among all the positions can be calculated, so that the distribution sequence needs to be formulated in consideration of the moving route of the field crane in the distribution operation process, frequent moving of the field crane due to improper assignment is avoided as much as possible, and operation efficiency is reduced.
Referring to fig. 5a, since the containers to be delivered are located in different positions and the delivery sequence is not centralized, the corresponding yard crane needs to frequently move between the two positions when delivering the containers, which increases the times of moving the yard crane and delays the time of delivering the containers, resulting in low efficiency of the delivery process.
As shown in fig. 5b, compared with the field crane moving process shown in fig. 5a, the containers in this time of container distribution operation are located in different locations, but the container distribution sequence is concentrated, so that the container distribution process of the field crane is to completely distribute 14 containers and then move to 31 containers for distribution, which in comparison reduces the moving times of the field crane (only 1 time) and improves the efficiency of the container distribution operation.
The total number of times the yard crane needs to be shifted in the box distribution operation can be expressed as follows:
<math> <mrow> <mi>Move</mi> <mo>_</mo> <mi>times</mi> <mo>=</mo> <munder> <mi>&Sigma;</mi> <mi>s</mi> </munder> <mi>If</mi> <mo>_</mo> <mi>move</mi> <mo>_</mo> <msub> <mi>positive</mi> <mi>s</mi> </msub> <mo>+</mo> <munder> <mi>&Sigma;</mi> <mi>s</mi> </munder> <mi>If</mi> <mo>_</mo> <mi>move</mi> <mo>_</mo> <msub> <mi>negative</mi> <mi>s</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow> </math>
to minimize the total number of field transfers, the above objective is minimized.
The objective function is introduced with an auxiliary decision variable If _ move _ positivesAnd If _ move _ negativesTo respectively indicate whether the s-th box sending task needs to be lifted to the left or to the right. And whether the s-th box needs to be moved depends on whether the position of the place where the previous box is located is the same as the position of the place where the box s is located. Therefore, the model assigns values of 1, 2 and 3 to different positions of the storage yard respectively. In combination with the decision variable SendcsThe difference between the field multiple number corresponding to the s-th box and the field multiple number corresponding to the n-th box can be obtained, If a positive number is obtained, If _ move _ positivesThen 1 should be taken, If a negative number, If _ move _ negative, is obtaineds1 is taken, which indicates that the field crane needs to be moved; otherwise, if get0, the two front boxes and the two rear boxes are in the same field time, and the field crane does not need to move.
Therefore, the decision variable SendcsAnd If _ move _ positivesAnd If _ move _ negativesThere is a logical relationship between them, and constraints must be applied, and the constraint equation can be expressed as follows:
<math> <mrow> <mi>If</mi> <mo>_</mo> <mi>move</mi> <mo>_</mo> <msub> <mi>positive</mi> <mi>s</mi> </msub> <mo>&GreaterEqual;</mo> </mrow> </math>
<math> <mrow> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <msubsup> <munder> <mi>&Sigma;</mi> <mi>n</mi> </munder> <mrow> <mo>*</mo> <mi>If</mi> <mo>_</mo> <mi>nex</mi> <msub> <mi>t</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>s</mi> </mrow> </msub> </mrow> <mrow> <mo>(</mo> <munder> <mi>&Sigma;</mi> <mi>cyb</mi> </munder> <msub> <mi>Send</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>*</mo> <msub> <mi>Store</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mo>*</mo> <mi>Yardpos</mi> <mo>_</mo> <mi>ba</mi> <msub> <mi>y</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>*</mo> <mi>Yardbay</mi> <mo>_</mo> <mi>se</mi> <msub> <mi>q</mi> <mi>b</mi> </msub> <mo>)</mo> </mrow> </msubsup> </mtd> </mtr> <mtr> <mtd> <mo>-</mo> <munder> <mi>&Sigma;</mi> <mi>cyb</mi> </munder> <msub> <mi>Send</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>s</mi> </mrow> </msub> <mo>*</mo> <msub> <mi>Store</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mo>*</mo> <mi>Yardpos</mi> <mo>_</mo> <msub> <mi>bay</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>*</mo> <mi>Yardbay</mi> <mo>_</mo> <mi>se</mi> <msub> <mi>q</mi> <mi>b</mi> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>&divide;</mo> <mn>100</mn> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow> </math>
left If _ move _ positive of the equationsIs a 0/1 matrix; it shows thatWhether field crane movement occurs when the containers with the moving and box-moving sequence s are delivered. Right side of the formula
Figure BSA00000224384800103
Figure BSA00000224384800104
Send the box sequence Sendc,nAnd container yard number Storec,yAnd the Yardpos _ bay areay,bAnd an assignment of Yardbay _ seq to an intra-yard regionbThe multiplication and the summation of c, y, b is then a value of the yard area corresponding to the sequence number of the container. The region value of the out-of-box sequence number is compared with the subsequent container If _ nextn,sMultiplying to obtain a one-dimensional matrix which is the area value in the yard multiple where the container next to the container with the sending sequence s is located. And subtracting the area value in the container yard multiple of the container sending sequence s from the area value in the container yard multiple of the container sending sequence s to obtain a matrix related to the s. The positive or negative number indicates that the field crane moves, and the zero number indicates that the field crane does not move. Dividing this value by 100 yields a one-dimensional matrix smaller than 1. Let the one-dimensional 0/1 matrix If _ move _ positivesGreater than or equal to this matrix. And the minimum is taken in the target function, then the If _ move _ positives0/1 all numbers greater than 0 in the matrix take 1 and negative numbers and 0 are zero. Since the actual negative number should be 1, If _ move _ negative is applied to the modelsTo constrain the case where the value is negative. The constraints are as follows:
If _ move _ negative s
<math> <mrow> <mo>&GreaterEqual;</mo> <mfenced open='(' close=')'> <mtable> <mtr> <mtd> <munder> <mi>&Sigma;</mi> <mi>cyb</mi> </munder> <msub> <mi>Send</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>s</mi> </mrow> </msub> <mo>*</mo> <msub> <mi>Store</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mo>*</mo> <mi>Yardpos</mi> <mo>_</mo> <msub> <mi>bay</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>*</mo> <mi>Yardbay</mi> <mo>_</mo> <msub> <mi>seq</mi> <mi>b</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mo>-</mo> <munder> <mi>&Sigma;</mi> <mi>n</mi> </munder> <munder> <mi>&Sigma;</mi> <mi>cyb</mi> </munder> <msub> <mi>Send</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>*</mo> <msub> <mi>Store</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>y</mi> </mrow> </msub> <mo>*</mo> <mi>Yardpos</mi> <mo>_</mo> <msub> <mi>bay</mi> <mrow> <mi>y</mi> <mo>,</mo> <mi>b</mi> </mrow> </msub> <mo>*</mo> <mi>Yardbay</mi> <mo>_</mo> <msub> <mi>seq</mi> <mi>b</mi> </msub> <mo>*</mo> <mi>If</mi> <mo>_</mo> <msub> <mi>next</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>s</mi> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>&divide;</mo> <mn>100</mn> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow> </math>
left If _ move _ negative of equationsIs a 0/1 matrix; it shows whether the yard crane movement occurs when the containers with the moving and box-moving sequence s are delivered. Right side of the formula*Yardpos_bayy,b*_Yardbay_seqbSend the box sequence SendcnAnd container yard number StorecyAnd the Yardpos _ bay areaybAnd an assignment of Yardbay _ seq to an intra-yard regionbThe multiplication and the summation of c, y, b is then a value of the yard area corresponding to the sequence number of the container. The region value of the out-of-box sequence number is compared with the subsequent container If _ nextn,sMultiplying to sum n to obtain a lifting matrix which is the area value in the yard multiple of the container behind the container with the sending sequence s. In this constraint, the area value in the container yard multiple of the sending sequence s is subtracted from the area value in the container yard multiple of the next sending sequence s to obtain a set of data about s. This matrix forms exactly the inverse of the matrix compared in constraint (5). Make up for the case where the negative of the matrix to the right of constraint (5) is not taken into account. Dividing this matrix by 100 yields a one-dimensional matrix smaller than 1. Let the one-dimensional matrix If _ move _ negativesGreater than or equal to this matrix. And minimum is taken in the objective function, then the If _ move _ negatives0/1 all numbers greater than 0 in the matrix take 1 and negative numbers and 0 are zero. So If _ move _ negative in the modelsAnd If _ move_positivesAnd summing to obtain the actual field crane moving condition.
4) And the uniqueness constraint is used for constraining the order of the containers so that the container sending order number and the corresponding container in the multiple form a unique one-to-one correspondence relationship.
(1) The sending sequence numbers of the containers in the multiple times are different from each other, that is, each container should only correspond to one sequence number, so as to ensure the one-to-one correspondence between the containers and the sequence numbers, and the constraint equation is as follows:
<math> <mrow> <munder> <mi>&Sigma;</mi> <mi>s</mi> </munder> <msub> <mi>Send</mi> <mi>cs</mi> </msub> <mo>=</mo> <mn>1</mn> <msub> <mo>&ForAll;</mo> <mi>c</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow> </math>
to the left of the above equation, a two-dimensional matrix Send will be used for s and ccsSumming is performed for dimension s to obtain a one-dimensional matrix for c. If container c is given multiple sequential numbers, the resulting one-dimensional matrix value must be greater than 1; if container c is not given a sequence number, the resulting one-dimensional matrix value must be 0. Therefore, each container is guaranteed to be endowed with one sequence number, and the contradiction of endowing a plurality of sequence numbers is avoided.
(2) Similarly, when assigning sequence numbers to containers, it is necessary to avoid the contradiction that a sequence number is assigned multiple times, and the constraint equation is as follows:
<math> <mrow> <munder> <mi>&Sigma;</mi> <mi>c</mi> </munder> <msub> <mi>Send</mi> <mi>cs</mi> </msub> <mo>=</mo> <mn>1</mn> <msub> <mo>&ForAll;</mo> <mi>s</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow> </math>
to the left of the above equation, a two-dimensional matrix Send will be used for s and ccsSumming is performed for dimension c to obtain a one-dimensional matrix for s. If a sequence number s is given to a plurality of containers, the obtained one-dimensional matrix value is inevitably greater than 1; if the sequence number s is not assigned to any container, the resulting one-dimensional matrix value must be 0. By this constraint it is guaranteed that each sequence number can only be given once.
5) A model induction module for balancing weight coefficients between the sub-targets
The model is a problem of multi-objective planning, and the total objective function can be expressed as follows:
Total_objective=α*Object_restow+β*Move_times (9)
the overall objective function tends to be minimum, where α and β are weighting coefficients used to balance the two sub-objectives, and both goal 1 and goal 2 are minimum. In this model, α is 10 and β is 1.
The objective function is constrained to equations (1), (3), (5), (6), (7), (8).
And the model solving module is realized by calling a Cplex solver to carry out model solving.
And the scheme feedback module is also required to interact with the production database, and the solved shipping instruction sending scheme is fed back and written into the production database by using SQL sentences, so that the production system automatically sends the boxes according to the box sending sequence numbers in the corresponding double positions.
The operation process of the decision system formed according to the above technical solution is shown in fig. 2, 5 functional modules of the system are operated in coordination with each other, and a single operation of the system needs to go through four stages: namely event triggering, model processing, instruction forming and instruction automatic sending.
Firstly, the ship is controlled and scheduled to be a designated operation time to be put into the bridge crane, mechanical equipment such as a truck and a field crane in an operation line is arranged, and then the ship loading instruction automatic generation module is triggered. The in-time information extraction module extracts corresponding information after receiving the ship call number and the position number, and then the information processing module performs matrixing processing and then dynamic modeling. After the model and the known data are formed, the model solving module automatically arranges the ship loading instruction sequence, and after the arrangement scheme is formed, the arrangement scheme is sent to the feedback module to be written into a production database, namely the ship loading instruction is automatically sent.
The decision system formed by the technical scheme can carry out decision analysis on the container sending sequence of the shipping containers according to the information of the shipping containers, the positions in the container yard, the positions in the ship time and the like. The number of times of turning boxes in the shipping operation is minimized, and the frequency of field hoisting and moving machines is reduced as much as possible, so that the optimization of final decision is realized. The loading efficiency of the container terminal is improved to the maximum extent.
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.

Claims (1)

1. The container terminal shipment time internal distribution sequence decision-making system is characterized by comprising:
(1) a production database for storing data required for operation of the production system;
(2) the system comprises a one-time internal information extraction module, a data processing module and a data processing module, wherein the one-time internal information extraction module acquires original production data required by construction and solving of a related shipping-time internal distribution box sequential model from the production database; the original production data extracted by the double-inner-information extraction module comprises stowage information, double-inner-box information, site stacking information and double-inner-ship box position information;
(3) the information processing module maps the related data acquired by the intra-doubling information extraction module according to the dimension set in the shipping intra-doubling outbox sequence model to form a corresponding parameter matrix required by the building of the shipping intra-doubling outbox sequence model;
the expression sign of the dimension is:
c, representing the c container waiting for the delivery in the yard, wherein the dimension is marked by the container number of the container;
v, m, which represents the v (m) th tank position number;
y, t, which represents the y (t) th stacking position in the yard, namely the stacking position number of the container waiting for being delivered in the yard;
s, n, the s (n) th sequence number, namely the sequence of the box sending, and the sequence of the box sending;
b, indicating the position number of the container to be sent in the yard;
the expression symbol of the known parameter is:
Stowagecva 0-1 matrix describing the stowage position of the container on the ship, wherein 1 denotes stowage of the c-th container to the v-th ship position;
Storecya 0-1 matrix for describing the stacking position of the container in the yard, wherein 1 denotes the y-th stacking position where the c-th container is stacked in the yard;
VP_topmva matrix of 0-1, which is used for describing the upper and lower position relationship between the ship boxes, wherein 1 represents that the mth ship box is positioned above the vth ship box;
YP_toptya 0-1 matrix for describing the top-bottom positional relationship between the stacking positions within the stack, wherein 1 denotes that the tth stacking position within the stack is located above the yth stacking position within the stack;
SEQ_numsa one-dimensional matrix representing a set of sequential numbers by integer numbers;
Yardbay_seqba number, an auxiliary parameter, uniquely identifying the numerical number of each location in the heap, for distinguishing each location;
Yardpos_bayybA 0-1 matrix, auxiliary parameters, describing whether the y-th stacking position in the stack is located in the b-th location, wherein 1 indicates that the y-th stacking position in the stack is located in the b-th location;
If_nextns0-1 matrix, auxiliary parameters, where 1 indicates that the nth sequence number is after the s sequence number;
expression symbols of variables are:
Sendcs0-1 matrix, decision variables of the model, for calculating whether the c-th container is delivered in the s-th order;
Restowya matrix 0-1, which represents whether the container corresponding to the y-th stacking position in the stacking field needs to be turned when being delivered, wherein 1 represents that the container needs to be turned;
If_move_positives0-1 matrix and auxiliary variables, wherein 1 represents that field cranes are required to move left when containers with the container sending sequence s are sent;
If_move_negatives0-1 matrix and auxiliary variables, wherein 1 represents that field crane is needed to move to the right when containers with the container sending sequence s are sent;
total _ objective, Total objective function;
object _ restart, an objective function representing the total number of times of occurrence of rollover during the out-of-box operation;
move _ times, which represents an objective function of the total times of displacement of the field crane in the box sending operation process;
(4) the dynamic modeling module constructs corresponding constraint conditions and a target function by utilizing a parameter matrix formed by processing of the information processing module according to actual business requirements so as to form a corresponding ship-loading time internal distribution box sequential model;
the dynamic modeling module includes: the ship-loading-suspension preventing module is used for restricting the sequence of the boxes so as to prevent the ship from being suspended during the box sending operation;
the constraint equation of the ship-loading suspension prevention module is as follows:
Figure FSB00000825877000031
(formula 1)
Figure FSB00000825877000033
Representing the corresponding ship box sending sequence number of the v-th ship box position;
Figure FSB00000825877000034
represents the upper one of the mth ship's box space
Sending the box sequence number corresponding to the box position of the layer ship;
the dynamic modeling module further comprises: the stack yard turning control module is used for restricting the sequence of the bundle boxes so as to avoid unnecessary turning over during the box sending operation;
the objective function of the total number of times of the box turnover in the box sending operation process is as follows:
Figure FSB00000825877000035
(formula 2)
The constraint equation of the dump rollover control module is as follows:
Figure FSB00000825877000036
Figure FSB00000825877000037
(formula 3)
Figure FSB00000825877000039
The conveying sequence number corresponding to a certain stacking position in the stack yard is represented;
Figure FSB000008258770000310
upper level indicating a stacking position in a yard
Carrying sequence numbers corresponding to the stacking positions;
in (equation 3), when the number in the matrix on the right side of the inequality is a decimal between 0 and 1, the 0-1 matrix RestowyTaking 1 from the number of the corresponding position, and otherwise, taking 0;
the dynamic modeling module further comprises: the yard crane moving machine control module is used for constraining the order of the bundle boxes so as to control the line of the yard crane moving machine during the box sending operation;
the objective function of the total times of displacement of the field crane in the box sending operation process is as follows:
Figure FSB00000825877000041
(formula 4)
Regarding If _ move _ positivesThe constraint equation of (a) is:
Figure FSB00000825877000042
Figure FSB00000825877000043
Figure FSB00000825877000044
(formula 5)
Regarding If _ move _ negativesIs restricted byThe equation is:
Figure FSB00000825877000045
Figure FSB00000825877000046
(formula 6)
Wherein,
Figure FSB00000825877000048
the area value in the yard times of the containers with the delivery sequence s is represented;
Figure FSB00000825877000049
a yard area value representing a container subsequent to the container with the delivery sequence s;
in (equation 5) and (equation 6), when the number in the matrix to the right of the inequality number is a number greater than 0, the one-dimensional 0-1 matrix If _ move _ positivesAnd If _ move _ negativesTaking 1 from the number of the corresponding position, and otherwise, taking 0;
fourthly, the dynamic modeling module further comprises: the unique constraint module enables the container sending sequence number and the corresponding container in the multiple to form unique one-to-one correspondence;
to ensure that each container should be assigned only one shipping sequence number, the constraint equation is:
Figure FSB00000825877000051
(formula 7)
If containers c are given a plurality of sequence numbers s, thenWith respect to c one-dimensional matrix
Figure FSB00000825877000052
The value of (a) must be greater than 1;
if container c is not given sequence number s, then the one-dimensional matrix is associated with c
Figure FSB00000825877000053
The numerical value of (A) is necessarily 0;
to ensure that an out-of-box sequence number s is assigned to only one container c, the constraint equation is:
Figure FSB00000825877000054
(formula 8)
If an out-of-box sequence number s is assigned to a plurality of containers, the resulting c-one dimensional matrix
Figure FSB00000825877000055
The number must be greater than 1;
if an out-of-box sequence number s is not assigned to any container, the resulting one-dimensional matrix for c
Figure FSB00000825877000056
The numerical value of (A) is necessarily 0;
the dynamic modeling module further comprises: a model induction module for balancing the weighting coefficients between Object _ restow and Move _ times of the objective function;
the overall objective function is:
total _ Object _ reset + β _ Move _ times (formula 9)
Where α and β are weight coefficients for balancing the objective functions Object _ restow and Move _ times;
the total objective function is constrained by equations (equation 1), (equation 3), (equation 5), (equation 6), (equation 7), (equation 8);
(5) the model solving module is used for solving a shipping time internal distribution box sequence model constructed by the dynamic modeling module to form a corresponding distribution box sequence instruction;
(6) and the scheme feedback module writes the box sending sequence instruction formed by solving by the model solving module into the production database to finish the automatic sending of the box sending sequence instruction.
CN2010102499603A 2010-08-10 2010-08-10 Multiple delivering sequence decision-making system for container terminal shipment Expired - Fee Related CN101893854B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010102499603A CN101893854B (en) 2010-08-10 2010-08-10 Multiple delivering sequence decision-making system for container terminal shipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010102499603A CN101893854B (en) 2010-08-10 2010-08-10 Multiple delivering sequence decision-making system for container terminal shipment

Publications (2)

Publication Number Publication Date
CN101893854A CN101893854A (en) 2010-11-24
CN101893854B true CN101893854B (en) 2012-09-05

Family

ID=43103077

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010102499603A Expired - Fee Related CN101893854B (en) 2010-08-10 2010-08-10 Multiple delivering sequence decision-making system for container terminal shipment

Country Status (1)

Country Link
CN (1) CN101893854B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103150639B (en) * 2013-01-17 2017-02-08 招商局国际信息技术有限公司 Configuration method and configuration system of storage yard operation device
CN114048994A (en) * 2021-11-10 2022-02-15 上海海事大学 Method capable of evaluating delay conduction characteristics of multi-stage operation super-network of automatic wharf
CN114488801B (en) * 2022-01-18 2023-12-22 无锡安起科技有限公司 Bridge crane model prediction control method based on data driving

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7273172B2 (en) * 2004-07-14 2007-09-25 United Parcel Service Of America, Inc. Methods and systems for automating inventory and dispatch procedures at a staging area
CN100347713C (en) * 2004-07-09 2007-11-07 清华大学 Method for improving loading efficiency of container based on minimum freedom degree poriority principle
CN101381033A (en) * 2008-10-15 2009-03-11 江苏科技大学 Container loading method based on ant colony algorithm

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2007320727A (en) * 2006-06-02 2007-12-13 Toshiharu Saegusa Gantry crane for container, pallet for container transportation, container conveying vehicle and container transportation method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100347713C (en) * 2004-07-09 2007-11-07 清华大学 Method for improving loading efficiency of container based on minimum freedom degree poriority principle
US7273172B2 (en) * 2004-07-14 2007-09-25 United Parcel Service Of America, Inc. Methods and systems for automating inventory and dispatch procedures at a staging area
CN101381033A (en) * 2008-10-15 2009-03-11 江苏科技大学 Container loading method based on ant colony algorithm

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
JP特开2007-320727A 2007.12.13
严伟,宓为建,苌道方,何军良.《一种基于最佳优先搜索算法的集装箱堆场场桥调度策略》.《中国工程机械学报》.2008,第6卷(第1期),全文. *
朱明华等.《集装箱装船顺序问题的启发式算法研究》.《中国机械工程》.2010,第21卷(第9期),全文. *
赵宁,宓为建,邓钟.《集装箱码头卸船箱进场选位算法研究》.《中国工程机械学报》.2010,第8卷(第1期),全文. *
赵宁.《集装箱码头作业线调度决策支持系统》.《中国优秀硕士学位论文全文数据库工程科技2辑》.2007,全文. *

Also Published As

Publication number Publication date
CN101893854A (en) 2010-11-24

Similar Documents

Publication Publication Date Title
Jin et al. An aimms-based decision-making model for optimizing the intelligent stowage of export containers in a single bay
CN104555473B (en) The system and method that container logisticses are operated in integrated planning and control container terminal
Chen et al. The storage location assignment problem for outbound containers in a maritime terminal
CN111861205B (en) Automatic container wharf outlet box space distribution method
CN103544586B (en) A kind of stowage method improving container ship stability and bank bridge working performance
CN110599000B (en) Automatic dock turning evaluation method, box position distribution method and related devices
CN107451720B (en) Ship operation plan evaluation method for automatic container wharf
CN111144806B (en) Automatic loading method for dangerous goods container
Speer et al. Scheduling yard cranes considering crane interference
CN106773686A (en) With piler scheduling path model method for building up under the double car operational modes of rail
CN101893854B (en) Multiple delivering sequence decision-making system for container terminal shipment
Jacyna et al. Road vehicle sequencing problem in a railroad intermodal terminal–simulation research
JP5434267B2 (en) Transport control method, transport control device, and program
CN1877589A (en) Container ship on-line real-time pre-stowage planning method
CN114781761A (en) Real-time adjustment method for loading and unloading ship operation plan by adopting simulation rehearsal
CN112926873A (en) Container terminal ship stowage depth learning hybrid training system
CN109534023B (en) Automatic container wharf shore shipping instruction sequence control method
Zheng et al. An effective heuristic for the integrated scheduling problem of automated container handling system using twin 40'cranes
Legato et al. Managing container reshuffling in vessel loading by simulation
CN115860161A (en) Method and device for selecting position of incoming container and readable medium
Razouk et al. Optimization and simulation approach for empty containers handling
JP5659590B2 (en) Transportation planning method and system for steel products by ship
CN112561434A (en) Joint scheduling method and auxiliary scheduling system for traditional container terminal
Prayogo Carbon emission modelling in container terminal operations planning using a system dynamics approach
Fu et al. Berth and quay crane scheduling optimization based on improved genetic algorithm

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120905

Termination date: 20160810

CF01 Termination of patent right due to non-payment of annual fee