11 search results - page 1 / 3 » A Comparison of Memetic Recombination Operators for the MinL... |
78
Voted
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Cr...
83
Voted
AE
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
AMC
2004
14 years 10 months ago
2004
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
92
Voted
ICTAI
2010
IEEE
14 years 8 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
72
Voted
HM
2007
Springer
15 years 4 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...