A refined evaluation function for the MinLA problem

Authors:
Eduardo Rodriguez-Tello;Jin-Kao Hao;Jose Torres-Jimenez
Affiliations:
LERIA, Université d'Angers., Angers, France;LERIA, Université d'Angers., Angers, France;Mathematics Department, University of Guerrero., Acapulco Guerrero, Mexico
Venue:
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Year:
2006

Citing 9
Cited 1

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

Operations Research
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
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
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
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
On syntactic versus computational views of approximability

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Memetic algorithms for the MinLA problem

EA'05 Proceedings of the 7th international conference on Artificial Evolution

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

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a refined evaluation function, called Φ, for the Minimum Linear Arrangement problem (MinLA). Compared with the classical evaluation function (LA), Φ integrates additional information contained in an arrangement to distinguish arrangements with the same LA value. The main characteristics of Φ are analyzed and its practical usefulness is assessed within both a Steepest Descent (SD) algorithm and a Memetic Algorithm (MA). Experiments show that the use of Φ allows to boost the performance of SD and MA, leading to the improvement on some previous best known solutions.