58 search results - page 8 / 12 » New Approximation-Based Local Search Algorithms for the Prob... |
ASIAN
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
GECCO
2000
Springer
13 years 11 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...
GECCO
2005
Springer
14 years 1 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 ...
AAAI
1998
13 years 9 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....