The algorithm on base of Nelder–Mead modified method and genetic algorithm for strip packing problem
In this paper NP complete strip packing problem is analyzed. New heuristic algorithm on the base of modified Nelder–Mead method, genetic and linear programming algorithms for strip packing problem was proposed. Experiments on the well known tests show that this algorithm has certain advantages. Pros...
Main Authors: | Sergey A. Martishin, Marina V. Khrapchenko |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/1070 |
Similar Items
-
Probabilistic analysis a algorithm for strip packing
by: N. N. Kuzjurin, et al.
Published: (2018-10-01) -
Object-oriented constraint-based programming: a new paradigm using declarative data modeling languages
by: V. A. Semenov, et al.
Published: (2018-10-01) -
ОПЫТ ПРИМЕНЕНИЯ ГРАНУЛОМЕТРИЧЕСКОГО АНАЛИЗА ДЛЯ РЕКОНСТРУКЦИИ УСЛОВИЙ ФОРМИРОВАНИЯ ПЕСЧАНИКОВ ПРОДУКТИВНЫХ ПЛАСТОВ ВАСЮГАНСКОГО ГОРИЗОНТА (ЗАПАДНАЯ СИБИРЬ)
Published: (2019-02-01) -
Генетические типы карбонатных псефитолитов нижнего палеозоя севера Урала: II. Типы, модели и особенности формирования
Published: (2019-02-01) -
On one problem of Koffman-Shor connected to strip packing problem
by: M. A. Trushnikov
Published: (2018-10-01)