Sciweavers

275 search results - page 29 / 55
» The Attractive Traveling Salesman Problem
Sort
View
CEC
2010
IEEE
14 years 11 months ago
Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...
Hui Li, Dario Landa Silva, Xavier Gandibleux
CAAN
2006
Springer
15 years 1 months ago
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
Boris Goldengorin, Gerold Jäger, Paul Molitor
FLAIRS
2010
14 years 7 months ago
Decision-Theoretic Simulated Annealing
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
Todd W. Neller, Christopher J. La Pilla
COLING
2000
14 years 11 months ago
Word Re-ordering and DP-based Search in Statistical Machine Translation
In this paper, we describe a search procedure for statistical machine translation (MT) based on dynmnic programming (DP). Starting from a DP-based solution to the traveling salesm...
Christoph Tillmann, Hermann Ney
DAM
2006
89views more  DAM 2006»
14 years 9 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic