2010
DOI: 10.1016/j.tre.2009.07.002
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid parallel genetic algorithm for yard crane scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
41
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 81 publications
(41 citation statements)
references
References 21 publications
0
41
0
Order By: Relevance
“…Further application of hybrid genetic algorithm with other methods can be seen in numerous fields such as in yard crane scheduling problem (He et al, 2010), vehicle routing problem (Berger and Barkaoui, 2003), image segmentation problem (Awad et al, 2009), circuit ratiocut partitioning problem (Bui and Moon, 1998) and wavelet neural network problem (Pan et al, 2008).…”
Section: Hybrid Genetic Algorithm With Other Methodsmentioning
confidence: 99%
“…Further application of hybrid genetic algorithm with other methods can be seen in numerous fields such as in yard crane scheduling problem (He et al, 2010), vehicle routing problem (Berger and Barkaoui, 2003), image segmentation problem (Awad et al, 2009), circuit ratiocut partitioning problem (Bui and Moon, 1998) and wavelet neural network problem (Pan et al, 2008).…”
Section: Hybrid Genetic Algorithm With Other Methodsmentioning
confidence: 99%
“…Each container section is operated by a different crane, which slows down the work -especially when the crane has to move among such sections in parallel rows: in this case 90 o turns are required, leading to traffic jam, delays or even collisions [3]. Also, this section-to-section movement causes loss in the crane productivity [4]. In general, solution to this problem is defined as the off-line planning and knowledge-based system development.…”
Section: Related Workmentioning
confidence: 99%
“…In general, solution to this problem is defined as the off-line planning and knowledge-based system development. Also, researchers offer to use heuristic methods for allocation of a vacant yard crane that could be displaced to another unit; or, in the case of NPcomplete problem (NP stands for Non-Deterministic Polynomial) a parallel genetic algorithm (PGA) can be used [3,4].…”
Section: Related Workmentioning
confidence: 99%
“…Most previous studies focused on the optimization problems of single handling equipment independently of one another, which are QC scheduling problems [3][4][5], YT scheduling problems [6,7] and YC scheduling problems [8][9][10]. A few studies concentrated on integrating QC-YT scheduling problems [2,11,12,13,14].…”
Section: Introductionmentioning
confidence: 99%
“…Loading operations are only considered with the objective of minimizing the makespan. He et al [10] employed a hybrid GA for solving YC scheduling problem. They addressed that YCs needed to move among different blocks to fully utilize YCs.…”
Section: Introductionmentioning
confidence: 99%