A memetic framework for solving the lot sizing and scheduling problem in soft drink plants
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | , , |
Tipo de documento: | Capítulo de livro |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1007/978-3-642-23424-8_3 http://hdl.handle.net/11449/220110 |
Resumo: | This 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. |
id |
UNSP_71df84d8973ac5fb4698da78bdba193b |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/220110 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plantsThis 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.Institute of Mathematics and Computer Science University of Sao Paulo, Av. Trabalhador Sao-Carlense, 400Department of Computer Science University of Lavras, C.P. 3037Department of Mathematics Statistics and Computing UNESP, C.P. 266Production Engineering Department Federal University of Sao Carlos, C.P. 676Department of Mathematics Statistics and Computing UNESP, C.P. 266Universidade de São Paulo (USP)University of LavrasUniversidade Estadual Paulista (UNESP)Universidade Federal de São Carlos (UFSCar)Toledo, Claudio F. M.Arantes, Marcio S.França, Paulo M. [UNESP]Morabito, Reinaldo2022-04-28T18:59:43Z2022-04-28T18:59:43Z2012-08-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bookPart59-93http://dx.doi.org/10.1007/978-3-642-23424-8_3Variants of Evolutionary Algorithms for Real-World Applications, v. 9783642234248, p. 59-93.http://hdl.handle.net/11449/22011010.1007/978-3-642-23424-8_32-s2.0-84897462175Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengVariants of Evolutionary Algorithms for Real-World Applicationsinfo:eu-repo/semantics/openAccess2022-04-28T18:59:43Zoai:repositorio.unesp.br:11449/220110Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-28T18:59:43Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants |
title |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants |
spellingShingle |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants Toledo, Claudio F. M. |
title_short |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants |
title_full |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants |
title_fullStr |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants |
title_full_unstemmed |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants |
title_sort |
A memetic framework for solving the lot sizing and scheduling problem in soft drink plants |
author |
Toledo, Claudio F. M. |
author_facet |
Toledo, Claudio F. M. Arantes, Marcio S. França, Paulo M. [UNESP] Morabito, Reinaldo |
author_role |
author |
author2 |
Arantes, Marcio S. França, Paulo M. [UNESP] Morabito, Reinaldo |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Universidade de São Paulo (USP) University of Lavras Universidade Estadual Paulista (UNESP) Universidade Federal de São Carlos (UFSCar) |
dc.contributor.author.fl_str_mv |
Toledo, Claudio F. M. Arantes, Marcio S. França, Paulo M. [UNESP] Morabito, Reinaldo |
description |
This 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. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012-08-01 2022-04-28T18:59:43Z 2022-04-28T18:59:43Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/bookPart |
format |
bookPart |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1007/978-3-642-23424-8_3 Variants of Evolutionary Algorithms for Real-World Applications, v. 9783642234248, p. 59-93. http://hdl.handle.net/11449/220110 10.1007/978-3-642-23424-8_3 2-s2.0-84897462175 |
url |
http://dx.doi.org/10.1007/978-3-642-23424-8_3 http://hdl.handle.net/11449/220110 |
identifier_str_mv |
Variants of Evolutionary Algorithms for Real-World Applications, v. 9783642234248, p. 59-93. 10.1007/978-3-642-23424-8_3 2-s2.0-84897462175 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Variants of Evolutionary Algorithms for Real-World Applications |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
59-93 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1803046241014120448 |