Sciweavers

1310 search results - page 52 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 3 months ago
A genetic algorithm for unmanned aerial vehicle routing
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...
Matthew A. Russell, Gary B. Lamont
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 1 months ago
Adaptive discretization for probabilistic model building genetic algorithms
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen
PDCN
2004
14 years 11 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
HEURISTICS
2002
146views more  HEURISTICS 2002»
14 years 9 months ago
Hybrid Genetic Algorithm for DNA Sequencing with Errors
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with negative and positive errors is presented. The algorithm has as its input a set of oligonucleo...
Jacek Blazewicz, Marta Kasprzak, Wojciech Kuroczyc...
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 3 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu