196 search results - page 15 / 40 » Assortative Mating in Genetic Algorithms for Dynamic Problem... |
AAAI
1997
13 years 9 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
ISDA
2008
IEEE
14 years 2 months ago
2008
IEEE
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper we present a novel cost benefit operator that assists multi level genetic algorithm searches. Through the use of the cost benefit operator, it is possible to dyna...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve o...