58 search results - page 1 / 12 » New Approximation-Based Local Search Algorithms for the Prob... |
EUROCAST
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
ALENEX
2001
13 years 6 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
TSMC
2002
13 years 4 months ago
2002
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
ICEC
1996
13 years 6 months ago
1996
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...