A Refined Evaluation Function 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 Refined Evaluation Function for the MinLA Problem

Author(s) -

Eduardo Rodríguez-Tello,

JinKao Hao,

José Torres-Jiménez

Publication year - 2006

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-49026-4

DOI - 10.1007/11925231_37

Subject(s) - computer science , function (biology) , mathematical optimization , memetic algorithm , evaluation function , algorithm , value (mathematics) , artificial intelligence , mathematics , machine learning , local search (optimization) , biology , evolutionary biology

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

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