A modified genetic algorithm for quay crane scheduling operations

Chung, Sai Ho; Choy, King Lun

doi:10.1016/j.eswa.2011.09.113

Cited by 76 publications

(39 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given the constraint of non-crossing for QCs and sequence requirements among tasks, Jin and Li [18] used a GA to solve the QCSP. In another study, Chung and Choy [1] also employed a GA to deal with the QCSP. Their experimental results showed that the proposed GA was as good as many of the existing algorithms, but it needed less computational time.…”

Section: Studies Focusing On Qcspmentioning

confidence: 99%

“…• Task_tokens (<I,D,container(K,N I L , N I uL )>) task_token ("ship 1",0,container (1,40,30)). task_token ("ship 1",0,container (3,50,45)).…”

Section: Appendix Amentioning

confidence: 99%

“…Over the past two decades, the demand for maritime transport has increased dramatically [1]. The number of container shipments between 1990 and 2008 has increased from 28.7 million to 152 million, representing a 9.5% average annual compound growth rate [2].…”

Section: Introductionmentioning

confidence: 99%

“…Simulation has been used to solve BAP [14], QCSP [11,15], and as an evaluation tool for terminal operations [16]. Genetic algorithms (GAs) have been used to solve dynamic QCAP [17], QCSP [1,18], simultaneous BAP and QCAP [19][20][21], and simultaneous BAP and QCSP [7,[22][23][24]. Heuristic rules have been employed to solve QCSP [25].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

et al. 2017

View full text Add to dashboard Cite

Container terminals (CTs) play an essential role in the global transportation system. To deal with growing container shipments, a CT needs to better solve the three essential seaside operational problems; berth allocation problem (BAP), quay crane assignment problem (QCAP), and quay crane scheduling problem (QCSP), which affect the performance of a CT considerably. In past studies, the three seaside operational problems have often been solved individually or partially, which is likely to result in poor overall system performance. However, solving the three seaside operational problems simultaneously is in fact a very complicated task. In this research, we dealt with the three seaside operational problems at the same time by using a novel high-level Petri net, termed an Object-Oriented and Timed Predicate/Transition Net (OOTPr/Tr net). After defining the three seaside operational problems formally, we integrated them as a three-level framework that was further transformed into an OOTPr/Tr net model. Then, using the Prolog programming language, we implemented this model as a simulation tool to find the best solution based on the various combinations of heuristic rules used.

show abstract

Section: Studies Focusing On Qcspmentioning

confidence: 99%

“…• Task_tokens (<I,D,container(K,N I L , N I uL )>) task_token ("ship 1",0,container (1,40,30)). task_token ("ship 1",0,container (3,50,45)).…”

Section: Appendix Amentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

et al. 2017

View full text Add to dashboard Cite

show abstract

“…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. (Chung and Choy, 2012) proposed a variant of GA to solve (Kim and Park, 2004) model's of QCSP. Their results compared well with those obtained by most well established algorithms.…”

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

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

Bibliography

2018

Metaheuristics for Maritime Operations

View full text Add to dashboard Cite

A modified genetic algorithm for quay crane scheduling operations

Cited by 76 publications

References 17 publications

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

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

Bibliography

Contact Info

Product

Resources

About