A Comparison of Memetic Recombination Operators for the MinLA Problem | Zendy

Eduardo Rodríguez-Tello | Zendy; JinKao Hao | Zendy; José Torres-Jiménez | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Comparison of Memetic Recombination Operators for the MinLA Problem

Author(s) -

Eduardo Rodríguez-Tello,

JinKao Hao,

José Torres-Jiménez

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29896-7

DOI - 10.1007/11579427_62

Subject(s) - crossover , memetic algorithm , benchmark (surveying) , computer science , operator (biology) , population , set (abstract data type) , mathematical optimization , algorithm , state (computer science) , local search (optimization) , artificial intelligence , mathematics , biochemistry , chemistry , demography , geodesy , repressor , sociology , transcription factor , gene , programming language , geography

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research