2022
DOI: 10.1016/j.cor.2021.105694
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(2 citation statements)
references
References 43 publications
0
0
0
Order By: Relevance
“…Li et al [22] proposed an efficient optimization algorithm that is a hybrid of the iterated greedy and simulated annealing algorithms to solve the FJSP with two objectives, which are simultaneously considered, namely, the minimization of the maximum completion time and the energy consumption during machine processing and material transportation. Türkyılmaz et al [23] introduced a biobjective hybrid GA-hypervolume contribution measure that integrates GA with a multisearch algorithm and uses a hypervolume contribution measure (∆s) in its two-level selection strategy.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Li et al [22] proposed an efficient optimization algorithm that is a hybrid of the iterated greedy and simulated annealing algorithms to solve the FJSP with two objectives, which are simultaneously considered, namely, the minimization of the maximum completion time and the energy consumption during machine processing and material transportation. Türkyılmaz et al [23] introduced a biobjective hybrid GA-hypervolume contribution measure that integrates GA with a multisearch algorithm and uses a hypervolume contribution measure (∆s) in its two-level selection strategy.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Mousakhani [2] Minimize total tardiness Iterated local search Shen et al [3] Minimize makespan Tabu search with specific neighborhood search function Bagheri and Zandieh [4] Minimize makespan and mean tardiness Variable neighborhood search Abdelmaguid [5] Minimize makespan Tabu search with specific neighborhood functions Naderi et al [6] Minimize makespan Genetic algorithm Li and Lei [7] Minimize makespan, total tardiness, and total energy consumption Imperialist competitive algorithm with feedback Defersha and Chen [8] Minimize makespan Parallel genetic algorithm Azzouz et al [9] Minimize makespan and bi-criteria objective function Hybrid genetic algorithm and variable neighborhood search Wang and Zhu [10] Minimize makespan Hybrid genetic algorithm and tabu search Li et al [11] Minimize makespan and total setup costs Elitist nondominated sorting hybrid algorithm Azzouz et al [12] Minimize makespan Hybrid genetic algorithm and iterated local search Azzouz et al [13] Minimize makespan Adaptive genetic algorithm Abderrabi et al [14] Minimize total flow time Genetic algorithm and iterated local search Parjapati and Ajai [15] Minimize makespan Genetic algorithm Sadrzadeh [16] Minimize makespan and mean tardiness Artificial immune system and particle swarm optimization Tayebi Araghi et al [17] Minimize makespan Genetic variable neighborhood search with affinity function Sun et al [18] Minimize makespan, total workload, workload of critical machine, and penalties of earliness/tardiness Hybrid many-objective evolutionary algorithm Li et al [19] Minimize energy consumption and makespan Improved Jaya algorithm Müller et al [20] Minimize makespan Decision trees and deep neural networks Wei et al [21] Minimize the makespan and total energy consumption Energy-aware estimation model Li et al [22] Minimize the makespan and the total workload Hybrid self-adaptive multi-objective evolutionary algorithm Türkyılmaz et al [23] Minimize makespan Hybrid Genetic Algorithm-hypervolume contribution measure Jiang et al [24] Handle the issues of low production efficiency, high energy consumption and processing cost A novel improved crossover artificial bee colony algorithm Exploration and exploitation are treated as the most important features of heuristic algorithms. The trade-off between the two features is crucial to the computational performance.…”
Section: Literature Objective Function Algorithmsmentioning
confidence: 99%