2012
DOI: 10.4028/www.scientific.net/amr.590.557
|View full text |Cite
|
Sign up to set email alerts
|

Entropy-Enhanced Genetic Algorithm with Tabu Search for Job Shop Scheduling Problems

Abstract: By combining Genetic algorithm with Tabu search algorithm and adjusting crossover rate and mutation rate based on information entropy, a hybrid genetic algorithm was proposed for larger-scale job shop scheduling problems, and the benchmark instances were used to verify the algorithm with simulation. Simulation results show that the proposed algorithm can solve larger-scale job shop scheduling problems, and it has obvious advantages over traditional scheduling algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 4 publications
(5 reference statements)
0
2
0
Order By: Relevance
“…Given the same maximum iteration generation and particle swarm size, IPSOA algorithm, standard genetic algorithms (SGA) [37], and traditional particle swarm optimization algorithm (PSO) [35] are used to solve the same service composition optimization problem, respectively. As shown in Figure 7, IPSOA converges to the optimal solution in the 49-th generation, SGA converges in the 82-nd generation, and PSO converges to the optimal solution in the 54-th generation.…”
Section: Application Examplementioning
confidence: 99%
“…Given the same maximum iteration generation and particle swarm size, IPSOA algorithm, standard genetic algorithms (SGA) [37], and traditional particle swarm optimization algorithm (PSO) [35] are used to solve the same service composition optimization problem, respectively. As shown in Figure 7, IPSOA converges to the optimal solution in the 49-th generation, SGA converges in the 82-nd generation, and PSO converges to the optimal solution in the 54-th generation.…”
Section: Application Examplementioning
confidence: 99%
“…The average run time of the algorithm is 13.66s, and the evolution curves are shown in Figure 7. Given the same maximum evolutionary generation and population size, IGABE algorithm, traditional genetic algorithm (SGA), hybrid genetic algorithm (HGA) [45], and cloud-entropy enhanced genetic algorithm (CEGA) [34] are used to solve the same problem. As shown in Figure 8, the IGABE has converged to the optimal solution of the manufacturing task when it evolves to the fifty-seventh generation, the SGA has not converged until the ninety-fourth generation, the HGA converges in the seventy-first generation, and the CEGA converges in the fifty-fourth generation.…”
Section: Application Examplementioning
confidence: 99%