A new hybrid evolutionary algorithm for the MinLA problem (Q840588)

Summary: In this paper, we deal with a particular graph layout problem: the minimum linear arrangement problem (MinLA). A new evolutionary algorithm (EA) is presented, with a knowledge-based operator designed to search the solution space. The proposed technique is a hybrid approach, incorporating 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) and spectral sequencing (SS) of the graphs. The proposed technique produces results that are comparable to the existing approaches (known for their good results).