By Topic

A simulated annealing approach for the capacitated minimum spanning tree problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time

Published in:

Computational Intelligence and Multimedia Applications, 1999. ICCIMA '99. Proceedings. Third International Conference on

Date of Conference: