A Novel Metaheuristic for Travelling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem
The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, with travel costs among the cities. The objective is to minimize the sum of travel costs and penalties, while including in the tour enough cities to collect a minimum prize. This paper presents one solution procedure for...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملComparison of Different Heuristic, Metaheuristic, Nature Based Optimization Algorithms for Travelling Salesman Problem Solution
The Traveling Salesman Problem (TSP) is widely studied problems in combinatorial optimization. Many researches were made for that type of problem. This problem is known to be the NPhard problems that cannot be solve by conventional mathematical approach. It is also a sub problem of many areas. Different approaches are performing on it as a general test bench to find solution for NP-had problem....
متن کاملA Particle Swarm-based Metaheuristic to Solve the Travelling Salesman Problem
This paper describes a new metaheuristic technique to solve the travelling salesman problem based on particle swarm using guided local search. The main contribution of the paper is that is develops a particle swarm-based strategy to solve combinatorial optimization problems in general, and the TSP in particular. It first establishes the steps to be followed in the new method and then goes on to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Engineering
سال: 2013
ISSN: 2314-4882,2314-4890
DOI: 10.1155/2013/347825