A new hybrid evolutionary algorithm for the MinLA problem (Q840588)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5603396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new hybrid evolutionary algorithm for the MinLA problem |
scientific article; zbMATH DE number 5603396 |
Statements
A new hybrid evolutionary algorithm for the MinLA problem (English)
0 references
13 September 2009
0 references
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).
0 references
minimum linear arrangement problem (MinLA)
0 references
evolutionary algorithms
0 references
graph layout
0 references
simulated annealing
0 references
0.7767295837402344
0 references
0.7551533579826355
0 references
0.7528934478759766
0 references
0.7455149292945862
0 references
