1310 search results - page 25 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
EOR
2007
13 years 8 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
ICANNGA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing...
IRREGULAR
1995
Springer
14 years 7 days ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
AMC
2005
13 years 8 months ago
2005
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...