Sciweavers

2174 search results - page 286 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
EVOW
2004
Springer
15 years 12 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
15 years 11 months ago
Adaptive strategy selection in differential evolution
Differential evolution (DE) is a simple yet powerful evolutionary algorithm for global numerical optimization. Different strategies have been proposed for the offspring generation...
Wenyin Gong, Álvaro Fialho, Zhihua Cai
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 11 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
GECCO
2009
Springer
15 years 10 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
AAAI
2008
15 years 8 months ago
A Case Study on the Critical Role of Geometric Regularity in Machine Learning
An important feature of many problem domains in machine learning is their geometry. For example, adjacency relationships, symmetries, and Cartesian coordinates are essential to an...
Jason Gauci, Kenneth O. Stanley