Crane scheduling with non-crossing constraint

Zhu, Yi; Lim, Andrew

doi:10.1057/palgrave.jors.2602110

Cited by 108 publications

(70 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Meanwhile, the relevant optimization model was developed and two solution procedures (exact and heuristic) were proposed. However, the quay gantry crane scheduling problem with bays is proven to be NP-complete when the noncrossing and safety distance constraints were included [12]. So currently, the tasks are often aggregated by container groups [13][14][15].…”

Section: Literature Reviewmentioning

confidence: 99%

Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

Zeng

Cheng

Guo

2017

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

The gantry crane scheduling and storage space allocation problem in the main containers yard of railway container terminal is studied. A mixed integer programming model which comprehensively considers the handling procedures, noncrossing constraints, the safety margin and traveling time of gantry cranes, and the storage modes in the main area is formulated. A metaheuristic named backtracking search algorithm (BSA) is then improved to solve this intractable problem. A series of computational experiments are carried out to evaluate the performance of the proposed algorithm under some randomly generated cases based on the practical operation conditions. The results show that the proposed algorithm can gain the near-optimal solutions within a reasonable computation time.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

Zeng

Cheng

Guo

2017

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

show abstract

“…Objective function (3) uses handling makespan as the key criteria of QCSP modeling, similar in [10,11] and [12] but also targets to eliminate postponed start of operations and to narrow the crane operational zone. That can be adjusted by weighted coefficients where, in normal circumstances, 1 ≫ 2 and 1 ≈ 3 .…”

Section: Full Task Algorithm For Qcsp Solutionmentioning

confidence: 99%

“…Expression −1 �ℎ − ℎ � is actually travel time between two tasks. Two constraints (10) and (11) determine values for binary variable y. Again, big integer M ensures that inequality is feasible for any value of y.…”

Section: Full Task Algorithm For Qcsp Solutionmentioning

confidence: 99%

See 1 more Smart Citation

A split task solution for quay crane scheduling problem in mid-size container terminals

2016

View full text Add to dashboard Cite

Original scientific paper A solution for quay crane scheduling problem with unchanged number of cranes during container vessel handling process is explored to minimize a vessel handling time and optimize quay crane utilization. Targets are small and mid-size terminals where high reliability of forecasted scenario is requested by the shipping companies while, at the same time, terminal resources are limited. Two models for the problem solution are proposed based on the full task and split task algorithms; in both cases grouping of tasks into clusters and operation zone limits are considered. Comparison of two models shows that split-task algorithm may improve crane utilization rate and vessel handling time in many cases. Proposed solutions combine existing research achievements with authors own approach in container terminal optimization development. Keywords: container ports; container terminal logistics; container terminal optimization; quay crane schedule; split task algorithm; tactical logistic problemsRješenje problema redoslijeda rada obalnih dizalica na kontejnerskim terminalima uz dijeljenje zadatka Izvorni znanstveni članak Istražuje se problem određivanja redoslijeda rada nepromijenjenog broja obalnih kontejnerskih dizalica za vrijeme prekrcajnih operacija na brodu s ciljem minimiziranja vremena prekrcaja i optimalnog iskorištenja radnog vremena dizalica. Objekt istraživanja su kontejnerski terminali manje i srednje veličine gdje su pouzdanost usluge i ostvarivanje predviđenog scenarija prekrcaja ključni zahtjevi brodara, a s druge strane prekrcajni resursi ograničeni. Predložena su dva modela rješavanja problema temeljeni na dva algoritma, bez dijeljenja zadatka i uz dijeljenje zadatka. U oba slučaja uzeti su u obzir grupiranje zadataka u klastere i ograničenja operativnih zona. Usporedba dva modela pokazuje da se primjenom algoritma s dijeljenim zadacima u mnogim slučajevima poboljšava iskorištenje obalnih dizalica i krajnje vrijeme dovršetka prekrcajnih operacija. Predloženim rješenjima autori kombiniraju postojeća istraživanja i vlastite spoznaje do kojih su došli razvojem modela optimizacije obalnih prekrcajnih operacija na kontejnerskom terminalu.Ključne riječi: algoritam s dijeljenjem zadatka; kontejnerske luke; logistika kontejnerkih terminala; optimizacija kontejnersog terminala; redoslijed obalnih dizalica;taktički logistički problemi

show abstract

“…The optimal zonal partition is found by dynamic programming. Zhu and Lim (2006) consider the same setting, but formulate a mixed integer programming model and propose a branch-and-bound algorithm for its solution (which outperforms CPLEX on small instances). A simulated annealing algorithm is developed to handle larger instances.…”

Section: Literature Reviewmentioning

confidence: 99%