Application of genetic algorithm for the set-covering problem solution
The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveyer lines designing is considered. The paper objecti...
Saved in:
| Main Authors: | Igor S. Konovalov, Vladimir A. Fatkhi, Valery G. Kobak |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Don State Technical University
2016-09-01
|
| Series: | Advanced Engineering Research |
| Subjects: | |
| Online Access: | https://www.vestnik-donstu.ru/jour/article/view/106 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficiency comparison of exact and approximate algorithms for solving set covering problem
by: Igor S. Konovalov, et al.
Published: (2017-10-01) -
Applicability of elite samples in solving the traveling salesman problem by Goldberg model
by: Valery G. Kobak, et al.
Published: (2016-06-01) -
Оптимизация параметров полиномиального рандомизированного алгоритма для асимметричной задачи коммивояжера
by: Максим Сергеевич Баркетов
Published: (2024-07-01) -
Задача формування зон відповідальності на множині об’єктів площини за критерієм мінімізації різниці сумарних ваг
by: О. Жданова, et al.
Published: (2024-03-01) -
Bionic search for transportation problem solution on the basis of adaptation strategy
by: Yury Olegovich Chernyshev, et al.
Published: (2015-06-01)