94 search results - page 5 / 19 » Memetic Algorithms for the MinLA Problem |
152
click to vote
ICTAI
2010
IEEE
15 years 2 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...
143
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
154
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
124
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
136
click to vote
HAIS
2009
Springer
15 years 9 months ago
2009
Springer
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...