58 search results - page 3 / 12 » New Approximation-Based Local Search Algorithms for the Prob... |
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
EVOW
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
ANTSW
2010
Springer
13 years 5 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...