..:: Información Detallada ::..
A Comparison of Memetic Recombination Operators for the MinLA Problem
|
Fecha:
|
2005
|
Tipo:
|
Memoria Congreso
|
|||||||
|---|---|---|---|---|---|---|---|---|---|---|
|
Titulo:
|
A Comparison of Memetic Recombination Operators for the MinLA Problem
|
|||||||||
|
Autores:
|
HAO Jin-Kao.
TORRES Jose.
RODRIGUEZ Eduardo.
|
|||||||||
|
Proyecto:
|
||||||||||
|
País:
|
CONJUNTO
|
|||||||||
|
Congreso:
|
Proceedings of the 4th Mexican International Conference on Artificial Intelligence
, (MICAI 2005)
|
|||||||||
|
Páginas:
|
613-622 Pp.
|
|||||||||
|
Editorial:
|
Springer Berlin / Heidelberg
|
|||||||||
|
ISBN:
|
978-3-540-29896-0
|
|||||||||
|
Enlace:
|
||||||||||
|
Descripción:
|
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.
|
|||||||||