Optimal linear labelings and eigenvalues of graphs
Discrete Applied Mathematics
New ideas in optimization
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
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
Graph minimum linear arrangement by multilevel weighted edge contractions
Journal of Algorithms
Evolutionary computation: comments on the history and current state
IEEE Transactions on Evolutionary Computation
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Computers and Operations Research
Memetic algorithms for constructing binary covering arrays of strength three
EA'09 Proceedings of the 9th international conference on Artificial evolution
A refined evaluation function for the MinLA problem
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
| Hi-index | 0.00 |
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA heuristic used to create the initial population and a local search operator based on a fine tuned Simulated Annealing algorithm. Its performance is investigated through extensive experimentation over well known benchmarks and compared with other state-of-the-art algorithms.