A novel grammatical evolution algorithm for automatic design of scheduling heuristics

Yifei Teng, Shaofeng Du, Zhenjun Hong, Xuhui Wu, Yunna Tian, Dongni Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

There are two reasons making the existing intercell scheduling algorithms hardly be put into use in practice. One is the negligence of transportation among cells that affects the accuracy of the scheduling solutions, and the other one is the large problem size that decrease the computation efficiency. A novel grammatical evolution (NGE) algorithm is proposed to address the intercell scheduling problem with limited transportation capacity. This problem is divided into two subproblems: sequencing for parts and routing for vehicles. A two-stage evolutionary is developed to evolve better heuristic rules. In the first stage, string-form individuals are evolved, and in the second one, tree-form individuals are evolved. Through the comparative experiments, the effectiveness and efficiency of NGE are verified.

Original languageEnglish
Title of host publication2019 IEEE 15th International Conference on Automation Science and Engineering, CASE 2019
PublisherIEEE Computer Society
Pages579-584
Number of pages6
ISBN (Electronic)9781728103556
DOIs
Publication statusPublished - Aug 2019
Event15th IEEE International Conference on Automation Science and Engineering, CASE 2019 - Vancouver, Canada
Duration: 22 Aug 201926 Aug 2019

Publication series

NameIEEE International Conference on Automation Science and Engineering
Volume2019-August
ISSN (Print)2161-8070
ISSN (Electronic)2161-8089

Conference

Conference15th IEEE International Conference on Automation Science and Engineering, CASE 2019
Country/TerritoryCanada
CityVancouver
Period22/08/1926/08/19

Fingerprint

Dive into the research topics of 'A novel grammatical evolution algorithm for automatic design of scheduling heuristics'. Together they form a unique fingerprint.

Cite this