|
Bulletin of Irkutsk State University. Series Mathematics, 2011, Volume 4, Issue 2, Pages 114–123
(Mi iigum109)
|
|
|
|
Building a capacitated minimum spanning tree using simulated annealing
A. Ipatov Ural State University
Abstract:
In this paper we consider capacitated minimum spanning tree problem (CMST) which is NP-hard. We have developed enhanced simulated annealing method, which allows getting better solutions for CMST than the classical one. Computational results on the benchmark instances are reported.
Keywords:
capacitated minimum spanning tree; simulated annealing; metaheuristic; neighborhood.
Citation:
A. Ipatov, “Building a capacitated minimum spanning tree using simulated annealing”, Bulletin of Irkutsk State University. Series Mathematics, 4:2 (2011), 114–123
Linking options:
https://www.mathnet.ru/eng/iigum109 https://www.mathnet.ru/eng/iigum/v4/i2/p114
|
Statistics & downloads: |
Abstract page: | 181 | Full-text PDF : | 85 | References: | 45 |
|