7th International Conference on Hybrid Intelligent Systems (HIS 2007) Evolutionary Approaches to Solve an Integrated Lot Scheduling Problem in the Soft Drink Industry Kaiserslautern, Germany September 17-September 19 ISBN: 0-7695-2946-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HIS.2007.35
This paper proposes two evolutionary approaches as procedures to solve the Synchronized and Integrated Two-Level Lot-Sizing and Scheduling Problem (SITLSP). This problem can be found in some industrial settings, mainly soft drink companies, where the production process involves two interdependent levels with decisions concerning raw material storage and soft drink bottling. The first approach to solve the SITLSP is a Multi-Population Genetic Algorithm (GA) with a hierarchical ternary tree structure for populations. The second approach is a Memetic Algorithm (MA) that extends the GA approach through the inclusion of a local search procedure. The computational study reported reveals that those methods are an effective alternative to solve real-world instances of the SITLSP.
Citation:
Claudio Fabiano Motta Toledo, Paulo Morelato Franca, Reinaldo Morabito, Alf Kimms, "Evolutionary Approaches to Solve an Integrated Lot Scheduling Problem in the Soft Drink Industry," his, pp.95-100, 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||