26 search results - page 3 / 6 » A Hybrid Genetic Algorithm for the Traveling Salesman Proble... |
GECCO
2009
Springer
14 years 6 days ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
FPGA
2006
ACM
13 years 9 months ago
2006
ACM
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
AUSAI
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...