2266 search results - page 121 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
COR
2007
15 years 1 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
159
click to vote
FOGA
2011
14 years 5 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
146
click to vote
EVOW
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
155
click to vote
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
110
click to vote
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...