A tabu search heuristic for the quay crane scheduling problem

Sammarra, Marcello; Cordeau, Jean‐François; Laporte, Gilbert; Monaco, Maria Flavia

doi:10.1007/s10951-007-0029-5

Cited by 156 publications

(96 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…CPLEX was used to solve small scale instances and the Branch-and-Cut (B&C) algorithm to solve large scale instances. (Sammarra et al, 2007) proposed a tabu search heuristic for QCSP in order to minimize the completion time for unloading and/or loading containers from/into vessels. They considered precedence and non-simultaneity between tasks.…”

Section: The Quay Crane Scheduling Problem (Qcsp)mentioning

confidence: 99%

“…They revised one such model due to (Sammarra et al, 2007) to take care of interference between quay cranes. They also proposed a Unidirectional Schedule (UDS) heuristic for when the quay cranes do not change moving direction from their initial position and have identical directions of movement both from upper and lower bays.…”

Section: The Quay Crane Scheduling Problem (Qcsp)mentioning

confidence: 99%

See 1 more Smart Citation

Combined quay crane assignment and quay crane scheduling with crane inter-vessel movement and non-interference constraints

Alsoufi

Yang

Salhi

2018

Journal of the Operational Research Society

View full text Add to dashboard Cite

Integrated models of the Quay Crane Assignment Problem (QCAP)and the Quay Crane Scheduling Problem (DCSP) exist. However, they have shortcomings in that some do not allow movement of quay cranes between vessels, others do not take into account precedence relationships between tasks, and yet others do not avoid interference between cranes. Here, an integrated and comprehensive optimisation model that combines the two distinct QCAP and QCSP problems which deals with the issues raised is put forward. The model is of the mixed-integer programming type with the objective being to minimise the tardiness of vessels. Because of the extent of the model and the potential for even small problems to lead to large instances, exact methods can be prohibitive in computational time. For this reason an adapted Genetic Algorithm (GA) is implemented to cope with this computational burden. Experimental results obtained with Branch-and-Cut (B&C) as implemented in CPLEX and GA for small to large scale problem instances are presented. The paper also includes a review of the relevant literature.keyword

show abstract

Section: The Quay Crane Scheduling Problem (Qcsp)mentioning

confidence: 99%

Section: The Quay Crane Scheduling Problem (Qcsp)mentioning

confidence: 99%

Combined quay crane assignment and quay crane scheduling with crane inter-vessel movement and non-interference constraints

Alsoufi

Yang

Salhi

2018

Journal of the Operational Research Society

View full text Add to dashboard Cite

show abstract

“…Since the serial number of tasks is decided according to the non-decreasing order of the release times, all tasks allocated to the same crane can be performed in accordance with the serial number. Taking the code {2,1,3,2,2,1,2,3,3,1,2} as an example, when 11 tasks are assigned to 3 cranes, task (2,6,10) are allocated to crane 1, tasks (1,4,5,7,11) to crane 2, and task (3,8,9) to crane 3. The key to obtain a feasible solution is to decode the chromosome with priority propagation based collision avoidance mechanism.…”

Section: Encoding and Decodingmentioning

confidence: 99%

“…For crane scheduling problem, the cranes can be divided into several sub-sets due to the special circumstances: quay cranes [1][2][3][4][5], yard cranes [6][7][8][9][10], hoist cranes [11][12][13] and cranes in steel-making continuous-casting process [14] and so on. For quay cranes, Kim and Park [1] formulated a mixed integer linear programming model.…”

Section: Introductionmentioning

confidence: 99%

Crane Scheduling in Steelmaking Plants via Priority Propagation and a Memetic Algorithm

Mao¹,

Tang²,

Zhang³

et al. 2017

IJCA

View full text Add to dashboard Cite

show abstract

“…When looking in detail at optimisation techniques to solve the various planning problems per subprocess, it appears that the majority of scientific papers suggest the combination of two methods. In many cases, the planning problem is formally modelled and defined as a specific mathematical programming problem which is then solved with an appropriate (meta)heuristic (e.g., Kozan and Preston, 1999;Sammarra et al, 2007).…”

Section: Literature Reviewmentioning

confidence: 99%

Analysis of the operations of an intermodal barge terminal

Verdonck

Caris

Ramaekers

et al. 2014

IJSPM

View full text Add to dashboard Cite

This paper studies the operations of intermodal barge terminals. The objective is to increase the terminal's efficiency by supporting the operational planning of the terminal operator. For this purpose, a review on general and process-specific barge terminal planning problems, discussed in current scientific literature, is provided. This theoretical knowledge is validated in practice by means of a comparison with operational planning realities at Haven Genk, a Belgian trimodal terminal. Finally, simulation studies based on Haven Genk data are performed to investigate whether vessel size and number of vessels in use have an impact on barge terminal efficiency.

show abstract

A tabu search heuristic for the quay crane scheduling problem

Cited by 156 publications

References 12 publications

Combined quay crane assignment and quay crane scheduling with crane inter-vessel movement and non-interference constraints

Combined quay crane assignment and quay crane scheduling with crane inter-vessel movement and non-interference constraints

Crane Scheduling in Steelmaking Plants via Priority Propagation and a Memetic Algorithm

Analysis of the operations of an intermodal barge terminal

Contact Info

Product

Resources

About