Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481649 | European Journal of Operational Research | 2008 | 17 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez,