|Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
|Yugoslav Journal of Operations Research
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.
|Formulation space search | Matheuristic | Multi-item lot-sizing | Production planning | Variable neighborhood search
|Faculty of Organizational Sciences, University of Belgrade
Show full item record
checked on Feb 29, 2024
checked on Mar 5, 2024
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.