Sciweavers

25
Voted
EOR
2008

An improved simulated annealing algorithm for bandwidth minimization

13 years 7 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an original internal representation of solutions, a highly discriminating evaluation function and an effective neighborhood. The algorithm is evaluated on a set of 113 well-known benchmark instances of the literature and compared with several state-of-the-art algorithms, showing improvements of some previous best results. Key words: Bandwidth Minimization, Heuristics, Simulated Annealing
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where EOR
Authors Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
Comments (0)