A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem

Authors:
Claudio F. M. Toledo;Marcio da Silva Arantes;Renato R. R. Oliveira;Alexandre C. B. Delbem
Affiliations:
University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil;University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil;Federal University of Lavras, Lavras, MG, Brazil;University of Sao Paulo, ICMC, Sao Carlos, SP, Brazil
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 8
Cited 1

A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times

Management Science
Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

Operations Research
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

Computers and Operations Research
Estimation of particle swarm distribution algorithms: Combining the benefits of PSO and EDAs

Information Sciences: an International Journal
The compact genetic algorithm

IEEE Transactions on Evolutionary Computation
A hybrid heuristic for the traveling salesman problem

IEEE Transactions on Evolutionary Computation
A family of compact genetic algorithms for intrinsic evolvable hardware

IEEE Transactions on Evolutionary Computation
Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization

IEEE Transactions on Evolutionary Computation

A hybrid cGA applied to the MLCLSP with overtime

ACM SIGAPP Applied Computing Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

The present paper proposes a hybrid version of a compact genetic algorithm (cGA) as approach to solve the Multi-Level Capacitated Lot Sizing Problem. A fix and optimize heuristic is embedded with cGA to improve solutions while mathematical programming technique is used to evaluate them. This hybrid approach is tested over two sets of benchmark instances. The results achieved are compared with two time-oriented decomposition heuristics from literature and with a hybrid multi-population genetic algorithm recently proposed for the same problem. Computational results show that the hybrid cGA has a superior performance mainly for instances dealing with setup times.