CN101786576A - Critical path method for starting number of portal cranes in container yard - Google Patents

Critical path method for starting number of portal cranes in container yard Download PDF

Info

Publication number
CN101786576A
CN101786576A CN200910054590A CN200910054590A CN101786576A CN 101786576 A CN101786576 A CN 101786576A CN 200910054590 A CN200910054590 A CN 200910054590A CN 200910054590 A CN200910054590 A CN 200910054590A CN 101786576 A CN101786576 A CN 101786576A
Authority
CN
China
Prior art keywords
task
time
gauntry crane
crane
sequence
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.)
Pending
Application number
CN200910054590A
Other languages
Chinese (zh)
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 CN200910054590A priority Critical patent/CN101786576A/en
Publication of CN101786576A publication Critical patent/CN101786576A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Ship Loading And Unloading (AREA)

Abstract

The invention discloses a critical path method for the starting number of portal cranes in a container yard, and relates to the technical field of quay management and yard management. The method of the invention comprises the following steps: decomposing ship handling tasks to parallel task operating lines, to a Bay bit sequence and then to a Bay bit container handling task sequence by utilizing a berthing plan and a cargo plan; according to the starting time of the bridge crane of a cabin handling task, calculating the starting time of lorries and the starting time of the portal cranes; after time discretization, inversely calculating the number of the parallel yard container handling tasks of any event; and after summing up to a Bay bit and continuous Bay bit cluster, deducing the number of the portal cranes in parallel operation at random time; and further calculating the starting number of the portal cranes by statistical criteria. The method does not relates to complicated models and algorithms, can adapt to predict the starting number of the portal cranes on a large quay, and is favorable for realizing the object of energy saving and full use of the bridge cranes and the portal cranes.

Description

