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 lotsizing problem. Methods a variable neighborhood descent heuristic approach and a framework of lotsizing problem. Results dynamic lotsizing problem is supposed to be an NPhard problem ndash a problem...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tatar Educational Center "TAGLIMAT" Ltd.
2020-03-01
|
| Series: | Aktualʹnye Problemy Èkonomiki i Prava |
| Subjects: | |
| Online Access: | http://apel.ieml.ru/storage/archive_articles/9959.pdf |
| Summary: | Objective to implement the neighborhood descent heuristic approach into solving the lotsizing problem.
Methods a variable neighborhood descent heuristic approach and a framework of lotsizing problem.
Results dynamic lotsizing problem is supposed to be an NPhard problem ndash 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 thenbsp basic lotsizing lotsizing in closedloop 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 lotsizing problem solution. Application of the method significantly reduces estimation time when searching for lotsizing problem solution.
Scientific novelty the method may significantly reduce time expenses during the solution of the lotsizing problem.
Practical significance the method may be implemented for solving the lotsizing problem in various industries such as pulp and paper consumer goods industry and heavy industry. |
|---|---|
| ISSN: | 1993-047X 2410-0390 |