Open AccessImplementation of Modified Cheapest Insertion Heuristic on Generating Medan City Tourism Route
Author(s) -
Dian Rachmawati,
Wilyanto
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1566/1/012076
Subject(s) - heuristics , travelling salesman problem , heuristic , point (geometry) , tourism , computer science , mathematical optimization , sequence (biology) , mathematics , operations research , operations management , algorithm , engineering , geography , chemistry , biochemistry , geometry , archaeology
Arranging the sequence of places to visit is the common problem that tourists or foreigners encountered when visiting a new site, especially for foreigners that visit Medan City. This kind of case similar to Traveling Salesman Problem cases. Therefore we could use one of the modified TSP algorithm to solve it, which is Modified Cheapest Insertion Heuristics. The Modified Cheapest Insertion is a method to insert the cheapest weight starting from 2 points of place until all of the sites are being connected from the starting point until the endpoint. The strength of Modified Cheapest Insertion Heuristics is the calculation will remain stable even for a large number of inputs. In this research, all of the desired-to-visit places are being connected as a route.