Simulated annealing method for equilibrium placement problem
| Autor: | Igor Kozin, Natalia Maksyshko, Yaroslav Tereshko |
|---|---|
| Rok vydání: | 2021 |
| Zdroj: | Physico-mathematical modelling and informational technologies. :152-158 |
| ISSN: | 2617-5258 1816-1545 |
| DOI: | 10.15407/fmmit2021.32.152 |
| Popis: | The paper proposes a modification of the simulated annealing algorithm as applied to problems that have a fragmented structure. An algorithm for simulating annealing for the traveling salesman problem is considered and its applicability to the optimization problem on a set of permutations is shown. It is proved that the problem of equilibrium placement of point objects on a plane has a fragmentary structure and, therefore, reduces to an optimization problem on a set of permutations. The results of numerical experiments for various types of algorithms for finding the optimal solution in the equilibrium placement problem are presented. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|