A simulated annealing algorithm with neighbourhood list for capacitated dynamic lot-sizing problem with returns and hybrid products

ABSTRACT This research addresses the capacitated dynamic lot-sizing problem with returns and hybrid products (). The problem is to identify how many of each product type to produce during each period for a hybrid system with manufacturing capacity constraints. The objective of is to maximise total profit of the production system that consists of new, remanufactured and hybrid products. is a multi-period CLSP, which is modelled as a mixed-integer nonlinear programming problem. The traditional CLSP is NP-hard, and the nonlinearity of makes the problem even harder to solve. Therefore, a Simulated Annealing (SA) algorithm with a neighbourhood list (SA_NL) is proposed. By using a list of several neighbourhoods, the SA algorithm is improved. SA_NL is compared to SA, three variants of Genetic Algorithm (GA) and a Variable Neighbourhood Search (VNS) algorithm. The variants of GA are GA with one-point crossover (), GA with two-point crossover () and GA with one-point period-based crossover (). Over all instances, the results show that the proposed SA_NL outperforms SA, VNS, , and by 0.54%, 0.34%, 1.92%, 1.78% and 2.92%, respectively.

[1]  Knut Richter,et al.  Remanufacturing planning for the reverse Wagner/Whitin models , 2000, Eur. J. Oper. Res..

[2]  Linet Özdamar,et al.  The capacitated lot sizing problem with overtime decisions and setup times , 2000 .

[3]  Tobias Schulz,et al.  A new Silver–Meal based heuristic for the single-item dynamic lot sizing problem with returns and remanufacturing , 2011 .

[4]  Elif Akçali,et al.  Quantitative models for inventory and production planning in closed-loop supply chains , 2011 .

[5]  Zuo-Jun Max Shen,et al.  Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions , 2011, Eur. J. Oper. Res..

[6]  Robert U. Ayres,et al.  The Impact of Remanufacturing in the Economy , 2000 .

[7]  Linet Özdamar,et al.  Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions , 1998, Eur. J. Oper. Res..

[8]  L Özdamar,et al.  Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem , 1999, J. Oper. Res. Soc..

[9]  F. Sahling.  A Column-Generation Approach for a Short-Term Production Planning Problem in Closed-Loop Supply Chains , 2013 .

[10]  Nesim K. Erkip,et al.  Assessing the benefits of remanufacturing option under one-way substitution and capacity constraint , 2003, Comput. Oper. Res..

[11]  K. Hindi.  Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search , 1995 .

[12]  N. Mladenović,et al.  Variable neighborhood search for the economic lot sizing problem with product returns and recovery , 2015 .

[13]  Kevin J. Gaudette,et al.  Remanufacturing: The next great opportunity for boosting US productivity , 2003 .

[14]  K. Richter,et al.  The reverse Wagner/Whitin model with variable manufacturing and remanufacturing cost , 2001 .

[15]  Ruud H. Teunter,et al.  Dynamic lot sizing with product returns and remanufacturing , 2006 .

[16]  Ben A. Chaouch,et al.  A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing , 2014 .

[17]  Angelo Sifaleras,et al.  Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems , 2017, Comput. Oper. Res..

[18]  Walid Abdul-Kader,et al.  A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery , 2014, Comput. Oper. Res..

[19]  Jian Yang,et al.  Economic Lot-Sizing with Remanufacturing Options , 2001 .

[20]  R. Srivastava,et al.  Production planning and control for remanufacturing: a state - of - the - art survey , 1999 .

[21]  Yongjian Li,et al.  Heuristic genetic algorithm for capacitated production planning problems with batch processing and remanufacturing , 2007 .

[22]  Omar Viera,et al.  The economic lot-sizing problem with remanufacturing and one-way substitution , 2010 .

[23]  Jiafu Tang,et al.  Capacitated dynamic lot sizing problems in closed-loop supply chain , 2009, Eur. J. Oper. Res..

[24]  Horst Tempelmeier,et al.  Linear programming models for a stochastic dynamic capacitated lot sizing problem , 2015, Comput. Oper. Res..

[25]  Matthew J. Saltzman,et al.  Statistical Analysis of Computational Tests of Algorithms and Heuristics , 2000, INFORMS J. Comput..

[26]  Daniel W. Steeneck,et al.  Pricing and production planning for reverse supply chain: a review , 2013 .

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

[28]  Angelo Sifaleras,et al.  On multi-item economic lot-sizing with remanufacturing and uncapacitated production , 2017 .

[29]  E. Runca,et al.  Computation of long-term average SO2 concentration in the Venetian area , 1976 .

[30]  Geraldo Ferrer,et al.  MATERIAL PLANNING FOR A REMANUFACTURING FACILITY , 2001 .