A kind of container pier storage yard gauntry crane starts the program evoluation and review technique of quantity
Technical field
The present invention relates to the technical field that the technical field of container pier storage yard management, particularly container pier storage yard gauntry crane start the quantity configuration.
Background technology
Container wharf generally can according to boats and ships formulate to estimated time of arrival and operational data that the cycle dwindles gradually and ship berthing plan accurately, for example shift to an earlier date the berthing schedule of 4 days, 2 days and 1 day respectively.General 24 hours berthing schedule is very accurate, can arrange the operation resource of being correlated with in view of the above, comprises bridge crane, truck, gauntry crane, and relevant operating personnel.The angle of slave unit configuration, the cost great disparity of bridge crane, truck and gauntry crane, three's cost successively decreases rapidly successively.Therefore, emphasizing the making full use of of bridge crane improved the operating efficiency of bridge crane in the terminal operation process, be gauntry crane then, and the general hypothesis of truck always can meet the demands.The startup quantity of gauntry crane and operation be distributed with much relations.Generally, harbour be can do by myself and disposed the gauntry crane of some, and gauntry crane quantity is difficult to allocate rapidly by modes such as leases.And gauntry crane starts that the back is idle will cause the waste of resources such as electric power, therefore, how to determine a needed gauntry crane quantity in the berthing schedule round the clock, be one about energy-saving and cost-reducing major issue.
At present, the gauntry crane quantity configuration at all-hour work plan does not have particular study and disclosed patent achievement.The harbour staff planners are rule of thumb to determine the distribution of gauntry crane to bridge crane or shipping work when actual prestowage, and indeterminate definite its total number.
Disclosed achievement in research mainly is at the assignment of gauntry crane and the research of routing issue: 1) document { W.Li, Y.WU, M.E.H.Petering, M.Goh, R.d.SoUza, Discrete time model and algorithms for container yard craneschedUling.EUropean JoUrnal of Operational Research, 2009.198 (1): 165-172.}, document { W.C.Ng, K.L.Mak, Yard craneschedUling in port container terminals.Applied MathematicalModelling, 2005.29 (3): 263-276.} and document { Wei Zhong, Shen Jinsheng, Xiao Rongna, Zhang Zhiwen, Shi Dinghuan, harbour container harbour rubber tyred gantry crane optimization scheduling research. Chinese engineering science, 2007.9 (8): 47-51.}, study various gauntrys crane, research is the prioritization scheme of target to improve the gauntry crane transaction capabilities; 2) document { Han Xiaolong, gauntry crane quantity configuration in the container hargour loading and unloading. system engineering, 2005.23 (10): 12-16.} and document { Han Xiaolong, Ding Yizhong, the research of container hargour gauntry crane configuration optimization. Chinese navigation, 2008.31 (1): 6-9.}, disclose under the situation that the container handling task sequence is determined, determine to assign the method for gauntry crane for this task sequence by the mode of network flow.More than disclosed achievement, determine on the whole corresponding to all-hour work plan or sometime the gauntry crane in cycle start quantity.Though part achievement disclosed method can be used to calculate this quantity in theory by transforming, complexity of calculation is difficult to promote because of the increase exponential increase of container handling task quantity in actual applications.
On the other hand, in container hargour, a general-duty rule when marching into the arena, EXPORT CARTON is arranged, the EXPORT CARTON that is about to same ship is placed in the some continuous Bay position section of wharf apron as far as possible, or several such Bay position sections, more near this zone, can reduce the operating cost at harbour more when boats and ships are stopped, improve the operating efficiency of boats and ships.
Summary of the invention
The purpose of this invention is to provide a kind ofly, calculate the method that gauntry crane starts quantity fast according to berthing schedule and allocate plan.
One, assumed condition
In view of the complexity of outlet shipment, the gauntry crane quantity of the present invention during with shipment is configured to target, and method of the present invention can adapt to import by simple conversion and unloads a ship, or improves the above situation that both mix.
According to the berthing schedule of box ship, can determine alongside time of boats and ships and expectation from expected time of berthing.Then, allocate plan has been set up the mapping relations of freight container between boats and ships Bay position and Bay position, stockyard.Allocate plan is arranged the configuration of resources such as bridge crane, truck, gauntry crane.Generally, because the bridge crane costliness supposes that bridge crane is fully utilized; Be that the hypothesis gauntry crane is fully utilized then; Truck is then thought sufficient.For every boats and ships, according to the quantity that is the operating line of its distribution, can be divided into continuous section, each big section corresponding a lines, a bridge crane in other words to the Bay of whole ship.Operating line work capacity and time are supposed the balance of having tried one's best according to the operating efficiency of bridge crane in berthing schedule.Obviously, these operating lines walk abreast.Operating line is the job sequence of Bay position, and general is work unit for fear of the time that moving around of bridge crane causes with the Bay position, i.e. Bay position operation finishes and just moves to next Bay position.In same Bay position, suppose that allocate plan portion requires case; And,, also fall case in the storage yard operation process.
Two, definition
Define boats and ships, time, stockyard, operating line, task, bridge crane shifting time and single casing working time below.
SHIP={1,2 ..., NS}: the boats and ships set, s ∈ SHIP represents (1) wherein
Ship
TIME={1,2 ..., NT}: the discrete time set, t ∈ TIME represents (2) wherein
Article one, ship may be able to not be an integer, and is discrete
That change is TINT at interval
BLOCK={1,2 ..., NB}: the stockyard set, b ∈ BLOCK represents a stockyard (3)
SLINE s=1,2 ..., NSL}: the operating line set (4) of boats and ships s ∈ SHIP
SLTASK S, l=1,2 ... }: the operating line l ∈ SLINE of boats and ships s ∈ SHIP s(5)
The operation set, k ∈ SLTASK s, l represents wherein
A job task, a job task is corresponding
The dress of a freight container/unload adopts
SLTBLOCK,TSBAY,TSROW,
TSLAYER,TYBAY,TYROW,
TYLAYER is defined as the task of obtaining respectively
Stockyard, boats and ships, operating line, ship and stockyard
The Bay position and the row of Bay position, place with
Layer.And these attributes all adopt above name
(form is in the set of the direct definition of title value
.={1,2,...,|·|})。
QCMT S, l: bridge crane (l ∈ TSLINE (s)) is in adjacent Bay (6)
The time that displacement is moving
QCTT S, l: the work (7) of the every freight container of bridge crane (l ∈ TSLINE (s))
The industry time
In the superincumbent definition, be a plurality of operating lines, every operating line is obtained Bay position job sequence, every Bay position is obtained collecting the wiring job sequence the rough segmentation of ship loading and unloading task.And then definition bridge crane mobile sequence, thereby row constraint is lifted up in the truck and the field that cooperate for making full use of bridge crane.
In the above on Ding Yi the basis, the predicate below the definition is represented time of relating to.
SLTStart (s, l, t): ship loading and unloading freight container task start incident (8)
SLTEnd (s, l, t): the ship loading and unloading freight container deadline, suppose not have (9)
Case is arranged down, obviously
SLTEnd(s,l,t)=SLTStart(s,l,t)+QCTT s,l
TRUCKTStart (s, l, t): truck freight container task start incident (10)
YCTStart (s, l, t): gauntry crane task start incident (11)
TRUCKT (s, l, y, yb): (12) of truck from the operating line l of boats and ships s to stockyard y
Shifting time between the yb of Bay position
TYC (y1, yb1, y2, yb2): container yard gantry is hung in different two Bay positions they (13)
Between shifting time
Be for calculating other definition that the configuration of gauntry crane quantity is introduced below.
Seq (s, l): (14) of the task of the operating line l of boats and ships s
Sequence, i.e. SLTASK S, lIn of element
Displacement
SLTStart (s, l, task): (15) of the task task of the operating line l of boats and ships s
The bridge crane job initiation time
TRUCKTStart (s, l, tast): (16) of the task task of the operating line l of boats and ships s
The truck job initiation time
YCTStart (s, l, task): (17) of the task task of the operating line l of boats and ships s
The gauntry crane job initiation time
YBAYTIME (blk, yb, tk, t): belong to 0,1}, (18) of element representation stockyard blk
Whether Bay position yb begins task tk when t
(t): the Bay position yb of element representation stockyard blk is in (19) for blk, yb for YBAYTIME
Number of tasks during t
QCYTQ (blk, t): the gauntry crane quantity (20) of stockyard blk when t
The needed gauntry crane sum of QCTQ (t): random time t (21)
Amount
QCQ: the estimated valve of gauntry crane quantity (22)
Top defined declaration method disclosed by the invention is calculated the run up time of bridge crane task, the run up time of truck task, the run up time of gauntry crane task successively according to task sequence, after time discretization, calculate task, Bay position, stockyard of each time etc. conversely.And task sequence is determined according to berthing schedule and allocate plan.
Two, computation process
Different operating lines walks abreast.An operating line is to be made of a job sequence, and the dress of a freight container/unload is finished in each operation.(s l) is the sequence of task of the operating line l of boats and ships s, i.e. SLTASK to definition Seq S, lA displacement of middle element.(s, l i) get i element in the sequence to definition Seq.For a sequence that makes full use of bridge crane, should meet the following conditions.
1) bridge crane is fundamental operation with Bay, promptly avoids moving around between the Bay, and this condition is suc as formula (23):
ia ≤ ib ⇒ TSBAY ( Seq ( s , l , ia ) ) ≤ TSBAY ( Seq ( s , l , ib ) ) - - - ( 23 )
2) mould turnover not between the operation in the same Bay promptly satisfies lower floor's (number little) in proper order with the shipment of Bay colleague freight container and adorns earlier, this condition as the formula (24):
(TSBAY(Seq(s,l,ia))=TSBAY(Seq(s,l,ib)))
∧(TSROW(Seq(s,l,ia))=TSROW(Seq(s,l,ib)))(24)
∧(ia≥ib)
⇒ TSLAYER ( Seq ( s , l , ia ) ) ≥ TSLAYER ( Seq ( s , l , ib ) )
For any task task of sequence, and task=Seq (s, l, ia), the run up time in the time of can determining that bridge crane makes full use of according to formula (25):
SLTStart(s,l,task)=post(s)+(task-1)·(QCTT s,l+QCMT s,l)(25)
For outlet shipment, then according to SLTStart (s, l, task) with the respective episode vanning in the position in stockyard (y=BLOCK (task), yb=YBAY (s, l, task)) can access the run up time of truck in the stockyard according to formula (26) for s, l:
TRUCKTStart(s,l,tast)≤SLTStart(s,l,task)-TR?UCKT(s,l,y,yb)(26)
Suppose that the truck resource is abundant, and the production time that container yard gantry hangs determines also, be made as YCT.Expect that then gauntry crane starts working time of job task, can calculate by formula (27):
YCTStart(s,l,task)
≤TRUCKTStart(s,l,task)(27)
≤SLTStart(s,l,task)-TRUCKT(s,l,y,yb)-YCT
((s, l task), and binding time discretization interval T INT, make YCTStart task) for s, l according to all
Figure G2009100545905D0000073
Can obtain each time t ∈ TIME, the Bay position of gauntry crane task is arranged.This relation adopts four-dimensional integer 0/1 matrix YBAYTIME to represent, the Bay position ybay of element representation stockyard blk is in the task of t, be defined as YBAYTIME (blk, ybay, task, t) ∈ 0,1}.
Thereby, by simple statistics YBAYTIME (blk, ybay, task, t), merge task can obtain YBAYTIME (blk, ybay, t), suc as formula (28):
YBAYTIME ( blk , ybay , t ) = Σ task YBAYTIME ( blk , ybay , task , t ) - - - ( 28 )
For the Bay position of same blk, suppose to have at most two gauntrys crane to work simultaneously.Then, according to QCYTQ (blk t) calculates each stockyard blk in gauntry crane quantity, suc as formula (29):
QCYTQ ( blk , t ) = min { Σ ybay ( YBAYTIME ( blk , ybay , t ) ) , 2 } - - - ( 29 )
Thereby, can obtain the needed gauntry crane quantity of random time t QCTQ (t), suc as formula (30).
QCTQ(t)=∑ blk(QCYTQ(blk,t))(30)
By to statistical treatment, can obtain the estimated valve QCQ of gauntry crane quantity, for example formula (31) and (32).
QCQ=max{QCTQ(t)} (31)
QCQ = max t = 1 → ( NT - w + 1 ) { mean a = t → ( t + w ) { QCTQ ( a ) } } - - - ( 32 )
Formula (31) maximizing; Formula (32) is then carried out smoothing processing earlier, and wherein w is a smooth window.
According to QCTQ (t), the distribution that can calculate time dependent gauntry crane quantity for the startup of refined control gauntry crane more, utilize and close, provides foundation.
Above model by task being decomposed and is mapped to gradually in the operation of gauntry crane, calculate the gauntry crane job task of every time parallel conversely by the time of gauntry crane job task, calculate that by statistical criteria last gauntry crane starts quantity.This process does not relate to complex mathematical plan model and algorithm, and the gauntry crane that can calculate ultra-large harbour fast starts the quantity allocation problem.
In sum, method disclosed by the invention is according to berthing schedule and allocate plan, and the gauntry crane that calculates whole harbour starts the quantity overall arrangement; Support the parallel task operation of the many operating lines of many boats and ships; Be the fast approximate program evoluation and review technique that a kind of container pier storage yard gauntry crane starts quantity, have practicality.
The configuration that gauntry crane starts quantity is the major issue that has influence on terminal operation energy saving of system consumption reduction, has very big risk by the experience simple computation.By program evoluation and review technique disclosed by the invention, taking into full account under the situation that obtains production plan, calculate the startup quantity of gauntry crane conversely, promptly accurate again fast.Method disclosed by the invention is achieved on existing container wharf operating system, and the elemental operation data that make full use of existing software system can estimate fast that gauntry crane starts quantity.
Description of drawings
Further specify the present invention below in conjunction with accompanying drawing.
Fig. 1 implementation process scheme drawing of the present invention
The specific embodiment
Describe below in conjunction with 1 pair of method disclosed by the invention of accompanying drawing.
The target of this method is the configuration of calculating gauntry crane, and the typical application scene is how to determine the startup quantity of gauntry crane when formulating 24 hours berthing schedules and allocate plan, to reduce the energy consumption of gauntry crane.The input of this method is the job task sequence of berthing schedule and allocate plan, particularly operating line.At first, the operating line of all boats and ships is handled the task sequence independent processing of each operating line as parallel machine, the hypothesis that makes full use of according to bridge crane, calculate the run up time of each task, calculate the run up time of truck again, and then calculate the run up time that gauntry crane is carried out this task in the stockyard.Then, with time discretization.Conversely, can determine the task of random time operation, thereby stockyard that sets the tasks and Bay position, and task is aggregated into the Bay position, continuity according to the Bay position merges, and suppose the operation simultaneously of maximum two gauntrys crane in any stockyard, obtain the gauntry crane quantity configuration at any time of each stockyard.Calculate approximate gauntry crane configuration quantity according to statistical criteria at last, and can obtain gauntry crane configuration distribution in time.At last, according to the information that produces in gauntry crane quantity and the computation process, adjustment berthing schedule and Calculation of stowage on board that can next oceangoing ship of rowing a boat.
Though above model discloses the present invention, for the person of ordinary skill of the art, under the condition that does not depart from the design of the present invention that proposes by claims and scope, can also carry out many improvement, particularly: the 1) adjustment of calculation process; 2) weakening of basic data and assumed condition or enhancing; 3) statistical method of approximate calculation.And these improvement and adjustment still guarantee to estimate quickly and easily the startup quantity of gauntry crane.

