Sciweavers

Share
GECCO
2006
Springer

Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

10 years 1 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable neighbourhood search (VNS), an evolutionary algorithm (EA) utilising a new encoding of solutions, and an ant colony optimisation (ACO). We compare the performance in terms of effectiveness between these three hybrid methods on a suite of popular benchmark instances, which contains instances too large to solve by current exact methods. Our results show that the EA and the ACO outperform the VNS on almost all used benchmark instances. Furthermore, the ACO yields most of the time better solutions than the EA in long-term runs, whereas the EA dominates when the computation time is strongly restricted. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Problem Solving, Control
Martin Gruber, Jano I. van Hemert, Günther R.
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2006
Where GECCO
Authors Martin Gruber, Jano I. van Hemert, Günther R. Raidl
Comments (0)
books