Journal of System Simulation
Abstract
Abstract: A class of zero-wait fermentation process scheduling issues with batch process characteristics are researched. In order to solve the problem of easy deterioration in the process, a super heuristic difference algorithm is proposed, and the maximum makespan is minimized as the optimization goal. The algorithm is divided into two layers. The upper layer is an improved adaptive differential evolution algorithm to select and sort the heuristic operations in lower layer. The lower layer is combined and sorted into a new algorithm to operate on the problem domain, adding simulated annealing algorithm to avoid falling into local optimization. The method has a learning mechanism and the strong generalization ability for different problems. The effectiveness of the algorithm is verified by comparing with the actual production. The result shows that the algorithm has better performance than the traditional heuristic algorithm.
Recommended Citation
Peng, Shen; Yan, Wang; Ji, Zhicheng; and Zhang, Jianhua
(2020)
"Hyper-heuristic DE Algorithm for Solving Zero-wait Fermentation Process Schedulinge,"
Journal of System Simulation: Vol. 32:
Iss.
11, Article 20.
DOI: 10.16182/j.issn1004731x.joss.20-FZ0399
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol32/iss11/20
First Page
2235
Revised Date
2020-07-13
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.20-FZ0399
Last Page
2243
CLC
TP278
Recommended Citation
Shen Peng, Wang Yan, Ji Zhicheng, Zhang Jianhua. Hyper-heuristic DE Algorithm for Solving Zero-wait Fermentation Process Schedulinge[J]. Journal of System Simulation, 2020, 32(11): 2235-2243.
DOI
10.16182/j.issn1004731x.joss.20-FZ0399
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons