A hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem

The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the costs, demands and capacity of resources vary during the time. The goal is to determine the economical lot size value of each product in each period, so that besides fulfilling all the needs of customers, the total cost of the system is minimized. To evaluate the performance of the proposed algorithm, an example is used and the results are compared other algorithms such as: Tabu search (TS), simulated annealing (SA), and genetic algorithm (GA). The results are also compared with the exact solution obtained from the Lagrangian relaxation method. The computational results indicate that the efficiency of the proposed method in comparison to other meta-heuristics.

[1]  Yongpei Guan,et al.  On formulations of the stochastic uncapacitated lot-sizing problem , 2006, Oper. Res. Lett..

[2]  Shanlin Yang,et al.  A finite horizon lot-sizing problem with time-varying deterministic demand and waiting-time-dependent partial backlogging , 2004 .

[3]  Kai Huang,et al.  On stochastic lot-sizing problems with random lead times , 2008, Oper. Res. Lett..

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

[5]  Suresh Chand,et al.  The single-item lot-sizing problem with immediate lost sales , 2003, Eur. J. Oper. Res..

[6]  Safia Kedad-Sidhoum,et al.  The multi-item capacitated lot-sizing problem with setup times and shortage costs , 2008, Eur. J. Oper. Res..

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

[8]  Arunachalam Narayanan,et al.  Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms , 2009 .

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

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

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

[12]  Diwakar Gupta,et al.  The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times , 2005, Comput. Oper. Res..

[13]  Mehmet Emin Aydin,et al.  Heuristic-based neural networks for stochastic dynamic lot sizing problem , 2013, Appl. Soft Comput..

[14]  Maw-Sheng Chern,et al.  Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand , 1999, Oper. Res. Lett..

[15]  Claudio Fabiano Motta Toledo,et al.  A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging , 2013, Comput. Oper. Res..

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

[17]  Zeger Degraeve,et al.  Improved lower bounds for the capacitated lot sizing problem with setup times , 2004, Oper. Res. Lett..

[18]  Ozden Ustun,et al.  An integrated multi-objective decision-making process for multi-period lot-sizing with supplier selection , 2008 .

[19]  J. Rezaei,et al.  Multi-objective models for lot-sizing with supplier selection , 2011 .

[20]  Stéphane Dauzère-Pérès,et al.  Hammamet -tunisia " Evaluation and Optimization of Innovative Production Systems of Goods and Services " Heuristics for the Multi-item Capacitated Lot-sizing Problem with Lost Sales , 2022 .

[21]  Leyuan Shi,et al.  An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging , 2011, Eur. J. Oper. Res..

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

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

[24]  Marc Lambrecht,et al.  Review of optimal and heuristic methods for a class of facilities in series dynamic lot-size problems , 1981 .

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

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

[27]  Ikou Kaku,et al.  A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems , 2011, Eur. J. Oper. Res..

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

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

[30]  S. T. Enns,et al.  Multi-product capacity-constrained lot sizing with economic objectives , 2004 .

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

[32]  Laurence A. Wolsey,et al.  Progress With Single-item Lot-sizing , 1995 .

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

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

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

[36]  Moshe Friedman,et al.  A Study of the infinite horizon 'solution' of inventory lot size models with a linear demand function , 1978, Comput. Oper. Res..

[37]  Kenneth N. Brown,et al.  An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups , 2009 .

[38]  Sotirios Papachristos,et al.  The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions , 2005, Oper. Res..

[39]  Dong-Ho Lee,et al.  A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs , 2011, Comput. Ind. Eng..

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

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

[42]  S. Dauzere-Peres,et al.  A review of single item lot sizing problems , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[43]  Dong X. Shaw,et al.  Complexity of the ELSP with general cyclic schedules , 1997 .