1026 search results - page 11 / 206 » An Optimal Solution to Room Search Problem |
ANTSW
2006
Springer
13 years 11 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— A number of multi-objective genetic algorithms (MOGAs) have been developed to obtain Pareto optimal solutions for multi-objective optimization problems. However, as these metho...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...