Sciweavers

332 search results - page 31 / 67
» Traveling salesman path problems
Sort
View
GECCO
2003
Springer
142views Optimization» more  GECCO 2003»
14 years 1 months ago
Revisiting Elitism in Ant Colony Optimization
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
Tony White, Simon Kaegi, Terri Oda
FLAIRS
2010
13 years 5 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
13 years 9 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»
13 years 8 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
JAR
2000
149views more  JAR 2000»
13 years 7 months ago
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
Patrick Mills, Edward P. K. Tsang