A simulated annealing approach for the capacitated minimum spanning tree problem

Author

Torres-Jimenez, Jose ; Pinto-Elías, Raul ; Garcia-Romero, Agustin

fYear

1999

fDate

1999

Firstpage

432

Lastpage

436

Abstract

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

Keywords

computational complexity; minimisation; simulated annealing; trees (mathematics); Essau-Williams algorithm; Kruskal algorithm; NP-complete problem; Prim algorithm; capacitated minimum spanning tree problem; consistent ordering; energy function; feasible trees; infeasible trees; perturbation function; simulated annealing; Automotive engineering; Conducting materials; Constraint theory; Costs; Heuristic algorithms; NP-complete problem; Read only memory; Roads; Simulated annealing; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

New Delhi

Print_ISBN

0-7695-0300-4

Type

conf

DOI

10.1109/ICCIMA.1999.798569

Filename

798569