To obtain access to full text of journal and articles you must register!
- Article name
- BRANCH AND BOUND ALGORITHM APPLICATION FOR SOLVING THE INTEGRATED NESTING AND ROUTING PROBLEM FOR RECTANGULAR PARTS
- Authors
- Tavaeva A. F., , tavaeva_a_f@bk.ru, Ural Federal University, Yekaterinburg, Russia
Katz Е. I., , e.i.katc@urfu.ru, Ural Federal University, Yekaterinburg, Russia
- Keywords
- integrated nesting and routing problem / tool path / idling path / idling path minimization / branch bound algorithm / common cut / multi-contour cutting
- Year
- 2026 Issue 1 Pages 42 - 46
- Code EDN
- RIQYBM
- Code DOI
- 10.52190/2073-2597_2026_1_42
- Abstract
- The adaptive branch and bound algorithm for solving the Integrated Nesting and Routing Problem is developed. The case of multi-contour cutting with common cut application for rectangle parts is considered in this article. The realization examples on C++ are presented. The numerical experiments and comparative analysis of adaptive branch and bound algorithm and Greedy algorithm are given in this article.
- Text
- BUY for read the full text of article
- Buy
- 500.00 rub
