A Mixed Heuristic Algorithm for Traveling Salesman Problem

2011 ◽  
Author(s):  
Yaowei Yan ◽  
Xiaoheng Zhao ◽  
Jia Xu ◽  
Zhongwen Xiao
Keyword(s):  
Traveling Salesman Problem ◽  
Heuristic Algorithm ◽  
Traveling Salesman

scholarly journals PENYELESAIAN MULTI TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA GENETIKA

2017 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
NI KADEK MAYULIANA ◽  
EKA N. KENCANA ◽  
LUH PUTU IDA HARINI
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Heuristic Algorithm ◽  
Minimum Distance ◽  
Processing Time ◽  
Traveling Salesman ◽  
Running Time ◽  
Shortest Route ◽  
Time Required

Genetic algorithm is a part of heuristic algorithm which can be applied to solve various computational problems. This work is directed to study the performance of the genetic algorithm (GA) to solve Multi Traveling Salesmen Problem (multi-TSP). GA is simulated to determine the shortest route for 5 to 10 salesmen who travelled 10 to 30 cities. The performance of this algorithm is studied based on the minimum distance and the processing time required for 10 repetitions for each of cities-salesmen combination. The result showed that the minimum distance and the processing time of the GA increase consistently whenever the number of cities to visit increase. In addition, different number of sales who visited certain number of cities proved significantly affect the running time of GA, but did not prove significantly affect the minimum distance.

An efficient heuristic algorithm for the bottleneck traveling salesman problem

OPSEARCH ◽  
2009 ◽  
Vol 46 (3) ◽  
pp. 275-288 ◽  
Author(s):  
Ravi Ramakrishnan ◽  
Prabha Sharma ◽  
Abraham P. Punnen
Keyword(s):  
Traveling Salesman Problem ◽  
Heuristic Algorithm ◽  
Traveling Salesman
Sign in / Sign up

Export Citation Format

Share Document