• No results found

Travelling salesman problem

The multi stripe travelling salesman problem

The multi stripe travelling salesman problem

... d(i, j) + d(k , ) ≤ d(i, k) + d( j, ) for all 1 ≤ i < j < k < ≤ n (6) d ( i , ) + d ( j , k ) ≤ d ( i , k ) + d ( j , ) for all1 ≤ i < j < k < ≤ n (7) Kalmanson matrices were introduced by Kalmanson ...

15

A STUDY ON OPTIMIZATION TECHNIQUES OF TRAVELLING SALESMAN PROBLEM USING GENETIC ALGORITHM

A STUDY ON OPTIMIZATION TECHNIQUES OF TRAVELLING SALESMAN PROBLEM USING GENETIC ALGORITHM

... The Travelling salesman problem is defined as a permutation problem with the objective of finding the path of the shortest length (or the minimum ...minimization problem starting and ...

14

A Survey Paper on Solving Travelling Salesman problem Using Bee colony optimization

A Survey Paper on Solving Travelling Salesman problem Using Bee colony optimization

... for Travelling Salesman problem with its basic mechanism of bees foraging behavior and its efficiency in solving shortest path among various ...

6

Objective Linear Programming Approach for Travelling Salesman Problem Fuzzy Ranking Method

Objective Linear Programming Approach for Travelling Salesman Problem Fuzzy Ranking Method

... In this paper, limitation of an existing method [7] for solving fuzzy assignment problems and fuzzy travelling salesman problem is discussed and to overcome this limitation, the new method is ...

5

An Analysis of a Recursive and an Iterative Algorithm for Generating Permutations Modified for Travelling Salesman Problem

An Analysis of a Recursive and an Iterative Algorithm for Generating Permutations Modified for Travelling Salesman Problem

... Abstract— This paper presents the results of a comparative analysis between a recursive and an iterative algorithm when generating permutation. A number of studies discussing the problem and some methods dealing ...

8

Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem

Applying Minimum Travel Cost Approach on 43–Nodes Travelling Salesman Problem

... Abstract: The minimum travel cost is a new approach to solve the Travelling Salesman Problem (TSP). The TSP library website (TSPLIB) provides several TSP problems with their best knownsolutions as a ...

15

Developing a Java-based Genetic Algorithm to Solve the Travelling Salesman Problem

Developing a Java-based Genetic Algorithm to Solve the Travelling Salesman Problem

... The Travelling Salesman Problem (TSP) is a well-known example of a classical combinatorial optimization ...the salesman returns to the starting ...tour problem [16]. The term ...

7

A Study and Performance Evaluation of Various Optimization Techniques for Travelling Salesman Problem

A Study and Performance Evaluation of Various Optimization Techniques for Travelling Salesman Problem

... The Travelling Salesman Problem is one of the most popular problems from the NP ...this problem enjoys wide applicability in a variety of practical ...Hard problem. Travelling ...

11

Different Applications of the Genetic Mutation Operator for Symetric Travelling Salesman Problem

Different Applications of the Genetic Mutation Operator for Symetric Travelling Salesman Problem

... The problem to find a minimal Hamiltonian cycle in a graph is an optimization ...the Travelling Salesman Problem, and its variants and detailed description are presented in [30] and ...

9

Parallel Implementation of the Max Min Ant System for the Travelling Salesman Problem on GPU

Parallel Implementation of the Max Min Ant System for the Travelling Salesman Problem on GPU

... Travelling salesman problem is one of the oldest mathematical problems in ...of problem using different ...optimization problem such as Travelling Salesman Problem ...

5

A Comparison of Exhaustive, Heuristic and Genetic Algorithm for Travelling Salesman Problem in PROLOG

A Comparison of Exhaustive, Heuristic and Genetic Algorithm for Travelling Salesman Problem in PROLOG

... Abstract— This paper discusses on a comparative study towards solution for solving Travelling Salesman Problem based on three techniques proposed namely exhaustive, heuristic and genetic algorithm. ...

5

A Survey of Travelling Salesman Problem Using Heuristic Search Techniques

A Survey of Travelling Salesman Problem Using Heuristic Search Techniques

... for Travelling Salesman from 1832 mentions the problem and includes example tours through Germany and Switzerland, but contains no mathematical ...name Travelling Salesman ...

5

TUTORIALS ON AFRICAN BUFFALO OPTIMIZATION FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

TUTORIALS ON AFRICAN BUFFALO OPTIMIZATION FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

... The African Buffalo Optimization is a newly designed metaheuristic optimization algorithm inspired by the migration of African buffalos from place to place across the vast African forests, deserts and savannah in search ...

9

Fuzzy Based Solution to the Travelling Salesman Problem: A Case Study

Fuzzy Based Solution to the Travelling Salesman Problem: A Case Study

... Abstract—Conventional Travelling Salesman Problem (TSP) solutions are based on the assumption that time of travel between nodes is wholly dependent on ...

5

Moving Target Travelling Salesman Problem using Genetic Algorithm

Moving Target Travelling Salesman Problem using Genetic Algorithm

... In this paper, the Moving Target Travelling Salesman Problem (MTTSP) is described. In MTTSP, several sites are required to be visited which are moving with constant velocity in different directions. ...

5

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

... on Travelling Salesman Problem (TSP), the ant colony algorithm is superior to simulated annealing and genetic algorithm approaches as it can be run continuously and acclimatize to changes in real ...

5

Survey on Ant Colony Optimization Using Travelling Salesman Problem

Survey on Ant Colony Optimization Using Travelling Salesman Problem

... the travelling salesmanproblem and the application of heuristics in ant colony optimization ...the travelling salesman problem using the ant colony system with different ...

5

A Comparative Study Of Nearest Neighbour Algorithm and Genetic Algorithm in Solving Travelling Salesman Problem

A Comparative Study Of Nearest Neighbour Algorithm and Genetic Algorithm in Solving Travelling Salesman Problem

... the travelling salesman problem. With this problem, the salesman starts in a random city and repeatedly visits the nearest city until all cities have been ...

5

Task Scheduling in Cloud Computing using Credit Based Cluster Travelling Salesman problem

Task Scheduling in Cloud Computing using Credit Based Cluster Travelling Salesman problem

... as travelling salesman problem (TSP) can be converted into a cluster distribution service clouds , like cluster travelling sales man problem (CTSP) by clustering so that it can be ...

7

Enhancing Particle Swarm Optimization Using Opposite Gradient Search for Travelling Salesman Problem

Enhancing Particle Swarm Optimization Using Opposite Gradient Search for Travelling Salesman Problem

... This paper presents an approach for solving travelling salesman problem based on improved particle swarm optimization, called FOGS-PSO. This proposed algorithm contributed two considerable issues. ...

11

Show all 9639 documents...

Related subjects