• No results found

Traveling 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. ...

5

Generating subtour elimination constraints for the Traveling Salesman Problem

Generating subtour elimination constraints for the Traveling Salesman Problem

... THE TRAVELING SALESMAN PROBLEM : In our case, for the resolution we used exact methods [8], using a linear programming solver CPLEX version ...

5

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem

Particle Swarm Optimization to Solve Multiple Traveling Salesman Problem

... solving traveling salesman problem, the experimental results show the effectiveness and efficiency of the proposed ...the problem of each part’s (includes individual’s cooperation) influence ...

6

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

Proposed Algorithms To Solve Big Data Traveling Salesman Problem

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 ...

7

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

A NEW HEURISTIC ALGORITHM FOR MULTIPLE TRAVELING SALESMAN PROBLEM

... The Traveling Salesman Problem (TSP) is one of the most well-known and studied problems in the area of combinatorial optimization [1]. It aims to find the shortest tour or the tour with minimum cost ...

9

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

... the traveling salesman problem (TSP) and its generalizations such as the multiple traveling salesmen problem (MTSP) and the vehicle routing problem (VRP) (Yousefikhoshbakht, ...

13

Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem

Implementation of Fuzzy Intuitionistic Algorithm for Traveling Salesman Problem

... Traveling salesman problem is a NP hard problem in classical combinative Optimization that has intrigued mathematicians and computer scientists for ...a salesman have to sojourn m ...

7

Kombinasi Firefly Algorithm-Tabu Search untuk Penyelesaian Traveling Salesman Problem

Kombinasi Firefly Algorithm-Tabu Search untuk Penyelesaian Traveling Salesman Problem

... Abstrak—Traveling Salesman Problem (TSP) adalah masalah optimasi kombinatorial klasik dan memiliki peran dalam perencanaan, penjadwalan, dan pencarian pada bidang rekayasa dan ...

7

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

Improved Memetic Algorithm and Its Application on Traveling Salesman Problem

... The traveling salesman problem (TSP) could be described as the following question how to travel all the cities one by one for once time under the condition the distance is minimum ...TSP ...

5

A Rule Based Evolutionary Optimization Approach for the Traveling Salesman Problem

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 ...

18

Solving the Traveling Salesman Problem using Google Services and Simulated Annealing Algorithm

Solving the Traveling Salesman Problem using Google Services and Simulated Annealing Algorithm

... Goossaert, in the article [8] presented simulated annealing, an optimization technique aimed to find an approximation to the global minimum of a function. He explained how this technique applies to the traveling ...

10

A Method to Search Traveling Salesman Problem Backbones Based on GA and Frequency Graph

A Method to Search Traveling Salesman Problem Backbones Based on GA and Frequency Graph

... well-known, traveling salesman problem (TSP) is a famous NP-hard problem [1], which has attracted a lot of attention from researchers in various fields such as mathematics, computer science, ...

12

Ant Colony Optimization (ACO) For The Traveling Salesman Problem (TSP) Using Partitioning

Ant Colony Optimization (ACO) For The Traveling Salesman Problem (TSP) Using Partitioning

... optimization problem such as Job-Shop Scheduling Problem, Vehicle Routing Problem, Network Routing Problem, Multiple Knapsack Problem ...large problem of the TSP is partitioned ...

6

A reactive bone route algorithm for solving the traveling salesman problem

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 ...

13

Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem

Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem

... This paper introduces ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In ACS, a set of cooperating agents called ants cooperate to find good ...

24

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 ...

98

Solution of a Large-Scale Traveling-Salesman Problem

Solution of a Large-Scale Traveling-Salesman Problem

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

22

16.4 Traveling Salesman Problem

16.4 Traveling Salesman Problem

... Notes: The book by Applegate, Bixby, Chvatal, and Cook [ABCC07] documents the techniques they used in their record-setting TSP solvers, as well as the theory and history behind the problem. Gutin and Punnen [GP07] ...

5

COMPREHENSIVE STUDY OF ANT COLONIES FOR THE TRAVELING SALESMAN PROBLEM AND COMPARE EFFICIENCY AND PERFORMANCE WITH BASIC ALGORITHM

COMPREHENSIVE STUDY OF ANT COLONIES FOR THE TRAVELING SALESMAN PROBLEM AND COMPARE EFFICIENCY AND PERFORMANCE WITH BASIC ALGORITHM

... optimization problem. The traveling salesman problem (TSP) is the problem of finding a shortest closed tour which visits all the cities in a given ...

8

Show all 9617 documents...

Related subjects