Sciweavers

594 search results - page 4 / 119
» Travelling Miser Problem
Sort
View
JCO
1998
97views more  JCO 1998»
13 years 5 months ago
The Travelling Salesman Problem on Permuted Monge Matrices
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
Rainer E. Burkard, Vladimir G. Deineko, Gerhard J....
ANTSW
2010
Springer
13 years 3 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...
IMCSIT
2010
13 years 3 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica
CORR
2011
Springer
174views Education» more  CORR 2011»
12 years 9 months ago
Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem
We study the lift-and-project procedures of Lov´asz-Schrijver and Sherali-Adams applied to the standard linear programming relaxation of the traveling salesperson problem with tr...
Thomas Watson
CEC
2010
IEEE
13 years 3 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...