Advanced search
Start date
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems

Full text
Motta Toledo, Claudio Fabiano [1] ; Arantes, Marcio da Silva [1] ; Bressan Hossomi, Marcelo Yukio [1] ; Franca, Paulo Morelato [2] ; Akartunali, Kerem [3]
Total Authors: 5
[1] Univ Sao Paulo, Inst Math & Comp Sci, BR-13566590 Sao Carlos, SP - Brazil
[2] UNESP, Dept Math & Comp Sci, BR-19060080 Presidente Prudente, SP - Brazil
[3] Univ Strathclyde, Dept Management Sci, Glasgow G1 1QE, Lanark - Scotland
Total Affiliations: 3
Document type: Journal article
Source: Journal of Heuristics; v. 21, n. 5, p. 687-717, OCT 2015.
Web of Science Citations: 13

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. (AU)

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
FAPESP's process: 11/15581-3 - Environment for development of methods applied to optimization problems
Grantee:Márcio da Silva Arantes
Support Opportunities: Scholarships in Brazil - Master
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