• No results found

salesman problem

Information in the Traveling Salesman Problem

Information in the Traveling Salesman Problem

... We have introduced a new perspective from which to study the Traveling Salesman Problem. Besides using the total tour length as the cost function, we propose to also use the tour information content. The ...

5

Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem

Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem

... This work has discussed the Symmetric Traveling Salesman Problem under Intuitionistic Fuzzy environment. Here the range of acknowledgement is more advanced in Angelov’s method comparing to the proposed ...

7

A Rule Based Evolutionary Optimization Approach for the Traveling Salesman Problem

A Rule Based Evolutionary Optimization Approach for the Traveling Salesman Problem

... lesman problem over a time period of more than fifty years starting with the pioneering work of Dantzig ...the problem as a dis- crete linear programming problem and was severely limited in the ...

18

Fast Algorithm for the Travelling Salesman Problem and the Proof of P = NP

Fast Algorithm for the Travelling Salesman Problem and the Proof of P = NP

... travelling salesman problem is NP- complete, and Proposition 1 indicates that the proof of P = NP only requires the seeking of a language L in P for it, that is, a fast algorithm which can be executed on ...

9

A reactive bone route algorithm for solving the traveling salesman problem

A reactive bone route algorithm for solving the traveling salesman problem

... traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical ...

13

Density-Based Clustering Heuristics for the Traveling Salesman Problem

Density-Based Clustering Heuristics for the Traveling Salesman Problem

... The Traveling Salesman Problem (TSP) is one of the most ubiquitous combina- torial optimization problems. Given a set of cities, the objective of the TSP is to generate a solution that ultimately minimizes ...

98

Generating subtour elimination constraints for the Traveling Salesman Problem

Generating subtour elimination constraints for the Traveling Salesman Problem

... IV. RESOLUTION METHODS FOR THE TRAVELING SALESMAN PROBLEM : In our case, for the resolution we used exact methods [8], using a linear programming solver CPLEX version 12.6.3 which by default uses the method ...

5

A SURVEY ON DIFFERENT METHODS TO SOLVE TRAVELLING SALESMAN PROBLEM

A SURVEY ON DIFFERENT METHODS TO SOLVE TRAVELLING SALESMAN PROBLEM

... Travelling Salesman Problem (TSP), in which salesman wants to find a shortest possible tour by visiting every city exactly once and returns back to the city from where he ...[1].Travelling ...

5

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

... Traveling Salesman Problem (mTSP) is a combinatorial opti- mization problem in NP-hard ...different salesman in order to create m number of ...traveling salesman problem, ...

9

Maximal Triangle Free Graph and Travelling Salesman Problem

Maximal Triangle Free Graph and Travelling Salesman Problem

... for .They also discussed the perfect matching of this type of regular sub graph of various degrees and finally, they have forwarded an algorithm to solve the traveling salesman problem for different cases. ...

9

Bio inspired Computing Practice on Traveling Salesman Problem

Bio inspired Computing Practice on Traveling Salesman Problem

... On the appearances, CPP and TSP are two similar questions, as long as the carrier must send each location as a "City" on the line. Generally speaking, about successful postman each time want to 200-300 location, ...

5

Solution of a Large-Scale Traveling-Salesman Problem

Solution of a Large-Scale Traveling-Salesman Problem

... transportation problem, Activity Analysis of Production and Allocation ...traveling salesman problem, Technical Report P-510, RAND Corporation, Santa Monica, California, USA, ...

22

Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm

Solving Travelling Salesman Problem with an Improved Hybrid Genetic Algorithm

... We present an improved hybrid genetic algorithm to solve the two-dimensional Euc- lidean traveling salesman problem (TSP), in which the crossover operator is en- hanced with a local search. The proposed ...

10

SIMULATED ANNEALING FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

SIMULATED ANNEALING FOR SOLVING THE TRAVELLING SALESMAN PROBLEM

... optimization problem because it is a conceptually simple problem but hard to solve, it is an NP complete problem, A Classical Traveling Salesman Problem (TSP) can be defined as a ...

9

Survey on Ant Colony Optimization Using Travelling Salesman Problem

Survey on Ant Colony Optimization Using Travelling Salesman Problem

... . The influence of the parameters controlling the relative importance of pheromone trail versus visibility is also analyzed, and their choice is shown to have an impact on the expected runtime. In [12] discuss the Ant ...

5

Moving Target Travelling Salesman Problem using Genetic Algorithm

Moving Target Travelling Salesman Problem using Genetic Algorithm

... traveling salesman problem (TSP) was originated by the studies of two mathematicians Sir William Rowam Hamilton from Ireland and Thomas Penyngton Kirkman from Briton in the 18th ...

5

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

Modified Ant Colony Optimization Algorithm for Travelling Salesman Problem

... This paper proffer how an improved ant colony algorithm can solve traveling salesman problem competently and thus help in taking up other NP complex problems without any hitch. The improvements centralize ...

5

Exploiting planarity in separation routines for the symmetric travelling salesman problem

Exploiting planarity in separation routines for the symmetric travelling salesman problem

... The well-known Symmetric Traveling Salesman Problem (STSP) is the problem of finding a minimum weight Hamiltonian circuit in an edge-weighted undirected graph. Although the STSP is strongly N P-hard, ...

11

Proposed Algorithms To Solve Big Data Traveling Salesman Problem

Proposed Algorithms To Solve Big Data Traveling Salesman Problem

... traveling salesman problem was from Euler in 1759 whose problem was to move a knight to every position on a chess board exactly once ...traveling salesman first gained fame in a book written ...

7

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

... Memetic algorithm is one of heuristic algorithms which includes global search and local search. It is more appropriate for traveling salesman problem than some classical mathematical methods. In this paper ...

5

Show all 9378 documents...

Related subjects