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

dc.contributorUniversidade de São Paulo (USP)
dc.contributorDept. of Computer Science
dc.contributorUniversidade Estadual Paulista (UNESP)
dc.date.accessioned2022-04-28T18:57:07Z
dc.date.accessioned2022-12-20T00:50:37Z
dc.date.available2022-04-28T18:57:07Z
dc.date.available2022-12-20T00:50:37Z
dc.date.created2022-04-28T18:57:07Z
dc.date.issued2011-08-29
dc.identifier2011 IEEE Congress of Evolutionary Computation, CEC 2011, p. 1194-1201.
dc.identifierhttp://hdl.handle.net/11449/219699
dc.identifier10.1109/CEC.2011.5949752
dc.identifier2-s2.0-80051965398
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5399828
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.
dc.languageeng
dc.relation2011 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 problem
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución