Authors: Erromdhani, Ridha
Jarboui, Bassem
Eddaly, Mansour
Rebai, Abdelwaheb
Mladenović, Nenad 
Title: Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
Journal: Yugoslav Journal of Operations Research
Volume: 27
Issue: 3
First page: 301
Last page: 322
Issue Date: 21-Sep-2017
Rank: M51
ISSN: 03540243
DOI: 10.2298/YJOR160417017E
In this paper we suggest a new variant of Variable neighborhood search designed for solving Mixed integer programming problems. We call it Variable neighborhood formulation search (VNFS), since both neighborhoods and formulations are changed during the search. VNS deals with integer variables, while an available (commercial) solver is responsible for continues variables and the objective function value. We address the multi-item capacitated lotsizing problem with production time windows and setup times, under the non-customer specific case. This problem is known to be NP-hard and can be formulated as a mixed 0-1 program. Neighborhoods are induced from the Hamming distance in 0-1 variables, while the objective function values in the corresponding neighborhoods are evaluated using different mathematical programming formulations of the problem. The computational experiments show that our approach is more effective and efficient when compared with the existing methods from the literature.
Keywords: Formulation space search | Matheuristic | Multi-item lot-sizing | Production planning | Variable neighborhood search
Publisher: Faculty of Organizational Sciences, University of Belgrade

Show full item record


checked on May 23, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.