Multi-Objective Genetic Programming Based on Decomposition on Evolving Scheduling Heuristics for Dynamic Scheduling

Created by W.Langdon from gp-bibliography.bib Revision:1.7644

@InProceedings{Xu:2023:GECCOcomp,

• author = "Meng Xu and Yi Mei and Fangfang Zhang and Mengjie Zhang",
• title = "Multi-Objective Genetic Programming Based on Decomposition on Evolving Scheduling Heuristics for Dynamic Scheduling",
• booktitle = "Proceedings of the Companion Conference on Genetic and Evolutionary Computation",
• year = "2023",
• editor = "Sara Silva and Luis Paquete and Leonardo Vanneschi and Nuno Lourenco and Ales Zamuda and Ahmed Kheiri and Arnaud Liefooghe and Bing Xue and Ying Bi and Nelishia Pillay and Irene Moser and Arthur Guijt and Jessica Catarino and Pablo Garcia-Sanchez and Leonardo Trujillo and Carla Silva and Nadarajen Veerapen",
• pages = "427--430",
• address = "Lisbon, Portugal",
• series = "GECCO '23",
• month = "15-19 " # jul,
• organisation = "SIGEVO",
• publisher = "Association for Computing Machinery",
• publisher_address = "New York, NY, USA",
• keywords = "genetic algorithms, genetic programming, decomposition, MOEA/D, multi-objective dynamic flexible job shop scheduling: Poster",
• isbn13 = "9798400701207",
• DOI = "doi:10.1145/3583133.3590582",
• size = "4 pages",
• abstract = "Dynamic flexible job shop scheduling (DFJSS) is an important combinatorial optimisation problem that requires handling machine assignment and operation sequencing simultaneously in dynamic environments. Genetic programming (GP) has achieved great success to evolve scheduling heuristics for DFJSS. In manufacturing, multi-objective DFJSS (MO-DFJSS) is more common and challenging due to conflicting objectives. Existing Pareto dominance-based multi-objective GP methods show their limitations of not providing good spreadability and consistency in heuristic behaviour. Multi-objective evolutionary algorithm based on decomposition (MOEA/D) has the potential to provide good spreadability and consistency due to the mechanisms of weights-based subproblems decomposition and neighbours-based evolution. However, it is non-trivial to apply MOEA/D to MO-DFJSS since we need to search in heuristic space. To address these challenges, we propose a multi-objective GP approach based on decomposition (MOGP/D) that incorporates the advantages of MOEA/D and GP to learn scheduling heuristics for MO-DFJSS. A mapping strategy is designed to find the fittest individual for each subproblem. Extensive experiments show that MOGP/D obtains competitive performance with the state-of-the-art methods for MO-DFJSS, and good spreadability and consistency in heuristic behaviour.",
• notes = "Also known as \cite{xu:2023:GECCOcomp} GECCO-2023 A Recombination of the 32nd International Conference on Genetic Algorithms (ICGA) and the 28th Annual Genetic Programming Conference (GP)",

}

Genetic Programming entries for Meng Xu Yi Mei Fangfang Zhang Mengjie Zhang

Citations