Results 1  10
of
28,152
Salesman Problem
, 2007
"... To explain the essential features such as sufficient diversity, discrimination of self and nonself, and also longlasting immunologic memory of adaptive immune responses, Burnet and Talmage developed the clonal selection theory. In their model, only the high affinity immune cells are selected to pr ..."
Abstract
 Add to MetaCart
is also implemented to improve algorithm's performance. Simulation on traveling salesman problems shows that this novel algorithm provides a better performance compared to the classical clonal selection algorithm.
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 276 (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
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 1000 (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
On the Solution of Traveling Salesman Problems
 DOC. MATH. J. DMV
, 1998
"... Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TS ..."
Abstract

Cited by 226 (7 self)
 Add to MetaCart
Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TSP instances with more than several hundred cities; over the years, it has evolved further through the work of M. Grötschel , S. Hong , M. Jünger , P. Miliotis , D. Naddef , M. Padberg ... some of its refinements that led to the solution of a 13,509city instance.
The traveling salesman problem
, 1994
"... This paper presents a selfcontained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances ..."
Abstract

Cited by 130 (5 self)
 Add to MetaCart
This paper presents a selfcontained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem
Traveling Salesman Problem
, 1976
"... An algorithm for solving a range constrained traveling salesman problem. ..."
On The Approximability Of The Traveling Salesman Problem
 Proceedings of the 32nd Annual ACM Symposium on Theory of Computing
, 2000
"... We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than 116 when the edge lengths are allowed to be asymmetric and 219 when the edge lengths are symmetric. The best previous lower bounds were 2804 and 3812 respectively. The reduction is fr ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than 116 when the edge lengths are allowed to be asymmetric and 219 when the edge lengths are symmetric. The best previous lower bounds were 2804 and 3812 respectively. The reduction
The Traveling Salesman Problem and Its Variations
, 2002
"... Introduction The Maximum Traveling Salesman Problem (MAX TSP), also known informally as the "taxicab ripoff problem", is stated as follows: Given an n \Theta n real matrix c = (c ij ), called a weight matrix, find a hamiltonian cycle i 1 7! i 2 7! : : : 7! i n 7! i 1 , for which the maxi ..."
Abstract

Cited by 124 (4 self)
 Add to MetaCart
Introduction The Maximum Traveling Salesman Problem (MAX TSP), also known informally as the "taxicab ripoff problem", is stated as follows: Given an n \Theta n real matrix c = (c ij ), called a weight matrix, find a hamiltonian cycle i 1 7! i 2 7! : : : 7! i n 7! i 1 , for which
Traveling Salesman Problems With Profits: An Overview
 Transportation Science
, 2001
"... Traveling Salesman Problems with Profits (TSPs with Profits) are a generalization of the Traveling Salesman Problem (TSP) where it is not necessary to visit all vertices. With each vertex is associated a profit. The objective is to find a route with a satisfying collected profit (maximized) and trav ..."
Abstract

Cited by 74 (2 self)
 Add to MetaCart
Traveling Salesman Problems with Profits (TSPs with Profits) are a generalization of the Traveling Salesman Problem (TSP) where it is not necessary to visit all vertices. With each vertex is associated a profit. The objective is to find a route with a satisfying collected profit (maximized
Traveling Salesman Problem with Transportation ∗
"... Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined — a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cuttingplane methods and Branch and Bound ..."
Abstract
 Add to MetaCart
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined — a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cuttingplane methods and Branch
Results 1  10
of
28,152