Sciweavers

1589 search results - page 72 / 318
» Multiple-Goal Heuristic Search
Sort
View
HEURISTICS
2002
65views more  HEURISTICS 2002»
13 years 9 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 10 months ago
How to use the Scuba Diving metaphor to solve problem with neutrality ?
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
Philippe Collard, Sébastien Vérel, M...
HEURISTICS
2002
99views more  HEURISTICS 2002»
13 years 9 months ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
IPPS
2000
IEEE
14 years 2 months ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
14 years 1 months ago
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
Thomas Jansen, Ingo Wegener