Sainteks: Jurnal Sain dan Teknik
Vol 5 No 1 (2023): Maret

Genetic Algorithm for Improving Route of Travelling Salesman Problem Generated by Savings Algorithm

Muhammad Ardhya Bisma (Unknown)
Ekra Sanggala (Unknown)

Article Info

Publish Date
26 Mar 2023

Abstract

Travelling Salesman Problem (TSP) is the problem for finding the shortest route starting from start node then visiting number of nodes exactly once and finally go back to start node. If a TSP has a lot of nodes, it will be a NP-Hard Problem. Algorithms working based on heuristic and metaheuristic can be a solution for solving NP-Hard Problem. Savings Algorithm is a heuristic algorithm, so it’s solution may be not the best solution, therefore there is a chance to improve it. Genetic Algorithm is a metaheuristic that can be applied on many optimization problems, including TSP. This paper will discuss about GA for improving route TSP generated by Savings Algorithm. On testing of 10 instances, showing that algorithm based on GA can improve route of TSP generated by Savings Algorithm.

Copyrights © 2023




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Sainteks: Jurnal Sain dan Teknik
Website

Abbrev

sainteks

Publisher

Universitas Insan Cendekia Mandiri

Subject

Chemical Engineering, Chemistry & Bioengineering Chemistry Decision Sciences, Operations Research & Management Engineering Industrial & Manufacturing Engineering

Description

Sainteks is a scientific journal that publishes research papers encompassing all aspects of natural sciences, technology and engineering. This journal is published 2 (two) times a year (March and September) by the Faculty of Engineering UICM d/h UNBAR. The fields covered by the Sainteks Journal ...