An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Authors:
Eduardo Rodriguez-Tello;Jin-Kao Hao;Jose Torres-Jimenez
Affiliations:
LERIA, Université d'Angers, 2 Boulevard Lavoisier, 49045 Angers Cedex 01, France;LERIA, Université d'Angers, 2 Boulevard Lavoisier, 49045 Angers Cedex 01, France;CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 6 Carretera Victoria-Monterrey, 87276 Victoria Tamps., Mexico
Venue:
Computers and Operations Research
Year:
2008

Citing 21
Cited 11

Standard cell placement using simulated sintering

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Cooling schedules for optimal annealing

Mathematics of Operations Research
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Optimal linear labelings and eigenvalues of graphs

Discrete Applied Mathematics
Best-so-far vs. where-you-are: implications for optimal finite-time annealing

Systems & Control Letters
Performance of a new annealing schedule

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems

Computers and Operations Research
Simulated Annealing with estimated temperature

AI Communications - Special issue on AI research in the Benelux
A survey of graph layout problems

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Multi-scale Algorithm for the Linear Arrangement Problem

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Experiments on the minimum linear arrangement problem

Journal of Experimental Algorithmics (JEA)
Graph minimum linear arrangement by multilevel weighted edge contractions

Journal of Algorithms
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory
A refined evaluation function for the MinLA problem

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Memetic algorithms for the MinLA problem

EA'05 Proceedings of the 7th international conference on Artificial Evolution
Temperature measurement and equilibrium dynamics of simulated annealing placements

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Simulated Annealing Without Rejected Moves

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The noising method: a new method for combinatorial optimization

Operations Research Letters

Global planning of 3G networks using simulated annealing

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

Applied Soft Computing
Memetic algorithms for constructing binary covering arrays of strength three

EA'09 Proceedings of the 9th international conference on Artificial evolution
Decorous Lower Bounds for Minimum Linear Arrangement

INFORMS Journal on Computing
Comparison of different meta-heuristics to solve the global planning problem of UMTS networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
New bounds for binary covering arrays using simulated annealing

Information Sciences: an International Journal
Variable neighborhood search with ejection chains for the antibandwidth problem

Journal of Heuristics
Scatter Search and Path Relinking: A Tutorial on the Linear Arrangement Problem

International Journal of Swarm Intelligence Research
Multistart Iterated Tabu Search for Bandwidth Coloring Problem

Computers and Operations Research
A hybrid metaheuristic for the cyclic antibandwidth problem

Knowledge-Based Systems
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

Journal of Heuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.