Traveling Salesman
Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem
... Zhang and Xiong (2008):- This paper proposed an improved PSO algorithm based on the concepts of Adjustment Operator and Adjustment Sequence. For solving traveling salesman problem, the experimental results ...
6
Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem
... [14] Mei,H.T, Hua,J. And Wang,Y. (2016) Intuitionistic Fuzzy Hybrid Discrete Particle Swarm Optimization for solving Traveling salesman problem, Proc. Of Fifth International Conf. on Advanced Materials and ...
7
A Rule Based Evolutionary Optimization Approach for the Traveling Salesman Problem
... From the work conducted to date, many of the most promising approaches to solving the traveling salesman problem have involved the use of heuristics. The ability to imbed an arbitrary set of heuristics into ...
18
A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm
... Many of the current methods by which the traveling salesman problem is solved, suffer from some considerable but overlooked problems. As the TSP has several practical applications, the accurate and fast ...
22
A reactive bone route algorithm for solving the traveling salesman problem
... The 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 applications ...
13
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 NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM
... The Multiple Traveling Salesman Problem (mTSP) is developed on the TSP. Unlike the TSP, there are m salesmen in the mTSP. In the mTSP, each city in a given set of n cities is divided into m tours by ...
9
Modified Ant Colony Optimization for Solving Traveling Salesman Problem
... Abstract -- This paper presents a new algorithm for solving the Traveling Salesman Problem (NP- hard problem) using pheromone of ant colony depends on the pheromone and path between cites. TSP is a problem ...
5
Phrase Based Statistical Machine Translation as a Traveling Salesman Problem
... any Traveling Salesman Problem may be reformulated as an instance of a (simplistic) SMT decoding task, and while cer- tain techniques used for TSP were then adapted to word-based SMT decoding (Germann et ...
9
Improved Memetic Algorithm and Its Application on Traveling Salesman Problem
... The traveling salesman problem is a classic NP-hard combinatorial optimization problem which is important in operations research and theoretical computer ...
5
Parameter Optimization in GA for Large scale Traveling Salesman Problem
... The earliest description of the TSP problem was the 1759 Euler Study Knight travel problem, that is, for 64 squares in the chess board, visit 64 squares once and only once, and eventually return to the starting point. ...
8
Modified Local Search Heuristics for the Symmetric Traveling Salesman Problem
... Abstract. In this paper, we investigate some modified local search (LS) heuristics for the solution of symmetric traveling salesman problem (TSP). These modifications are mainly due to the use of extended ...
14
Proposed Algorithms To Solve Big Data Traveling Salesman Problem
... the traveling salesman problem was from Euler in 1759 whose problem was to move a knight to every position on a chess board exactly once ...The traveling salesman first gained fame in a book ...
7
A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles
... In this survey, we reviewed the most recent studies (i.e., papers that have been published for at most four years). These articles introduced extended models of TSP or VRP optimization problems and some corresponding ...
30
AMR to text generation as a Traveling Salesman Problem
... usually has multiple corresponding sentences, and syntactic structure and function words are abstracted away when transforming a sentence into AMR (Ba- narescu et al., 2013). There has been work deal- ing with ...
6
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
... an s-t walk of minimum length that visits all the vertices in V . If ` satisfies the asymmetric triangle inequality, the problem is equivalent to that of finding an s-t path of minimum length that visits all the ...
13
On the recoverable robust traveling salesman problem
... the traveling salesman problem, in which edge lengths are uncertain and a bounded number of them may become larger than in the nominal case, but we are allowed to use a recovery action once a scenario is ...
14
Ant Colony Optimization (ACO) For The Traveling Salesman Problem (TSP) Using Partitioning
... The ant colony optimization first introduced in 1991 by A. Colorni M. Dorigo, and V. Mahiezzo [3]. The algorithm is simulated with the behavior of the real ants. The real ants having the capability to find the shortest ...
6
Dynamic version of Traveling Salesman Problem
... of Traveling salesman problem, the targets which have to be visited are stationary but in real life there are large numbers of instances where the targets are in ...single salesman (moving with the ...
10
Characterization of the probabilistic traveling salesman problem
... original traveling salesman problem (TSP) is to find the shortest tour around n cities, in which each city is visited ...the traveling salesman problem began with Beardwood et ...
11