Finding the Shortest Path to the Hospital in Bogor City using Genetic Algorithm
Mulyati1, Irma Anggraeni2
1Mulyati, Department of Computer Science, Faculty of Mathematics and Sciences, Pakuan University, Indonesia.
2Irma Anggraeni, Department of Computer Science, Faculty of Mathematics and Sciences, Pakuan University, Indonesia.
Manuscript received on 02 August 2019 | Revised Manuscript received on 25 August 2019 | Manuscript Published on 05 September 2019 | PP: 94-96 | Volume-8 Issue-2S7 July 2019 | Retrieval Number: B10200782S719/2019©BEIESP | DOI: 10.35940/ijrte.B1020.0782S719
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Bogor city is one of the cities in the province of West Java, there are 13 hospitals located in the region. There are many routes that can be taken to get to the hospital. If there is an emergency or traffic accident, the people has difficult to find which route is closest to the hospital. One of the algorithms used to solve the shortest path is genetic algorithm. Genetic algorithm is an optimization algorithm of simulating biological evolution. By using the concept of biological evolution, it will get the output that is a combination of routes that should be taken to optimize the timing.
Keywords: Genetic Algorithm, Hospital, Shortest Path.
Scope of the Article: Algorithm Engineering