Claims (4)

1. a container pier storage yard gauntry crane starts the program evoluation and review technique of quantity, it is characterized in that: comprise following characteristics:
1) according to berthing schedule and allocate plan, the gauntry crane that calculates whole harbour starts the quantity overall arrangement;
2) the parallel task operation of the many operating lines of the many boats and ships of support;
3) be a kind of quick approximate calculation method.
2. method according to claim 1 is characterized in that: described characteristics 1), and from berthing schedule and the allocate plan sequence that sets the tasks; Calculate the task start time of bridge crane, the task start time of truck, the task start time of gauntry crane successively according to task sequence, after time discretization, calculate task, Bay position, stockyard of each time etc. conversely.
3. method according to claim 1 is characterized in that: described characteristics 2), decomposing the boats and ships task according to the consideration plan is operating line, and every operating line is obtained Bay position job sequence, and every Bay position is obtained collecting the wiring job sequence.
4. method according to claim 1, it is characterized in that: described characteristics 3), by task being decomposed and being mapped to gradually in the operation of gauntry crane, calculate the parallel gauntry crane job task of time per unit conversely by the time of gauntry crane job task, calculate that by statistical criteria last gauntry crane starts quantity.
CN200910054590A 2009-07-09 2009-07-09 Critical path method for starting number of portal cranes in container yard Pending CN101786576A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200910054590A CN101786576A (en) 2009-07-09 2009-07-09 Critical path method for starting number of portal cranes in container yard

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200910054590A CN101786576A (en) 2009-07-09 2009-07-09 Critical path method for starting number of portal cranes in container yard

