2021
DOI: 10.1109/tevc.2021.3056143
|View full text |Cite
|
Sign up to set email alerts
|

Correlation Coefficient-Based Recombinative Guidance for Genetic Programming Hyperheuristics in Dynamic Flexible Job Shop Scheduling

Abstract: Dynamic flexible job shop scheduling is a challenging combinatorial optimisation problem due to its complex environment. In this problem, machine assignment and operation sequencing decisions need to be made simultaneously under the dynamic environments. Genetic programming, as a hyper-heuristic approach, has been successfully used to evolve scheduling heuristics for dynamic flexible job shop scheduling. However, in traditional genetic programming, recombination between parents may disrupt the beneficial build… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
4
1
1

Relationship

2
8

Authors

Journals

citations
Cited by 63 publications
(17 citation statements)
references
References 67 publications
0
17
0
Order By: Relevance
“…You can see in the table below that the computed Cronbach alpha ranges from 0.72 to 0.83, which is an excellent outcome (see Table 2). Finding the direction and magnitude of a linear relationship between two variables is done via correlation analysis (Zhang et al, 2021). The strength and relevance of their link are revealed by the degree of correlation.…”
Section: Resultsmentioning
confidence: 99%
“…You can see in the table below that the computed Cronbach alpha ranges from 0.72 to 0.83, which is an excellent outcome (see Table 2). Finding the direction and magnitude of a linear relationship between two variables is done via correlation analysis (Zhang et al, 2021). The strength and relevance of their link are revealed by the degree of correlation.…”
Section: Resultsmentioning
confidence: 99%
“…Experimental results show that this method can effectively improve the quality of evolutionary rules. Zhang et al [27] proposed a recombination mechanism based on correlation coefficients, which provided guidance for super-narrow GP to generate progeny by efficient adaptive recombination in DFJSP. This helps GPHH find better scheduling heuristic by improving the generation quality and analyzing the performance of the proposed algorithm in terms of evolution rules, convergence speed, and training time efficiency.…”
Section: Dynamic Job Shop Scheduling Based On Conventional Methodsmentioning
confidence: 99%
“…The flexible representations and search mechanisms make GP a suitable approach to designing scheduling heuristics, since the structure and size of optimal heuristics are not known in advance. A general GP based hyper-heuristic (GPHH) framework was presented in [27], and it has been successfully used in different problems such as packing [28,107], timetabling [8,198], arc routing [5,227] and JSS [106,169,170,172,241]. In the last decade, GPHH works as heuristic generation approach, has been the dominating technique to evolve scheduling heuristics for DFJSS automatically.…”
Section: Existing Approachesmentioning
confidence: 99%