A variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems

In this paper, an effective approach based on the variable neighborhood search (VNS) algorithm is presented to solve the uncapacitated multilevel lot-sizing (MLLS) problems with component commonality and multiple end-items. A neighborhood structure for the MLLS problem is defined, and two kinds of solution move policies, i.e., move at first improvement (MAFI) and move at best improvement (MABI), are used in the algorithm. A new rule called Setup shifting is developed to conduct a more efficient neighborhood search for the MLLS problems. Computational studies are carried out on two sets of benchmark problems. The experimental results show that the VNS algorithm is capable of solving MLLS problems with good optimality and high computational efficiency as well, outperforming most of the existing algorithms in comparison.

[1]  Robert Millen,et al.  An evaluation of heuristic performance in multi-stage lot-sizing systems , 1985 .

[2]  E. Pratsini,et al.  The capacitated dynamic lot size problem with variable technology , 2000 .

[3]  H. Albert Napier,et al.  Optimal Multi-Level Lot Sizing for Requirements Planning Systems , 1980 .

[4]  Saïd Salhi,et al.  A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem , 2009, Eur. J. Oper. Res..

[5]  Ali Akgunduz,et al.  A comparative study of heuristic algorithms on Economic Lot Scheduling Problem , 2008, Comput. Ind. Eng..

[6]  Ou Tang,et al.  Simulated annealing in lot sizing problems , 2004 .

[7]  Jully Jeunet,et al.  Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm , 2000 .

[8]  Christian Almeder,et al.  A hybrid optimization approach for multi-level capacitated lot-sizing problems , 2010, Eur. J. Oper. Res..

[9]  Mark A. McKnew,et al.  An Improved Heuristic for Multilevel Lot Sizing in Material Requirements Planning , 1991 .

[10]  Richard F. Hartl,et al.  A MAX-MIN ant system for unconstrained multi-level lot-sizing problems , 2007, Comput. Oper. Res..

[11]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[12]  M. Ioualalen,et al.  Les Symétries dans les Réseaux de Petri Stochastiques (RdPS) Construction du Graphe Symbolique , 2000, RAIRO Oper. Res..

[13]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[14]  Nicolas Jonard,et al.  A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs , 2000 .

[15]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[16]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[17]  Ping Chen,et al.  Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem , 2010, Expert Syst. Appl..

[18]  M. H. Wagner,et al.  Dynamic Lot Size Models for Multi-Stage Assembly Systems , 1973 .

[19]  Joseph D. Blackburn,et al.  Improved heuristics for multistage requirements planning systems , 1982 .

[20]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[21]  Ikou Kaku,et al.  Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight , 2009, Comput. Math. Appl..

[22]  Emre A. Veral,et al.  THE PERFORMANCE OF A SIMPLE INCREMENTAL LOT‐SIZING RULE IN A MULTILEVEL INVENTORY ENVIRONMENT , 1985 .

[23]  Chunhui Xu,et al.  Solving Large Multilevel Lot-Sizing Problems with an Effective Heuristic Algorithm Based on Segmentation , 2008, 2008 3rd International Conference on Innovative Computing Information and Control.

[24]  Louis E. Yelle.  Materials requirements lot sizing: a multi-level approach , 1979 .

[25]  U. Karmarkar,et al.  Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems , 1984 .

[26]  Bezalel Gavish,et al.  Optimal Lot-Sizing Algorithms for Complex Product Structures , 1986, Oper. Res..

[27]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[28]  Jafar Fathali,et al.  Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases , 2006, Eur. J. Oper. Res..

[29]  W. C. Benton,et al.  PRODUCT STRUCTURE COMPLEXITY AND MULTILEVEL LOT SIZING USING ALTERNATIVE COSTING POLICIES , 1985 .

[30]  Jörg Homberger,et al.  A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem , 2008, INFORMS J. Comput..