594 search results - page 69 / 119 » Travelling Miser Problem |
135
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
115
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
155
click to vote
ISCI
2008
15 years 4 months ago
2008
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
154
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
125
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...