1310 search results - page 67 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
JUCS
2008
14 years 9 months ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
121
click to vote
SMC
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is natural...
AIEDAM
2008
14 years 10 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...