Comparative electiveness of metaheuristic methods
The essence of metaheuristic methods and conditions of their application are considered, in particular, limited amount of knowledge and availability of some candidate for optimality. The formal statement of the traveling salesman problem and its solution are presented with 4 algorithms: genetic, ann...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
State University “Uzhhorod National University”
2020-06-01
|
Series: | Науковий вісник Ужгородського університету. Серія: Математика і інформатика |
Subjects: | |
Online Access: | http://visnyk-math.uzhnu.edu.ua/article/view/206418 |