Results 1  10
of
41
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
An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems
"... Abstract Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or biosonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algo ..."
Abstract
 Add to MetaCart
algorithm to solve the wellknown symmetric and asymmetric traveling salesman problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances
A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems
 In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation
, 1996
"... The combination of local search heuristics and genetic algorithms is a promising approach for finding nearoptimum solutions to the traveling salesman problem (TSP). In this paper, an approach is presented in which local search techniques are used to find local optima in a given TSP search space, and ..."
Abstract

Cited by 87 (12 self)
 Add to MetaCart
The combination of local search heuristics and genetic algorithms is a promising approach for finding nearoptimum solutions to the traveling salesman problem (TSP). In this paper, an approach is presented in which local search techniques are used to find local optima in a given TSP search space
Memetic algorithm for the generalized asymmetric traveling salesman problem
 PROCEEDINGS OF THE 2007 WORKSHOP ON NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMISATION. LECTURE NOTES IN COMPUTER SCIENCE (LNCS
"... The generalized traveling salesman problem (GTSP) is an extension of the wellknown traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to pres ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
times, but the running times still remain within reasonable bounds (at most a few minutes). While the SnyderDaskin memetic algorithm is designed only for the Symmetric GTSP, our algorithm can solve both symmetric and asymmetric instances. Unlike the SnyderDaskin heuristic, we use a simple machine
Solving Symmetric and Asymmetric TSPs by Ant Colonies
, 1996
"... In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to both symmetric and asymmetric traveling salesman problems. Results show that ACS is able to find good sol ..."
Abstract

Cited by 102 (21 self)
 Add to MetaCart
In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We apply ACS to both symmetric and asymmetric traveling salesman problems. Results show that ACS is able to find good
A Memetic Algorithm for the Generalized Traveling Salesman Problem
"... The generalized traveling salesman problem (GTSP) is an extension of the wellknown traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
The generalized traveling salesman problem (GTSP) is an extension of the wellknown traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies
Solving the Asymmetric Traveling Purchaser Problem
, 2003
"... The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the Asymmetric Traveling Salesman Problem with several applications in the routing and the scheduling contexts. This problem is defined as follows. Let us consider a set of products and a set of markets. Each market is provided ..."
Abstract
 Add to MetaCart
The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the Asymmetric Traveling Salesman Problem with several applications in the routing and the scheduling contexts. This problem is defined as follows. Let us consider a set of products and a set of markets. Each market
Ant Colonies for the Traveling Salesman Problem
"... We describe an artificial ant colony capable of solving the traveling 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 sim ..."
Abstract
 Add to MetaCart
We describe an artificial ant colony capable of solving the traveling 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
An Experimental Evaluation of Ejection Chain Algorithms for the Traveling Salesman Problem
"... Ejection chain methods lead the stateoftheart in local search heuristics for the traveling salesman problem (TSP). The most effective local search approaches primarily originate from the StemandCycle ejection chain method and the classical LinKernighan procedure, which can be viewed as an in ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Ejection chain methods lead the stateoftheart in local search heuristics for the traveling salesman problem (TSP). The most effective local search approaches primarily originate from the StemandCycle ejection chain method and the classical LinKernighan procedure, which can be viewed
Application of Genetic Algorithms to Traveling Salesman Problem
"... This report summarizes our results in application of Genetic Algorithms (GA) to the Traveling Salesman Problem (TSP). TSP is well known and well studied problem. It is defined as a task of finding of the shortest Hamiltonian cycle in complete graph of n nodes. Our research was concentrated on Symmet ..."
Abstract
 Add to MetaCart
This report summarizes our results in application of Genetic Algorithms (GA) to the Traveling Salesman Problem (TSP). TSP is well known and well studied problem. It is defined as a task of finding of the shortest Hamiltonian cycle in complete graph of n nodes. Our research was concentrated
Results 1  10
of
41