To obtain access to full text of journal and articles you must register!
- Article name
- DEVELOPMENT AND THE ANALYSIS OF THE APPROACHED METHODS OF THE DECISION OPTIMIZATION TASKS SKIVING STOCK PROBLEM
- Authors
- Zabelin S. L., , zabelinsl@mail.ru, Siberian State University Telecommunication and Informatics, Novosibirsk, Russia
Frolovsky V. D., , vdfrolovsky@yandex.ru, Siberian State University Telecommunication and Informatics, Novosibirsk, Russia
- Keywords
- cutting and packing / Skiving Stock problem / NP-Completeness problem / random algorithm / bionic algorithm / genetic algorithm / ant colony algorithm
- Year
- 2011 Issue 3 Pages 54 - 58
- Code EDN
- Code DOI
- Abstract
- Skiving Stock Problem is a special case of "cutting and packing" problems. In set covering problem small items must be combined to cover larger object without any holes. It isn't passable to solve these problems with exhaustive search because of belonging them to NP-Completeness problems. Also there are no any exact algorithms to solve this problem. In this article some bionic algorithms are considered. There are optimization algorithm, genetic algorithm, adaptive genetic algorithm and ant colony optimization. Efficiency of bionic and traditional algorithms is compared. These algorithms were analyzed and it was adjudged that best results are given with ant colony optimization and adaptive genetic algorithm. Their settings are comparatively simple, but it's required longer time to solve Skiving Stock Problem with these algorithms.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
