Results 11  20
of
41
APPLICATION OF GENETIC ALGORITHM TO SOLVE TRAVELING SALESMAN PROBLEM
"... This research investigated the application of Genetic Algorithm capable of solving the traveling salesman problem (TSP). Genetic Algorithm 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 grap ..."
Abstract
 Add to MetaCart
This research investigated the application of Genetic Algorithm capable of solving the traveling salesman problem (TSP). Genetic Algorithm 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
A DoublyRooted StemandCycle Ejection Chain Algorithm for Asymmetric Traveling Salesman Problems
, 2006
"... Ejection chain methods, which include the classical LinKernighan (LK) procedure and the StemandCycle (S&C) reference structure, have been the source of the current leading algorithms for large scale symmetric traveling salesman problems (STSP). Although these methods proved highly effective ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Ejection chain methods, which include the classical LinKernighan (LK) procedure and the StemandCycle (S&C) reference structure, have been the source of the current leading algorithms for large scale symmetric traveling salesman problems (STSP). Although these methods proved highly effective
Mathematical Programming Approaches to the Traveling Salesman Problem
"... The Traveling Salesman Problem or TSP is probably the best known combinatorial optimisation problem. Informally speaking, one is given a set of cities, along with the cost of traveling between each pair of cities, and one wishes to find a tour of all the cities of minimum cost. The TSP has applicati ..."
Abstract
 Add to MetaCart
The Traveling Salesman Problem or TSP is probably the best known combinatorial optimisation problem. Informally speaking, one is given a set of cities, along with the cost of traveling between each pair of cities, and one wishes to find a tour of all the cities of minimum cost. The TSP has
A Hybrid Genetic Algorithm  A New Approach to Solve Traveling Salesman Problem
 International Journal of Computational Engineering Science
, 2001
"... This paper introduces three new heuristics for the Euclidean Traveling Salesman Problem (TSP). One of the heuristics called Initialization Heuristics (IH) is applicable only to the Euclidean TSP, while other two heuristics RemoveSharp and LocalOpt can be applied to all forms of symmetric and asymmet ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper introduces three new heuristics for the Euclidean Traveling Salesman Problem (TSP). One of the heuristics called Initialization Heuristics (IH) is applicable only to the Euclidean TSP, while other two heuristics RemoveSharp and LocalOpt can be applied to all forms of symmetric
Reduce Total Distance and Time Using Genetic Algorithm in Traveling Salesman Problem
"... Abstract: Traveling salesman problem is quite known in the field of combinatorial optimization. Through this research describe how the traveling salesman problem is solved by the heuristic method of genetic algorithms. This research to find the most approximate solution that gives us the least dista ..."
Abstract
 Add to MetaCart
Abstract: Traveling salesman problem is quite known in the field of combinatorial optimization. Through this research describe how the traveling salesman problem is solved by the heuristic method of genetic algorithms. This research to find the most approximate solution that gives us the least
Applications of a Dynamic Programming Approach to the Traveling Salesman Problem
, 1998
"... Consider the following restricted (symmetric or asymmetric) traveling salesman problem: given an initial ordering of the n cities and an integer k ? 0, find a minimum cost tour such that if city i precedes city j by at least k positions in the initial ordering, then city i precedes city j in any opt ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Consider the following restricted (symmetric or asymmetric) traveling salesman problem: given an initial ordering of the n cities and an integer k ? 0, find a minimum cost tour such that if city i precedes city j by at least k positions in the initial ordering, then city i precedes city j in any
Tajuddin, ―Solving ISP problem by using Genetic Algorithm
 International Journal of Basic & Applied Sciences IJBASIJENS, Vol:09 No:10
"... Abstract The main purpose of this study is to propose a new representation method of chromosomes using binary matrix and new fittest criteria to be used as method for finding the optimal solution for TSP. The concept of the proposed method is taken from genetic algorithm of artificial inelegance a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
as a basic ingredient which has been used as search algorithm to find the nearoptimal solutions. Here we are introducing the new fittest criteria for crossing over, and applying the algorithm on symmetric as well as asymmetric TSP, also presenting asymmetric problem in a new and different way. Index
SOLVING TSP PROBLEM BY USING GENETIC ALGORITHM ABSTRACT:
"... The main purpose of this study is to propose a new representation method of chromosomes using binary matrix and new fittest criteria to be used as method for finding the optimal solution for TSP. The concept of the proposed method is taken from genetic algorithm of artificial inelegance as a basic i ..."
Abstract
 Add to MetaCart
algorithm, fittest criteria, asymmetric travelling salesman problem. As far as the artificial inelegance is concerned, the genetic algorithm is an optimization technique based on natural evolution that is the change over a long period of time. Genetic algorithm (GAs) has been used as a search technique
Université Libre de Bruxelles
"... 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

Cited by 1 (0 self)
 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
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
approximation algorithms for multicriteria maximum traveling salesman problems (MaxTSP). For multicriteria MaxSTSP, where the edge weights have to be symmetric, we devise an algorithm that achieves an approximation ratio of 2/3 − ε. For multicriteria MaxATSP, where the edge weights may be asymmetric, we
Results 11  20
of
41