A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1007/s10732-015-9295-0 http://hdl.handle.net/11449/168046 |
Resumo: | In this paper, we propose a simple but efficient heuristic that combines construction and improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic is firstly used to build an initial solution, and this is further improved by applying a fix-and-optimize heuristic. We also introduce a novel way to define the mixed-integer subproblems solved by both heuristics. The efficiency of the approach is evaluated solving two different classes of multi-level lot-sizing problems: the multi-level capacitated lot-sizing problem with backlogging and the two-stage glass container production scheduling problem (TGCPSP). We present extensive computational results including four test sets of the Multi-item Lot-Sizing with Backlogging library, and real-world test problems defined for the TGCPSP, where we benchmark against state-of-the-art methods from the recent literature. The computational results show that our combined heuristic approach is very efficient and competitive, outperforming benchmark methods for most of the test problems. |
id |
UNSP_5456bc2436347bffe8d1ae14338486ee |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/168046 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problemsBackloggingFix-and-optimizeHeuristicsLot-sizingRelax-and-fixIn this paper, we propose a simple but efficient heuristic that combines construction and improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic is firstly used to build an initial solution, and this is further improved by applying a fix-and-optimize heuristic. We also introduce a novel way to define the mixed-integer subproblems solved by both heuristics. The efficiency of the approach is evaluated solving two different classes of multi-level lot-sizing problems: the multi-level capacitated lot-sizing problem with backlogging and the two-stage glass container production scheduling problem (TGCPSP). We present extensive computational results including four test sets of the Multi-item Lot-Sizing with Backlogging library, and real-world test problems defined for the TGCPSP, where we benchmark against state-of-the-art methods from the recent literature. The computational results show that our combined heuristic approach is very efficient and competitive, outperforming benchmark methods for most of the test problems.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Institute of Mathematics and Computer Science University of São Paulo, Avenida trabalhador são-carlense, 400, CentroDepartment of Mathematics and Computer Science UNESP, R. Roberto Simonsen, 305, CP 266Department of Management Science University of Strathclyde, 40 George StreetDepartment of Mathematics and Computer Science UNESP, R. Roberto Simonsen, 305, CP 266FAPESP: 2010/10133-0FAPESP: 2011/15534-5FAPESP: 2011/15581-3CNPq: 312967/2014-4CNPq: 483474/2013-4Universidade de São Paulo (USP)Universidade Estadual Paulista (Unesp)University of StrathclydeToledo, Claudio Fabiano Mottada Silva Arantes, MárcioHossomi, Marcelo Yukio BressanFrança, Paulo Morelato [UNESP]Akartunalı, Kerem2018-12-11T16:39:22Z2018-12-11T16:39:22Z2015-10-29info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article687-717application/pdfhttp://dx.doi.org/10.1007/s10732-015-9295-0Journal of Heuristics, v. 21, n. 5, p. 687-717, 2015.1572-93971381-1231http://hdl.handle.net/11449/16804610.1007/s10732-015-9295-02-s2.0-849423631442-s2.0-84942363144.pdfScopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengJournal of Heuristics1,0081,008info:eu-repo/semantics/openAccess2023-12-25T06:24:06Zoai:repositorio.unesp.br:11449/168046Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T21:16:59.915492Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems |
title |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems |
spellingShingle |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems Toledo, Claudio Fabiano Motta Backlogging Fix-and-optimize Heuristics Lot-sizing Relax-and-fix |
title_short |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems |
title_full |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems |
title_fullStr |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems |
title_full_unstemmed |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems |
title_sort |
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems |
author |
Toledo, Claudio Fabiano Motta |
author_facet |
Toledo, Claudio Fabiano Motta da Silva Arantes, Márcio Hossomi, Marcelo Yukio Bressan França, Paulo Morelato [UNESP] Akartunalı, Kerem |
author_role |
author |
author2 |
da Silva Arantes, Márcio Hossomi, Marcelo Yukio Bressan França, Paulo Morelato [UNESP] Akartunalı, Kerem |
author2_role |
author author author author |
dc.contributor.none.fl_str_mv |
Universidade de São Paulo (USP) Universidade Estadual Paulista (Unesp) University of Strathclyde |
dc.contributor.author.fl_str_mv |
Toledo, Claudio Fabiano Motta da Silva Arantes, Márcio Hossomi, Marcelo Yukio Bressan França, Paulo Morelato [UNESP] Akartunalı, Kerem |
dc.subject.por.fl_str_mv |
Backlogging Fix-and-optimize Heuristics Lot-sizing Relax-and-fix |
topic |
Backlogging Fix-and-optimize Heuristics Lot-sizing Relax-and-fix |
description |
In this paper, we propose a simple but efficient heuristic that combines construction and improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic is firstly used to build an initial solution, and this is further improved by applying a fix-and-optimize heuristic. We also introduce a novel way to define the mixed-integer subproblems solved by both heuristics. The efficiency of the approach is evaluated solving two different classes of multi-level lot-sizing problems: the multi-level capacitated lot-sizing problem with backlogging and the two-stage glass container production scheduling problem (TGCPSP). We present extensive computational results including four test sets of the Multi-item Lot-Sizing with Backlogging library, and real-world test problems defined for the TGCPSP, where we benchmark against state-of-the-art methods from the recent literature. The computational results show that our combined heuristic approach is very efficient and competitive, outperforming benchmark methods for most of the test problems. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015-10-29 2018-12-11T16:39:22Z 2018-12-11T16:39:22Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1007/s10732-015-9295-0 Journal of Heuristics, v. 21, n. 5, p. 687-717, 2015. 1572-9397 1381-1231 http://hdl.handle.net/11449/168046 10.1007/s10732-015-9295-0 2-s2.0-84942363144 2-s2.0-84942363144.pdf |
url |
http://dx.doi.org/10.1007/s10732-015-9295-0 http://hdl.handle.net/11449/168046 |
identifier_str_mv |
Journal of Heuristics, v. 21, n. 5, p. 687-717, 2015. 1572-9397 1381-1231 10.1007/s10732-015-9295-0 2-s2.0-84942363144 2-s2.0-84942363144.pdf |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Journal of Heuristics 1,008 1,008 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
687-717 application/pdf |
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_ |
1808129304689639424 |