Geodesic
Variable Neighborhood Formulation Search Approach for the Multi-Item Capacitated Lot-Sizing Problem With Time Windows and Setup Times
Yugoslav journal of operations research, Tome 27 (2017) no. 3, p. 301 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

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.
Classification : 90B06, 90C05, 90C08
Keywords: Production Planning, Multi-item lot-sizing, Variable Neighborhood Search, Formulation Space Search, Matheuristic 
@article{YJOR_2017_27_3_a2,
     author = {Ridha Erromdhani and Bassem Jarboui and Mansour Eddaly and Abdelwaheb Rebai and Nenad Mladenovi\'c},
     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},
     pages = {301 },
     publisher = {mathdoc},
     volume = {27},
     number = {3},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a2/}
}
TY  - JOUR
AU  - Ridha Erromdhani
AU  - Bassem Jarboui
AU  - Mansour Eddaly
AU  - Abdelwaheb Rebai
AU  - Nenad Mladenović
TI  - Variable Neighborhood Formulation Search Approach for the Multi-Item Capacitated Lot-Sizing Problem With Time Windows and Setup Times
JO  - Yugoslav journal of operations research
PY  - 2017
SP  - 301 
VL  - 27
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a2/
LA  - en
ID  - YJOR_2017_27_3_a2
ER  - 
%0 Journal Article
%A Ridha Erromdhani
%A Bassem Jarboui
%A Mansour Eddaly
%A Abdelwaheb Rebai
%A Nenad Mladenović
%T Variable Neighborhood Formulation Search Approach for the Multi-Item Capacitated Lot-Sizing Problem With Time Windows and Setup Times
%J Yugoslav journal of operations research
%D 2017
%P 301 
%V 27
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a2/
%G en
%F YJOR_2017_27_3_a2
Ridha Erromdhani; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebai; Nenad Mladenović. Variable Neighborhood Formulation Search Approach for the Multi-Item Capacitated Lot-Sizing Problem With Time Windows and Setup Times. Yugoslav journal of operations research, Tome 27 (2017) no. 3, p. 301 . http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a2/