A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing
https://doi.org/10.21202/1993-047X.14.2020.1.1.174-185
EDN: VQZPFJ
Abstract
Objective: to implement the neighborhood descent heuristic approach into solving the lot-sizing problem.Methods: a variable neighborhood descent heuristic approach and a framework of lot-sizing problem.Results: dynamic lot-sizing problem is supposed to be an NP-hard problem - a problem for which there is no known polynomial algorithm, so the time to find a solution grows with a problem size. In the article, we explain the basic lot-sizing, lot-sizing in closed-loop, describe methods used by other researchers, and provide reasoning for using a variable neighborhood descent heuristic method. Implementation of the method is presented in a numerical example. Application of the method significantly reduces estimation time when searching for lot-sizing problem solution. Application of the method significantly reduces estimation time when searching for lot-sizing problem solution.Scientific novelty: the method may significantly reduce time expenses during the solution of the lot-sizing problem. Practical significance: the method may be implemented for solving the lot-sizing problem in various industries, such as pulp and paper, consumer goods industry and heavy industry.
References
1. Perez K., Yossiri M., Raf A., Reinaldo J., Eli M., Tosoc A. An exact optimization approach for an integrated process configuration, lot-sizing, and scheduling problem, Computers & Operations Research, 2019, March, No. 103, pp. 310-323.
2. Li Y., Chen J., Cai X. Uncapacitated production planning with multiple product types, returned product remanufacturing, and demand substitution, OR Spectrum, 2006, No. 28, pp. 101-125.
3. Sahling. A column-generation approach for a short-term production planning problem in closed-loop supply chains, Business Research, 2013, No. 6, pp. 55-75.
4. Figueira G., Santos M. O., Almada-Lobo B. A hybrid VNS approach for the short-term production planning and scheduling: A case study in the pulp and paper industry, Computers & Operations Research, 2013, No. 40, pp. 1804-1818.
5. Sifaleras A., Konstantaras I. Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot- sizing problems, Computers & Operations Research, 2017, No. 78, pp. 385-392.
6. Wagner H., Whitin T. Dynamic Version of the Economic Lot Size Model, Management Science, 1958, Vol. 5, No. 1, pp. 89-96.
7. Li Y., Chen J., Cai X. Heuristic genetic algorithm for capacitated production planning problems with batch processing and remanufacturing, International Journal of Production Economics, 2007, No. 105, pp. 301-317.
8. Koken, Seok, Yoon. A simulated annealing algorithm with neighbourhood list for capacitated dynamic lot-sizing problem with returns and hybrid products, International Journal of Computer Integrated Manufacturing, 2018, Vol. 31, No. 8, pp. 739-747.
9. Mladenović N. A variable neighborhood algorithm - a new metaheuristic for combinatorial optimization. Abstracts of Papers Presented at Optimization Days, Montréal, 1995.
10. Brandimarte P. Multi-item capacitated lot-sizing with demand uncertainty, International Journal of Production Research, 2006, Vol. 44, No. 15, pp. 2997-3022.
11. Macedo P., Douglas A., Santos А. Hybrid manufacturing and remanufacturing lot-sizing problem with stochastic demand, return, and setup costs, International Journal of Advanced Manufacturing Technology, 2015, Vol. 82, No. 5.
12. Alfares H., Turnadi R. Lot sizing and supplier selection with multiple items, multiple periods, quantity discounts, and backordering, Computers & Industrial Engineering, 2018, February, pp. 59-71.
13. Shekarabi S., Gharaei A., Karimi M. Modelling and optimal lot-sizing of integrated multi-level multi-wholesaler supply chains under the shortage and limited warehouse space: generalised outer approximation, International Journal of Systems Science: Operations & Logistics, 2019, Vol. 6, Is. 3, pp. 237-257. DOI: https://doi.org/10.1080/23302674.2018.1435835
14. Zhou S., Zhou Y., Zuo X., Xiao Y., Cheng Y. Modeling and solving the constrained multi-items lot-sizing problem with time- varying setup cost, Chaos, Solitons & Fractals, 2018, November, pp. 202-207. DOI: https://doi.org/10.1016/j.chaos.2018.09.012
15. Güner Gören, H., Tunali, S. Fix-and-optimize heuristics for capacitated lot sizing with setup carryover and backordering, Journal of Enterprise Information Management, Vol. 31, No. 6, 2018, pp. 879-890.
Review
For citations:
Poliakova I.Yu. A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing. Actual Problems of Economics and Law. 2020;14(1):174-185. (In Russ.) https://doi.org/10.21202/1993-047X.14.2020.1.1.174-185. EDN: VQZPFJ
Views:
225
Email this article 
