A genetic algorithm for the capacitated lot sizing problem with setup times.

Chen, Jiayi.Thesis (M.Phil.)--Chinese University of Hong Kong, 2009.Includes bibliographical references (p. 86-94).Abstract also in Chinese.Abstract --- p.iAcknowledgement --- p.ivIntroduction --- p.1Chapter 1.1 --- Introduction to the Capacitated Lot Sizing (CLS )problem --- p.1Chapter 1.2 --- Our contributions --- p.2Chapter 1.3 --- Organization of the thesis --- p.4Literature Review --- p.5Chapter 2.1 --- Research in CLS problem --- p.5Chapter 2.1.1 --- Reviews in CLS problems --- p.8Chapter 2.1.2 --- Approaches and methods to solve the traditional CLS problems --- p.9Chapter 2.1.3 --- Research on Fixed-Charge-Transportation-typed models for CLS problems --- p.13Chapter 2.2 --- Research in Genetic Algorithm (GA) --- p.15Chapter 2.3 --- Conclusion --- p.17Problem Description and Formulation --- p.18Chapter 3.1 --- The formulation --- p.18Chapter 3.2 --- Comparison with the traditional formulation --- p.24Chapter 3.3 --- Conclusion --- p.28Description of the Heuristic --- p.29Chapter 4.1 --- Initialization --- p.32Chapter 4.1.1 --- Setup string generation --- p.32Chapter 4.1.2 --- Transportation problem --- p.35Chapter 4.1.3 --- Consistency test --- p.47Chapter 4.2 --- Selection --- p.50Chapter 4.3 --- Crossover --- p.50Chapter 4.4 --- Mutation --- p.52Chapter 4.5 --- Evaluation --- p.53Chapter 4.6 --- Termination --- p.54Chapter 4.7 --- Conclusion --- p.54Design of Experiments and Computational Results --- p.56Chapter 5.1 --- Design of experiments --- p.57Chapter 5.2 --- Discussion of lower bound procedures --- p.63Chapter 5.3 --- Computational results --- p.65Chapter 5.3.1 --- CLS problems with setup times --- p.65Chapter 5.3.2 --- CLS problems without setup times --- p.77Chapter 5.4 --- Conclusion --- p.82Conclusion --- p.83Bibliography --- p.8