Evolutionary algorithms for production planning problems with setup decisions

Production planning problems with setup decisions, which were formulated as mixed integer programmes (MIP), are solved in this study. The integer component of the MIP solution is determined by three evolution algorithms used in this study. Firstly, a traditional genetic algorithm (GA) uses conventional crossover and mutation operators for generating new chromosomes (solutions). Secondly, a modified GA uses not only the conventional operators but also a sibling operator, which stochastically produces new chromosomes from old ones using the sensitivity information of an associated linear programme. Thirdly, a sibling evolution algorithm uses only the sibling operator to reproduce. Based on the experiments done in this study, the sibling evolution algorithm performs the best among all the algorithms used in this study.

[1]  Chuen-Lung Chen,et al.  An application of genetic algorithms for flow shop problems , 1995 .

[2]  Jatinder N. D. Gupta,et al.  Determining lot sizes and resource requirements: A review , 1987 .

[3]  John A. Miller,et al.  An evaluation of local improvement operators for genetic algorithms , 1993, IEEE Trans. Syst. Man Cybern..

[4]  Patrick D. Surry,et al.  Formal Memetic Algorithms , 1994, Evolutionary Computing, AISB Workshop.

[5]  S. Elmaghraby.  The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[6]  Chung Yee Lee,et al.  Job shop scheduling with a genetic algorithm and machine learning , 1997 .

[7]  Yi-Feng Hung,et al.  Solving mixed integer programming production planning problems with setups by shadow price information , 1998, Comput. Oper. Res..

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  Brian W. Kernighan,et al.  The C Programming Language , 1978 .

[10]  Arnoldo C. Hax,et al.  Production and inventory management , 1983 .

[11]  Volker Nissen,et al.  Evolutionary Algorithms in Management Applications , 1995 .

[12]  Volker Nissen,et al.  An Overview of Evolutionary Algorithms in Management Applications , 1995 .

[13]  The Spirit of System: Lamarck and Evolutionary Biology , 1977 .

[14]  Marc Salomon,et al.  Batching decisions: structure and models , 1994 .

[15]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[16]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[17]  Kazuhiko Kawamura,et al.  Managing genetic search in job shop scheduling , 1993, IEEE Expert.

[18]  Shu-Cherng Fang,et al.  A genetics-based approach for aggregated production planning in a fuzzy environment , 1997, IEEE Trans. Syst. Man Cybern. Part A.

[19]  Riyaz Sikora,et al.  A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line , 1996 .

[20]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[21]  Colin R. Reeves,et al.  Genetic Algorithms and Neighbourhood Search , 1994, Evolutionary Computing, AISB Workshop.

[22]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[23]  Ken-ichi Sato,et al.  Hybridizing a Genetic Algorithm with Rule-Based Reasoning for Production Planning , 1995, IEEE Expert.

[24]  R. Deal.  Simulation Modeling and Analysis (2nd Ed.) , 1994 .

[25]  Michael J. Shaw,et al.  A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[26]  Andrew Y. C. Nee,et al.  Using genetic algorithms in process planning for job shop machining , 1997, IEEE Trans. Evol. Comput..

[27]  Luk N. Van Wassenhove,et al.  Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review , 1988 .