A comparison of memetic recombination operators 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'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Year:
2005

Citing 10
Cited 0

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Tabu Search

Tabu Search
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
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd 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
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning

Evolutionary Computation
Graph minimum linear arrangement by multilevel weighted edge contractions

Journal of Algorithms
Applying adaptive algorithms to epistatic domains

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Crossover (TX) is introduced and its performance is compared with four previous crossover operators. It is shown that the TX crossover induces a better population diversity. The MA using TX is evaluated on a set of well-known benchmark instances and is compared with several state-of-art MinLA algorithms.