Sciweavers

203 search results - page 33 / 41
» tsp 2010
Sort
View
CSR
2010
Springer
15 years 1 months ago
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
Gerold Jäger, Weixiong Zhang
TSP
2010
14 years 4 months ago
On optimum regenerative relaying with imperfect channel knowledge
This paper is concerned with the performance of a regenerative relaying protocol on fading wireless channels with imperfect channel knowledge at the receivers. Assuming a single s...
Ramesh Annavajjala
EVOW
2010
Springer
15 years 4 months ago
Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems
Abstract. The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This...
Botond Draskoczy
69
Voted
IJAIT
2010
167views more  IJAIT 2010»
14 years 8 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
ANTSW
2010
Springer
14 years 8 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...