Sciweavers

599 search results - page 13 / 120
» The traveling salesman problem
Sort
View
EVOW
2004
Springer
14 years 1 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
ACL
2009
13 years 5 months ago
Phrase-Based Statistical Machine Translation as a Traveling Salesman Problem
An efficient decoding algorithm is a crucial element of any statistical machine translation system. Some researchers have noted certain similarities between SMT decoding and the f...
Mikhail Zaslavskiy, Marc Dymetman, Nicola Cancedda
ICML
1995
IEEE
14 years 8 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 9 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen
CEC
2010
IEEE
13 years 9 months ago
A hybrid genetic algorithm and inver over approach for the travelling salesman problem
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
Shakeel Arshad, Shengxiang Yang