A new hybrid evolutionary algorithm for the MinLA problem
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).
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Contributions to the minimum linear arrangement problem.
- New relationships for multi-neighborhood search for the minimum linear arrangement problem
- Experiments on the minimum linear arrangement problem
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
This page was built for publication: A new hybrid evolutionary algorithm for the MinLA problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840588)
