dc.contributorUniversidade de São Paulo (USP)
dc.contributorUniversidade Federal de Lavras (UFLA)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2020-12-10T16:36:33Z
dc.date.accessioned2022-12-19T19:56:07Z
dc.date.available2020-12-10T16:36:33Z
dc.date.available2022-12-19T19:56:07Z
dc.date.created2020-12-10T16:36:33Z
dc.date.issued2011-01-01
dc.identifier2011 Ieee Congress On Evolutionary Computation (cec). New York: Ieee, p. 1194-1201, 2011.
dc.identifierhttp://hdl.handle.net/11449/194753
dc.identifierWOS:000312932600162
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5375389
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.
dc.languageeng
dc.publisherIeee
dc.relation2011 Ieee Congress On Evolutionary Computation (cec)
dc.sourceWeb of Science
dc.subjectGenetic algorithms
dc.subjectProduction planning
dc.subjectLot sizing
dc.subjectOptimization
dc.subjectHeuristic algorithms
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