A new hybrid evolutionary algorithm for the MinLA problem

A new hybrid evolutionary algorithm for the MinLA problem

0.00 Avg rating0 Votes
Article ID: iaor200968889
Country: United Kingdom
Volume: 5
Issue: 2
Start Page Number: 229
End Page Number: 249
Publication Date: May 2009
Journal: International Journal of Operational Research
Authors: ,
Keywords: heuristics: genetic algorithms
Abstract:

In this paper, we deal with a particular layout problem of graph: the Minimum Linear Arrangement Problem (MinLA). A new Evolutionary Algorithm (EA) is presented here with knowledge-based operator designed to search the solution space. The proposed technique is a hybrid approach, which incorporates Simulated Annealing (SA) into the selection process of EA. It also utilises the features of level structure, Depth First Search (DFS), Frontal Increase Minimisation (FIM) method and Spectral Sequencing (SS) of the graphs. The proposed technique produces results that are well comparable with the existing approaches known for their good results.

Reviews

Required fields are marked *. Your email address will not be published.