.png){kind=icon}
.png){kind=icon}
Return
An improved simulated annealing algorithm for bandwidth minimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.12.052.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2006 Elsevier B.V. All rights reserved.
Keywords:
bandwidth minimization
heuristics
simulated annealing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available