A hybrid cGA applied to the MLCLSP with overtime

A hybrid version of a compact genetic algorithm (cGA) is presented as approach to solve the Multi-Level Capacitated Lot Sizing Problem. The present paper extends results reported in [18]. The hybrid method combines a fix and optimize heuristic with cGA aiming to improve solutions generated by cGA. Also a linear mathematical programming model is solved to first evaluated solution provided by cGA. The performance of the hybrid compact genetic algorithm (HcGA) is evaluated over two sets of benchmark instances. The results are compared against methods from literature recently proposed for the same problem: two time-oriented decomposition heuristics and a hybrid multi-population genetic algorithm. A superior performance of HcGA is reported mainly for instances dealing with setup times and against time-oriented decomposition heuristics.

[1]  Hacer Güner Gören,et al.  A review of applications of genetic algorithms in lot sizing , 2010, J. Intell. Manuf..

[2]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[3]  H. Tempelmeier,et al.  A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times , 1996 .

[4]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

[5]  Jinung An,et al.  Estimation of particle swarm distribution algorithms: Combining the benefits of PSO and EDAs , 2012, Inf. Sci..

[6]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[7]  Claudio Fabiano Motta Toledo,et al.  A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging , 2013, Comput. Oper. Res..

[8]  Hartmut Stadtler,et al.  Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows , 2003, Oper. Res..

[9]  Horst Tempelmeier,et al.  Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic , 2009, Comput. Oper. Res..

[10]  David Naso,et al.  Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization , 2008, IEEE Transactions on Evolutionary Computation.

[11]  Thomas Weise,et al.  Global Optimization Algorithms -- Theory and Application , 2009 .

[12]  Claudio Fabiano Motta Toledo,et al.  A hybrid heuristic approach to solve the multi level capacitated lot sizing problem , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[13]  Zeger Degraeve,et al.  Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches , 2004, Eur. J. Oper. Res..

[14]  Kerem Akartunali,et al.  A heuristic approach for big bucket multi-level production planning problems , 2009, Eur. J. Oper. Res..

[15]  Stefan Helber,et al.  A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems , 2010 .

[16]  Claudio Fabiano Motta Toledo,et al.  A hybrid compact genetic algorithm applied to the multi-level capacitated lot sizing problem , 2013, SAC '13.

[17]  José Ignacio Hidalgo,et al.  A hybrid heuristic for the traveling salesman problem , 2001, IEEE Trans. Evol. Comput..

[18]  John C. Gallagher,et al.  A family of compact genetic algorithms for intrinsic evolvable hardware , 2004, IEEE Transactions on Evolutionary Computation.

[19]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[20]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..