Advanced search
Start date
Betweenand


Genetic Algorithm, MIP and Improvement Heuristic Applied to the MLCLP with Backlogging

Full text
Author(s):
Toledo, Claudio F. M. ; Hossomi, Marcelo Y. B. ; Arantes, Marcio da Silva ; Franca, Paulo Morelato ; IEEE
Total Authors: 5
Document type: Journal article
Source: 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC); v. N/A, p. 8-pg., 2013-01-01.
Abstract

The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and optimize. This approach is evaluated over sets of benchmark instances and compared to methods from literature. Computational results indicate competitive results applying the proposed method when compared with other literature approaches. (AU)

FAPESP's process: 12/00997-2 - Study and development of hybrid heuristics and metaheuristics to the multi-level capacitated lot sizing problem
Grantee:Marcelo Yukio Bressan Hossomi
Support Opportunities: Scholarships in Brazil - Scientific Initiation
FAPESP's process: 11/15534-5 - Hybrid heuristics and metaheuristics applied to the multi-level capacitated lot sizing problem
Grantee:Claudio Fabiano Motta Toledo
Support Opportunities: Regular Research Grants
FAPESP's process: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants