A new hybrid Evolutionary Algorithm for the MinLA problem Online publication date: Wed, 06-May-2009
by Reeti Sharma, Kamal Srivastava
International Journal of Operational Research (IJOR), Vol. 5, No. 2, 2009
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com