ДОСЛІДЖЕННЯ АЛГОРИТМІВ ВИБОРУ СУСІДСТВА ДЛЯ НЕОРІЄНТОВАНОГО ГИЛЬОТИННОГО РОЗКРОЮ
Keywords:
гільотинний розкрій, сулідство елементів, next fit decreasing high, first fit decreasing hig, щільність упаковкиAbstract
Проведено дослідження алгоритмів вибору сусідства для неорієнтованого гильотинного розкрою з метою визначення їхньої ефективності.
References
1. B.S. Baker, D.J. Brown, and H.P. Katseff. A 5/4 algorithm for two-dimensional packing. Journal of Algorithms, 2:348--368, 1981.
2. J.O. Berkey and P.Y. Wong. Two dimensional finite bin packing algorithms. Journal of Operational Research Society, 2:423--429, 1987.
3. A. Lodi and S. Martello and D. Vigo. Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. In S. Voss and S. Martello and I.H. Osman and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for optimization, pages 125--139. Kluwer Academic Publishers, Boston, 1998.
4. A. Lodi and S. Martello and D. Vigo. Approximation algorithms for the oriented two-dimensional bin packing problem.Journal of Operational Research Society, 112:158--166, 1999.
5. A. Lodi and S. Martello and D. Vigo. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11:345--357, 1999.
6. I. Schiermeyer. Reverse-fit: A 2-optimal algorithm for packing rectangles. In Proceedings of 2nd European Symposium on Algorithms, pages 290--299, Utrecht, The Netherlands, August 1994.
7. A. Steinberg A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 9:401--409, 1997.
2. J.O. Berkey and P.Y. Wong. Two dimensional finite bin packing algorithms. Journal of Operational Research Society, 2:423--429, 1987.
3. A. Lodi and S. Martello and D. Vigo. Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. In S. Voss and S. Martello and I.H. Osman and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for optimization, pages 125--139. Kluwer Academic Publishers, Boston, 1998.
4. A. Lodi and S. Martello and D. Vigo. Approximation algorithms for the oriented two-dimensional bin packing problem.Journal of Operational Research Society, 112:158--166, 1999.
5. A. Lodi and S. Martello and D. Vigo. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11:345--357, 1999.
6. I. Schiermeyer. Reverse-fit: A 2-optimal algorithm for packing rectangles. In Proceedings of 2nd European Symposium on Algorithms, pages 290--299, Utrecht, The Netherlands, August 1994.
7. A. Steinberg A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 9:401--409, 1997.
Downloads
Published
2020-05-04
Issue
Section
Статьи
