A hybrid heuristic approach to solve the multi level capacitated lot sizing problem

dc.contributor.authorToledo, Claudio Fabiano Motta
dc.contributor.authorDe Oliveira, Renato Resende Ribeiro
dc.contributor.authorFranca, Paulo Morelato [UNESP]
dc.contributor.institutionUniversidade de São Paulo (USP)
dc.contributor.institutionDept. of Computer Science
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.date.accessioned2022-04-28T18:57:07Z
dc.date.available2022-04-28T18:57:07Z
dc.date.issued2011-08-29
dc.description.abstractThis paper presents preliminary results found by a hybrid heuristic applied to solve the Multi-Level Capacitated Lot Sizing Problem (MLCLSP). The proposed method combines a multi-population genetic algorithm and fix-and-optimize heuristic. These methods are also integrated to a mathematical programming approach. For this, a mathematical reformulation of MLCLSP model is proposed to embed the exact solution of the model in the heuristic approaches. The hybrid heuristic is evaluated in two sets of benchmark instances. The solutions found are compared with those reached by other methods from literature. The preliminary results obtained indicate that the hybrid heuristic outperforms other approaches in the majority of problems solved. © 2011 IEEE.en
dc.description.affiliationUniversity of São Paulo Institute of Mathematics and Computer Science
dc.description.affiliationFederal University of Lavras Dept. of Computer Science
dc.description.affiliationUNESP - Dept. of Mathematics Statistics and Computation
dc.description.affiliationUnespUNESP - Dept. of Mathematics Statistics and Computation
dc.format.extent1194-1201
dc.identifierhttp://dx.doi.org/10.1109/CEC.2011.5949752
dc.identifier.citation2011 IEEE Congress of Evolutionary Computation, CEC 2011, p. 1194-1201.
dc.identifier.doi10.1109/CEC.2011.5949752
dc.identifier.scopus2-s2.0-80051965398
dc.identifier.urihttp://hdl.handle.net/11449/219699
dc.language.isoeng
dc.relation.ispartof2011 IEEE Congress of Evolutionary Computation, CEC 2011
dc.sourceScopus
dc.subjectGenetic algorithms
dc.subjectHeuristic algorithms
dc.subjectLot sizing
dc.subjectOptimization
dc.subjectProduction planning
dc.titleA hybrid heuristic approach to solve the multi level capacitated lot sizing problemen
dc.typeTrabalho apresentado em evento

Arquivos

Coleções