Results 1  10
of
1,511
Algorithms for the online quota traveling salesman problem
 INFORMATION PROCESSING LETTERS
, 2004
"... The Quota Traveling Salesman Problem is a generalization of the well known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of the sales, minimizing the amount of time. In this paper we address the online version of the problem, where request ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
The Quota Traveling Salesman Problem is a generalization of the well known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of the sales, minimizing the amount of time. In this paper we address the online version of the problem, where
Ant Colony System: A cooperative learning approach to the traveling salesman problem
 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 1997
"... This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a pher ..."
Abstract

Cited by 1029 (53 self)
 Add to MetaCart
This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSP’s. Ants cooperate using an indirect form of communication mediated by a
Survey of clustering algorithms
 IEEE TRANSACTIONS ON NEURAL NETWORKS
, 2005
"... Data analysis plays an indispensable role for understanding various phenomena. Cluster analysis, primitive exploration with little or no prior knowledge, consists of research developed across a wide variety of communities. The diversity, on one hand, equips us with many tools. On the other hand, the ..."
Abstract

Cited by 499 (4 self)
 Add to MetaCart
, the profusion of options causes confusion. We survey clustering algorithms for data sets appearing in statistics, computer science, and machine learning, and illustrate their applications in some benchmark data sets, the traveling salesman problem, and bioinformatics, a new field attracting intensive efforts
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 397 (2 self)
 Add to MetaCart
are in d , the running time increases to O(n(log n) ). For every fixed c, d the running time is n ⅐ poly(log n), that is nearly linear in n. The algorithm can be derandomized, but this increases the running time by a factor O(n d ). The previous best approximation algorithm for the problem (due
Algorithms for the Online Travelling Salesman
 ALGORITHMICA
, 2001
"... In this paper the problem of efficiently serving a sequence of requests presented in an online fashion located at points of a metric space is considered. We call this problem the OnLine Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
In this paper the problem of efficiently serving a sequence of requests presented in an online fashion located at points of a metric space is considered. We call this problem the OnLine Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We
Ant colonies for the travelling salesman problem
, 1997
"... We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer si ..."
Abstract

Cited by 286 (5 self)
 Add to MetaCart
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 414 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
The online asymmetric traveling salesman problem
 Proc. 9th Workshop on Algorithms and Data Structures, volume 3608 of Lecture Notes in Computer Science
, 2005
"... Abstract. We consider two online versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+√5competitive algorithm and prove that this is best 2 possible. For th ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
Abstract. We consider two online versions of the asymmetric traveling salesman problem with triangle inequality. For the homing version, in which the salesman is required to return in the city where it started from, we give a 3+√5competitive algorithm and prove that this is best 2 possible
Competitive Algorithms for the Online Traveling Salesman
 In Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS 95
, 1995
"... In this paper the problem of efficiently serving a sequence of requests that are presented in a metric space in an online fashion and then returning back to the departure point is considered. The problem, that is the online version of a variant of the Traveling Salesman Problem (namely the Vehicle ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
the Vehicle Routing Problem with release times), and that for the sake of intuition we call OnLine Traveling Salesman Problem (OLTSP), has a variety of relevant applications in logistics and robotics. After proving a ß 1:64 lower bound on the competitive ratio that can be achieved by online algorithms
Results 1  10
of
1,511