Sciweavers

3569 search results - page 468 / 714
» On the Evolution of Evolutionary Algorithms
Sort
View
BMVC
1998
15 years 8 months ago
A Method for Dynamic Clustering of Data
This paper describes a method for the segmentation of dynamic data. It extends well known algorithms developed in the context of static clustering (e.g., the c-means algorithm, Ko...
Arnaldo J. Abrantes, Jorge S. Marques
EVOW
2004
Springer
16 years 1 days 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
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
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham