A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing
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 the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tatar Educational Center “Taglimat” Ltd.
2020-03-01
|
| Series: | Russian Journal of Economics and Law |
| Subjects: | |
| Online Access: | https://www.rusjel.ru/jour/article/view/135 |
| _version_ | 1797255895642537984 |
|---|---|
| author | I. Yu. Poliakova |
| author_facet | I. Yu. Poliakova |
| author_sort | I. Yu. Poliakova |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-08T23:14:51Z |
| format | Article |
| id | doaj.art-dd4d42e0ad384906af772d59759ea8fe |
| institution | Directory Open Access Journal |
| issn | 2782-2923 |
| language | English |
| last_indexed | 2024-04-24T22:13:07Z |
| publishDate | 2020-03-01 |
| publisher | Tatar Educational Center “Taglimat” Ltd. |
| record_format | Article |
| series | Russian Journal of Economics and Law |
| spelling | doaj.art-dd4d42e0ad384906af772d59759ea8fe2024-03-20T08:16:52ZengTatar Educational Center “Taglimat” Ltd.Russian Journal of Economics and Law2782-29232020-03-0114117418510.21202/1993-047X.14.2020.1.1.174-185134A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturingI. Yu. Poliakova0Saint-Petersburg State UniversityObjective: 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.https://www.rusjel.ru/jour/article/view/135neighborhood descentlot-sizing problemremanufacturingmulti-item lot-sizingheuristic approachclosed-loopreverse logistics |
| spellingShingle | I. Yu. Poliakova A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing Russian Journal of Economics and Law neighborhood descent lot-sizing problem remanufacturing multi-item lot-sizing heuristic approach closed-loop reverse logistics |
| title | A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing |
| title_full | A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing |
| title_fullStr | A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing |
| title_full_unstemmed | A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing |
| title_short | A variable neighborhood descent heuristic for a multi-item lot-sizing problem with remanufacturing |
| title_sort | variable neighborhood descent heuristic for a multi item lot sizing problem with remanufacturing |
| topic | neighborhood descent lot-sizing problem remanufacturing multi-item lot-sizing heuristic approach closed-loop reverse logistics |
| url | https://www.rusjel.ru/jour/article/view/135 |
| work_keys_str_mv | AT iyupoliakova avariableneighborhooddescentheuristicforamultiitemlotsizingproblemwithremanufacturing AT iyupoliakova variableneighborhooddescentheuristicforamultiitemlotsizingproblemwithremanufacturing |