Crane scheduling with spatial constraints

Lim, Andrew; Rodrigues, Brian; Xiao, Fei; Zhu, Yi

doi:10.1002/nav.10123

Cited by 115 publications

(55 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The gantry cranes are assumed to travel freely and without any interference constraints in the original researches [19,20]; however it does not conform to the actual operation situations of the gantry cranes in port terminals. As the research continues, the interference constraints of the gantry cranes have been widely concerned [21][22][23].…”

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

“…), for any job j, r = m means the last operation of the job, and variables: t ij -the start time of job j on machine i; x ijk = 1 if job j precedes job k on machine i, 0 otherwise (i.e., if job k precedes job j on machine i). More detailed studies and fundamental features of the applied framework on crane scheduling are published by Bierwirth and Meisel (2009);Chen et al (2007); Goodchild and Daganzo (2007); Kim and Park (2004); Lee et al (2008aLee et al ( , 2008b; Liang et al (2008); Lim et al (2002Lim et al ( , 2004Lim et al ( , 2007 where parameters are: N -the total number of roster type; M j -the set of roster types that will allow working on day j; R j -the number of employees required on each day j; C i -weekly cost per an employee assigned to roster type i, and variables: x i -the number of employees assigned to roster type i. For more detailed studies and fundamental features of the applied framework on scheduling refer to Li et al (1998);Pinedo (2008).…”

Section: About Some Pure Base Optimization Problemsmentioning

confidence: 99%

The Cross‐entropy Method for Combinatorial Optimization Problems of Seaport Logistics Terminal

Yildiz

Yercan

2010

Transport

View full text Add to dashboard Cite

Abstract. Studies on seaport operations emphasize the fact that the numbers of resources utilized at seaport terminals add a multitude of complexities to dynamic optimization problems. In such dynamic environments, there has been a need for solving each complex operational problem to increase service efficiency and to improve seaport competitiveness. This paper states the key problems of seaport logistics and proposes an innovative cross-entropy (CE) algorithm for solving the complex problems of combinatorial seaport logistics. Computational results exhibit that the CE algorithm is an efficient, convenient and applicable stochastic method for solving the optimization problems of seaport logistics operations.Keywords: cross entropy algorithm, seaport terminal, logistics, metaheuristic, optimization, stochastic method. IntroductionLogistics is a set of full activities that properly arrange all aspects of the manufacturing and distribution process to ensure the delivery of the right products to the right markets at the right time. Key logistics strategies for improved competitiveness range from the operational level of an effectively managing mutually connected group of processes to the strategic level of designing a flexible transfer and transportation system that allows for quick optimal routing, mode choice changes and decision-making processes. In terms of logistics activities and strategies with respect to the improved competitiveness, seaport logistics operations possess comparable characteristics. However, seaport logistics operations are constrained by close-fitting space layouts and some exceptional handling equipment with supplies of the sizeable numbers of containers and/or bulk cargo traffic with demands for superior logistics service. Therefore, achieving optimum and quick solutions to the problems of seaport logistics operations are crucial for the improved logistics service output.Seaport logistics operations are divided mainly into three sections and embrace seaside, yard and landside operations each of which engages multiple joined processes. Within these processes, in order to have efficient logistics service output, strategic and operational bodies exist and vigorously necessitate optimal resource management solutions based on the changing parameters of operating conditions.

show abstract

“…The QCSP has been studied by many researchers: Among others, there are Daganzo [5], Kim & Park [6], Liu et al [7], Lim et al [8], [9], Zhu&Lim [10], Lee et al [11], Meisel [12], Meisel & Bierwirth [13], Lajjam et al [14]. The great majority of these researches targeted big-size container terminal, particularly located in Far East ports.…”

Section: Introductionmentioning

confidence: 99%

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

Crane scheduling with spatial constraints

Cited by 115 publications

References 11 publications

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

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

The Cross‐entropy Method for Combinatorial Optimization Problems of Seaport Logistics Terminal

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

Contact Info

Product

Resources

About