- No file added yet -
A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules
journal contribution
posted on 2020-10-29, 00:49 authored by Su Nguyen, Yi MeiYi Mei, Bing XueBing Xue, Mengjie ZhangMengjie Zhang© 2018 Massachusetts Institute of Technology. Designing effective dispatching rules for production systems is a difficult and timeconsuming task if it is done manually. In the last decade, the growth of computing power, advanced machine learning, and optimisation techniques has made the automated design of dispatching rules possible and automatically discovered rules are competitive or outperform existing rules developed by researchers. Genetic programming is one of the most popular approaches to discovering dispatching rules in the literature, especially for complex production systems. However, the large heuristic search space may restrict genetic programming from finding near optimal dispatching rules. This article develops a new hybrid genetic programming algorithm for dynamic job shop scheduling based on a new representation, a new local search heuristic, and efficient fitness evaluators. Experiments show that the new method is effective regarding the quality of evolved rules. Moreover, evolved rules are also significantly smaller and contain more relevant attributes.
History
Preferred citation
Nguyen, S., Mei, Y., Xue, B. & Zhang, M. (2018). A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules. Evolutionary Computation, 27(3), 467-596. https://doi.org/10.1162/evco_a_00230Publisher DOI
Journal title
Evolutionary ComputationVolume
27Issue
3Publication date
2018-01-01Pagination
467-596Publisher
MIT PressPublication status
PublishedISSN
1063-6560eISSN
1530-9304Language
enUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC