.png){kind=icon}
.png){kind=icon}
Return
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2007.03.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, an improved two-stage simulated annealing algorithm is presented for the minimum linear arrangement problem for graphs. This algorithm integrates several distinguished features including an efficient heuristic to generate good quality initial solutions, a highly discriminating evaluation function, a special neighborhood function and an effective cooling schedule. The algorithm is evaluated on a set of 30 well-known benchmark instances of the literature and compared with several state-of-the-art algorithms, showing improvements of 17 previous best results. (C) 2007 Elsevier Ltd. All rights reserved.
Keywords:
linear arrangement
evaluation function
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
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W