An effective architecture for learning and evolving flexible job-shop schedules

作者：Ho Nhu Binh; Tay Joc Cing^*; Lai Edmund M K

来源：European Journal of Operational Research, 2007, 179(2): 316-333.

DOI：10.1016/j.ejor.2006.04.007

• Genetic Algorithms
• scheduling
• Composite Dispatching Rules
• flexible Job-Shop problems

In recent years, the interaction between evolution and learning has received much attention from the research community. Some recent studies on machine learning have shown that it can significantly improve the efficiency of problem solving when using evolutionary algorithms. This paper proposes an architecture for learning and evolving of Flexible Job-Shop schedules called LEarnable Genetic Architecture (LEGA). LEGA provides an effective integration between evolution and learning within a random search process. Unlike the canonical evolution algorithm, where random elitist selection and mutational genetics are assumed; through LEGA, the knowledge extracted from previous generation by its schemata learning module is used to influence the diversity and quality of offsprings. In addition, the architecture specifies a population generator module that generates the initial population of schedules and also trains the schemata learning module. A large range of benchmark data taken from literature and some generated by ourselves are used to analyze the efficacy of LEGA. Experimental results indicate that an instantiation of LEGA called GENACE outperforms current approaches using canonical EAs in computational time and quality of schedules.

• 出版日期2007-6-1
• 单位南阳理工学院