论文信息 - Application of Negotiable Evolutionary Algorithm in flexible manufacturing planning and scheduling

Application of Negotiable Evolutionary Algorithm in flexible manufacturing planning and scheduling

A Negotiable Evolutionary Algorithm (NEA) meta-heuristic approach is presented in this paper for solving the Integrated Production Planning and Scheduling (IPPS) problem in Flexible Manufacturing Systems (FMS). The NEA approach addresses the rationales that we have identified as the key features required for effectively solving complex IPPS problems. Considerable experiments have been conducted and the results have confirmed that NEA outperforms the conventional EA approach.

[1] Kenneth A. De Jong,et al. Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents , 2000, Evolutionary Computation.

[2] James C. Bean,et al. Random keys genetic algorithm for scheduling : unabridged version , 1995 .

[3] Stanley B. Gershwin,et al. Manufacturing Systems Engineering , 1993 .

[4] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[5] Mitsuo Gen,et al. Network Models and Optimization: Multiobjective Genetic Algorithm Approach , 2008 .

[6] Ying-Chin Ho,et al. Solving cell formation problems in a manufacturing environment with flexible processing and routeing capabilities , 1996 .

[7] Jesuk Ko,et al. A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling , 2003, Comput. Oper. Res..

[8] William A. Miller,et al. An evolutionary algorithm-based decision support system for managing flexible manufacturing , 2004 .

[9] D. Gerwin. Manufacturing flexibility: a strategic perspective , 1993 .