Publications (1)

Publication Number Publication Date
CN101786576A true CN101786576A (en) 2010-07-28

Family

ID=42529984

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200910054590A Pending CN101786576A (en) 2009-07-09 2009-07-09 Critical path method for starting number of portal cranes in container yard

Country Status (1)

Country Link
CN (1) CN101786576A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104077638A (en) * 2013-03-27 2014-10-01 中国船舶工业综合技术经济研究院 Portal jib crane dispatching method
CN112286198B (en) * 2020-11-04 2023-07-21 安徽仓擎机器人有限公司 Port AGV fleet and manual card collection mixed scheduling system and method

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104077638A (en) * 2013-03-27 2014-10-01 中国船舶工业综合技术经济研究院 Portal jib crane dispatching method
CN104077638B (en) * 2013-03-27 2017-06-30 中国船舶工业综合技术经济研究院 A kind of dispatching method of portal jib crane
CN112286198B (en) * 2020-11-04 2023-07-21 安徽仓擎机器人有限公司 Port AGV fleet and manual card collection mixed scheduling system and method

Similar Documents

Publication Publication Date Title
Hu et al. A three-stage decomposition method for the joint vehicle dispatching and storage allocation problem in automated container terminals
Kang et al. Tugboat scheduling under ship arrival and tugging process time uncertainty
Ilati et al. A simulation-based optimization approach for integrated port resource allocation problem
CN101587571A (en) Container terminal yard optimization system
CN101986313A (en) Knowledge-based container quay berth and shore bridge dispatching method
JP5686072B2 (en) Warehouse work plan creation device
Ahmed et al. Synchronized scheduling model for container terminals using simulated double-cycling strategy
CN101782981A (en) Working face-oriented container terminal ship-loading and load-distribution non-linear programming method
Zhang et al. Optimization for two-stage double-cycle operations in container terminals
CN102799733B (en) Container tractor resource integration simulation system and method
CN107451720A (en) Towards the number indicating a ship's order of departure production plan evaluation method of automated container terminal
CN110942203A (en) Automatic container terminal AGV path optimization method
Yu et al. Choice of loading clusters in container terminals
CN103996106A (en) Allocation method for improving operating efficiency of shore tackle of container terminal
Wei et al. Quay crane scheduling with time windows constraints for automated container port
CN117035349A (en) Method and system for scheduling and deducting operation of dry bulk cargo wharf
CN101786576A (en) Critical path method for starting number of portal cranes in container yard
US20230252395A1 (en) A quay crane operation method
He et al. An allocation approach for external truck tasks appointment in automated container terminal
CN110503240A (en) A kind of maintenance of the vessel resource requirement prediction technique and device
Dong et al. QCs scheduling scheme of genetic algorithm (GA) and improved firefly algorithm (FA)
CN101599100A (en) Loading/unloading vessel production model in the container terminal operation system
KR101175396B1 (en) A System and a Method for Estimating Stevedoring Time of Container Ship
Prayogo et al. Bi-objective optimization model for integrated planning in container terminal operations
CN113743739A (en) AGV scheduling method based on mixed integer programming and combined optimization 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
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20100728