A memetic framework for solving the lot sizing and scheduling problem in soft drink plants

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade de São Paulo (USP)-
Autor(es): dc.contributorUniversity of Lavras-
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.contributorUniversidade Federal de São Carlos (UFSCar)-
Autor(es): dc.creatorToledo, Claudio F. M.-
Autor(es): dc.creatorArantes, Marcio S.-
Autor(es): dc.creatorFrança, Paulo M. [UNESP]-
Autor(es): dc.creatorMorabito, Reinaldo-
Data de aceite: dc.date.accessioned2022-08-04T22:03:53Z-
Data de disponibilização: dc.date.available2022-08-04T22:03:53Z-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued2012-08-01-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1007/978-3-642-23424-8_3-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/220110-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/220110-
Descrição: dc.descriptionThis chapter presents a memetic framework for solving the Synchronized and Integrated Two-level Lot Sizing and Scheduling Problem (SITLSP). A set of algorithms from this framework is thoroughly evaluated. The SITLSP is a real-world problem typically found in soft drink plants, but its presence can also be seen in many other multi-level production processes. The SITLSP involves a two-level production process where lot sizing and scheduling decisions have to be made for raw material storage in tanks and soft drink bottling in various production lines. The work presented here extends a previously proposed memetic computing approach that combines a multi-population genetic algorithm with a threshold accepting heuristic. The novelty and its main contribution is the use of tabu search combined with the multi-population genetic algorithm as a method to solve the SITLSP. Two real-world problem sets, both provided by a leading market soft drink company, have been used for the computational experiments. The results show that the memetic algorithms proposed significantly outperform the previously reported solutions used for comparison.-
Descrição: dc.descriptionInstitute of Mathematics and Computer Science University of Sao Paulo, Av. Trabalhador Sao-Carlense, 400-
Descrição: dc.descriptionDepartment of Computer Science University of Lavras, C.P. 3037-
Descrição: dc.descriptionDepartment of Mathematics Statistics and Computing UNESP, C.P. 266-
Descrição: dc.descriptionProduction Engineering Department Federal University of Sao Carlos, C.P. 676-
Descrição: dc.descriptionDepartment of Mathematics Statistics and Computing UNESP, C.P. 266-
Formato: dc.format59-93-
Idioma: dc.languageen-
Relação: dc.relationVariants of Evolutionary Algorithms for Real-World Applications-
???dc.source???: dc.sourceScopus-
Título: dc.titleA memetic framework for solving the lot sizing and scheduling problem in soft drink plants-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.