A scatter search approach for uncapacitated multilevel lot-sizing problems

The multilevel lot-sizing (MLLS) problem is a key production planning prob- lem in material requirements planning (MRP) systems. The MLLS problem deals with determining the production lot sizes of various items appearing in the product structure over a given nite planning horizon to minimize the production cost, the inventory car- rying cost and the backordering cost. In this paper, a new evolutionary technique called scatter search (SS) is adopted to solve uncapacitated MLLS problems since SS is able to provide a wide exploration of the search space through intensication and diversication. Experiments are conducted to test the performance of SS by using 146 benchmark in- stances, of which there are 96 small size problems, 40 medium size problems and 10 large size problems. Comparison analysis of the SS approach with other classical heuristics and algorithms in the literature is presented. Simulation results showed that, for small-sized testing problems, SS performs the best by achieving 94 optimums out of 96 instances; for medium-sized problems, SS still shows its adaptation by nding 7 best known solutions (BKS) and 33 near-BKS solutions with small deviation; for large-sized problems, SS seems not very optimistic compared with genetic algorithm (GA) and ant systems (AS), but it still remains competitive and makes a large improvement on the initial solutions provided by Wagner-Whitin algorithm (WW) in the acceptable average runtime. Keywords: Scatter search approach, Multilevel lot-sizing, Genetic algorithms, Ant sys- tems, Material requirements planning, Metaheuristic

[1]  Vinícius Amaral Armentano,et al.  Scatter search for project scheduling with resource availability cost , 2006, Eur. J. Oper. Res..

[2]  Vinicius Amaral Armentano,et al.  A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times , 1995 .

[3]  Laurence A. Wolsey,et al.  bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems , 2000 .

[4]  A. Haq,et al.  A scatter search approach for general flowshop scheduling problem , 2006 .

[5]  L. J. Thomas,et al.  Heuristics for multilevel lot-sizing with a bottleneck , 1986 .

[6]  Luk N. Van Wassenhove,et al.  Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review , 1988 .

[7]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[8]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[9]  Richard F. Hartl,et al.  Combining population-based and exact methods for multi-level capacitated lot-sizing problems , 2006 .

[10]  Yaakov Roll,et al.  Multi-item, multi-level lot sizing with an aggregate capacity constraint , 1991 .

[11]  P. Afentakis.  A Parallel Heuristic Algorithm for Lot-Sizing in Multistage Production Systems , 1987 .

[12]  Ángel Corberán,et al.  Scatter search , 2003 .

[13]  Marc Salomon,et al.  LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS , 1993 .

[14]  Nicolas Jonard,et al.  Single-point stochastic search algorithms for the multi-level lot-sizing problem , 2005, Comput. Oper. Res..

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

[16]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[17]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

[18]  Zeger Degraeve,et al.  Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches , 2004, Eur. J. Oper. Res..

[19]  Kaj Rosling,et al.  Optimal Lot-Sizing for Dynamic Assembly Systems , 1986 .

[20]  Jinxing Xie,et al.  Heuristic genetic algorithms for general capacitated lot-sizing problems☆ , 2002 .

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

[22]  David F. Pyke,et al.  Inventory management and production planning and scheduling , 1998 .

[23]  Stefan Helber,et al.  Lot sizing in capacitated production planning and control systems , 1995 .

[24]  Belarmino Adenso-Díaz,et al.  A scatter search approach to the optimum disassembly sequence problem , 2006, Comput. Oper. Res..

[25]  Rafael Martí,et al.  Scatter Search - Wellsprings and Challenges , 2006, Eur. J. Oper. Res..

[26]  H. Tempelmeier,et al.  A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times , 1996 .

[27]  Minoru Fukumi,et al.  DETECTION AND RECOGNITION OF VEHICLE LICENSE PLATES USING TEMPLATE MATCHING, GENETIC ALGORITHMS AND NEURAL NETWORKS , 2009 .

[28]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[29]  Yash P. Gupta,et al.  A Review of Multi‐stage Lot‐sizing Models , 1990 .

[30]  Jully Jeunet,et al.  Randomized multi-level lot-sizing heuristics for general product structures , 2003, Eur. J. Oper. Res..

[31]  Alf Kimms,et al.  A genetic algorithm for multi-level, multi-machine lot sizing and scheduling , 1999, Comput. Oper. Res..

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

[33]  L. V. Wassenhove,et al.  Multilevel capacitated lotsizing complexity and LP-based heuristics , 1991 .

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

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

[36]  Ping Ji,et al.  AN EMPIRICAL STUDY OF A PURE GENETIC ALGORITHM TO SOLVE THE CAPACITATED VEHICLE ROUTING PROBLEM , 2008 .

[37]  Yingjie Wang.  FUZZY CLUSTERING ANALYSIS BY USING GENETIC ALGORITHM , 2008 .

[38]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[39]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[40]  Regina Berretta,et al.  A memetic algorithm for a multistage capacitated lot-sizing problem , 2004 .

[41]  Chang Jui-Fang.  A PERFORMANCE COMPARISON BETWEEN GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZATION APPLIED IN CONSTRUCTING EQUITY PORTFOLIOS , 2009 .

[42]  Linet Özdamar,et al.  An integrated Lagrangean relaxation-simulated annealing approach to the multi-level multi-item capacitated lot sizing problem , 2000 .

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