VARIABLE NEIGHBORHOOD FORMULATION SEARCH APPROACH FOR THE MULTI-ITEM CAPACITATED LOT-SIZING PROBLEM WITH TIME WINDOWS AND SETUP TIMES
In this paper we suggest a new variant of Variable neighborhood search de-signed 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 lot sizing problem with production time windows and setup times, under the non-customer speciﬁc 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 dierent mathematical programming formulations of the problem. The computational experiments show that our approach is more eective and ecient when compared with the existing methods from the literature.
Keywords: Production Planning, Multi-item lot-sizing, Variable Neighborhood Search, Formulation Space Search, Matheuristic.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.