58 search results - page 1 / 12 » New Approximation-Based Local Search Algorithms for the Prob... |
133
click to vote
EUROCAST
2009
Springer
15 years 10 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...
123
click to vote
ALENEX
2001
15 years 5 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....
138
Voted
TSMC
2002
15 years 3 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...
140
Voted
GECCO
2007
Springer
15 years 10 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...