Results 1  10
of
479
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
ACS3opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSP’s.
Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology
"... We evaluate the effect of processor speed, network characteristics, and software overhead on the performance of releaseconsistent software distributed shared memory. We examine five different protocols for implementing release consistency: eager update, eager invalidate, lazy update, lazy invalidat ..."
Abstract

Cited by 467 (43 self)
 Add to MetaCart
invalidate, and a new protocol called lazy hybrid. This lazy hybrid protocol combines the benefits of both lazy update and lazy invalidate. Our simulations indicate that with the processors and networks that are becoming available, coarsegrained applications such as Jacobi and TSP perform well, more or less
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
 IN PROCEEDINGS OF THE 1994 WINTER USENIX CONFERENCE
, 1994
"... TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation5000/240's that are connected by a 100Mbps switchbased ATM LAN and a 10Mbps Ethernet. Ou ..."
Abstract

Cited by 526 (17 self)
 Add to MetaCart
TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation5000/240's that are connected by a 100Mbps switchbased ATM LAN and a 10Mbps Ethernet
The TSP Phase Transition
 Artificial Intelligence
, 1996
"... We wish to bring to the attention of the OR community the phenomenon of phase transitions in randomly generated problems. These are of considerable practical use for benchmarking algorithms. They also offer insight into problem hardness and algorithm performance. Whilst phase transition experiments ..."
Abstract

Cited by 79 (13 self)
 Add to MetaCart
We wish to bring to the attention of the OR community the phenomenon of phase transitions in randomly generated problems. These are of considerable practical use for benchmarking algorithms. They also offer insight into problem hardness and algorithm performance. Whilst phase transition experiments
On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound
"... We show that an instance of traveling salesman problem (TSP) of size n with an asymmetric distance matrix can be transformed into an instance of TSP of size 2n with a symmetric distance matrix. This is an improvement over earlier transformations of this kind which triple the size of the problem. Nex ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. Next we use this transformation to obtain a Hamiltonian tour of a general TSP (which may be asymmetric and/or nonEucledian) with the worst case performance ratio of 20 9 when the ratio fl := dmax dmin is smaller than 4 3 , and ( 11fl \Gamma8 3 ) otherwise. Keywords: Traveling salesman problem
Genetic Local Search for the TSP: New Results
 In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation
, 1997
"... The combination of local search heuristics and genetic algorithms has been shown to be an effective approach for finding nearoptimum solutions to the traveling salesman problem. In this paper, previously proposed genetic local search algorithms for the symmetric and asymmetric traveling salesman pr ..."
Abstract

Cited by 85 (13 self)
 Add to MetaCart
problem are revisited and potential improvements are identified. Since local search is the central component in which most of the computation time is spent, improving the efficiency of the local search operators is crucial for improving the overall performance of the algorithms. The modifications
Better Approximations for Max TSP
 Information Processing Letters
, 1998
"... We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r ! 25 33 . Keywords: Analysis of algorithms, maximum traveling ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
traveling salesman problem (Max TSP) is to compute a Hamiltonian circuit (a tour) with maximum total edge weight. The problem is maxSNPhard [1] and therefore there exists some constant fi ! 1 such that obtaining a solution with performance guarantee better than fi is NPhard. We denote the weight
ON APPROXIMATING MULTICRITERIA TSP
 SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
"... We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized appro ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
 IN PROC. 6TH INT. WORKSHOP ON ALGORITHMS AND DATA STRUCTURES (WADS), VOLUME 1663 OF LECTURE NOTES IN COMPUT. SCI
, 2000
"... We consider the approximability of the tsp problem in graphs that satisfy a relaxed form of triangle inequality. More precisely, we assume that for some parameter 1, the distances satisfy the inequality dist(x; y) \Delta (dist(x; z) + dist(z; y)) for every triple of vertices x, y, and z. We o ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We consider the approximability of the tsp problem in graphs that satisfy a relaxed form of triangle inequality. More precisely, we assume that for some parameter 1, the distances satisfy the inequality dist(x; y) \Delta (dist(x; z) + dist(z; y)) for every triple of vertices x, y, and z. We
TSP: Mining TopK Closed Sequential Patterns
 IN PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM’03
, 2003
"... Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the mining. However, it is difficult for users to provide an appropriate threshold in practice. To overcome this difficulty, we p ..."
Abstract

Cited by 47 (4 self)
 Add to MetaCart
Sequential pattern mining has been studied extensively in data mining community. Most previous studies require the specification of a minimum support threshold to perform the mining. However, it is difficult for users to provide an appropriate threshold in practice. To overcome this difficulty, we
Results 1  10
of
479