GELS-GA: Hybrid metaheuristic algorithm for solving Multiple Travelling Salesman Problem

2014 ◽  
Author(s):  
Ali A. R. Hosseinabadi ◽  
Maryam Kardgar ◽  
Mohammad Shojafar ◽  
Shahaboddin Shamshirband ◽  
Ajith Abraham
Keyword(s):  
Travelling Salesman Problem ◽  
Metaheuristic Algorithm ◽  
Travelling Salesman ◽  
Hybrid Metaheuristic ◽  
Multiple Travelling Salesman Problem

scholarly journals Experimental Study of a Hybrid Genetic Algorithm for the Multiple Travelling Salesman Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Maha Ata Al-Furhud ◽  
Zakir Hussain Ahmed
Keyword(s):  
Genetic Algorithm ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Hybrid Genetic Algorithm ◽  
Travelling Salesman ◽  
Complex Optimization ◽  
Problem Instances ◽  
Search Approach ◽  
Multiple Travelling Salesman Problem

The multiple travelling salesman problem (MTSP), an extension of the well-known travelling salesman problem (TSP), is studied here. In MTSP, starting from a depot, multiple salesmen require to visit all cities so that each city is required to be visited only once by one salesman only. It is NP-hard and is more complex than the usual TSP. So, exact optimal solutions can be obtained for smaller sized problem instances only. For large-sized problem instances, it is essential to apply heuristic algorithms, and amongst them, genetic algorithm is identified to be successfully deal with such complex optimization problems. So, we propose a hybrid genetic algorithm (HGA) that uses sequential constructive crossover, a local search approach along with an immigration technique to find high-quality solution to the MTSP. Then our proposed HGA is compared against some state-of-the-art algorithms by solving some TSPLIB symmetric instances of several sizes with various number of salesmen. Our experimental investigation demonstrates that the HGA is one of the best algorithms.

scholarly journals PENYELESAIAN MULTIPLE TRAVELLING SALESMAN PROBLEM (MULTI-TSP) DENGAN METODE ORDER CROSSOVER DALAM ALGORITMA GENETIKA (Studi Kasus: Data Pelanggan Agen Surat Kabar di Kota Singkawang)

2019 ◽  
Vol 8 (2) ◽  
Author(s):  
Synthia Wulandari Helmi Yudhi
Keyword(s):  
Travelling Salesman Problem ◽  
Travelling Salesman ◽  
Random Generator ◽  
Roulette Wheel ◽  
Multiple Travelling Salesman Problem

Pendistribusian surat kabar oleh beberapa orang salesman pada suatu agen perlu meminimalisir rute yang ditempuh dari depot tertentu (agen surat kabar) menuju ke alamat pelanggan sehingga dapat diantar tepat waktu. Permasalahan dalam penentukan rute oleh beberapa orang salesman merupakan kasus dari Multiple Travelling Salesman Problem (Multi-TSP). Kasus Multi-TSP dapat diselesaikan dengan menggunakan Algoritma Genetika (AG). Algoritma genetika merupakan metode pencarian yang menggunakan tahapan operasi genetik dan seleksi alam. Pada proses penentukan rute terpendek dengan AG diperlukan langkah-langkah pembentukan populasi awal, penentuan nilai fitness, melakukan proses seleksi, melakukan operasi genetik (crossover dan mutasi), dan terbentuk individu baru. Proses AG menggunakan representasi permutasi untuk pendefinisian gen dalam pembentuk kromosom, pembentukan generasi awal menggunakan random generator, perhitungan nilai fitness. Proses seleksi dengan metode seleksi Roulette Wheel, operasi genetik (Order Crossover dan Swapping Mutation), sehingga diperoleh individu baru. Hasil simulasi dari agen surat kabar dengan probabilitas crossover sebesar 0,5 dan probabilitas mutasi sebesar 0,01 yang dilakukan oleh empat orang loper surat kabar ke 30 alamat pelanggan diperoleh rute terpendek dengan jarak 64,03 km pada generasi pertama. Kata Kunci : Rute Terpendek, Pelanggan Surat Kabar, Optimasi Kombinatorial

scholarly journals Seed based plant propagation algorithm for multiple travelling salesman problem

2018 ◽  
Vol 7 (3.3) ◽  
pp. 515
Author(s):  
S Kalaiarasi ◽  
P Sriramya
Keyword(s):  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
Routing Algorithm ◽  
Complex Problem ◽  
Travelling Salesman ◽  
Biologically Inspired ◽  
Plant Propagation ◽  
Propagation Algorithm ◽  
Biologically Inspired Algorithms ◽  
Multiple Travelling Salesman Problem

Multiple Travelling Salesman Problem is a complex problem in which route for a salesman is assigned to visit a city that has various hurdles such as congested road, damaged road, etc. In recent years biologically inspired algorithms are most widely used to solve many optimization problems. Here seed based plant propagation algorithm is applied for the multiple travelling salesman problem that is also a optimization problem, and the result is compared with a short-cut routing algorithm. The result shows that Seed based Propagation Algorithm is easy to implement since it has few parameters to be utilized and also time complexity is reduced when implemented in multiple travelling salesman problem.  

Sign in / Sign up

Export Citation Format

Share Document