Perancangan Rute Optimal Wahana di Wisata Bahari Lamongan dengan Algoritma Dijkstra dan Genetika

Nabili, Firyal Wishal (2025) Perancangan Rute Optimal Wahana di Wisata Bahari Lamongan dengan Algoritma Dijkstra dan Genetika. Undergraduate thesis, UPN Veteran Jawa Timur.

	Text (Cover) 21081010301-Cover.pdf Download (1MB)
	Text (Bab 1) 21081010301-Bab 1.pdf Download (216kB)
	Text (Bab 2) 21081010301-Bab 2.pdf Restricted to Repository staff only until 4 December 2027. Download (384kB)
	Text (Bab 3) 21081010301-Bab 3.pdf Restricted to Repository staff only until 4 December 2027. Download (643kB)
	Text (Bab 4) 21081010301-Bab 4.pdf Restricted to Repository staff only until 4 December 2027. Download (1MB)
	Text (Bab 5) 21081010301-Bab 5.pdf Download (148kB)
	Text (Daftar pustaka) 21081010301-Daftar pustaka.pdf Download (221kB)
	Text (Lampiran) 210810301-Lampiran.pdf Restricted to Repository staff only until 4 December 2027. Download (164kB)

Abstract

This study applies the integration of the Dijkstra algorithm and the Genetic Algorithm to find the shortest routes in Wisata Bahari Lamongan. The aim is to obtain optimal travel paths for different visitor categories: children, adults, and the elderly. The Dijkstra algorithm calculates the shortest paths between nodes and generates a distance matrix used as input for GA optimization. The Genetic Algorithm then optimizes the route through population initialization, selection, crossover, mutation, and elitism to maintain the best individuals, followed by a 2-Opt local search to refine the final route and reduce the chance of local optima. Among twelve experimental trials, the third experiment achieved the best performance with a crossover rate of 0.7, mutation rate of 0.05, and a population size of 100, with convergence around generation 110 (children), 220 (adults), and 90 (elderly). The results show that combining Dijkstra and GA provides higher efficiency than using GA alone, achieving an average distance reduction of 30–50%. The optimal routes obtained were 184,750 cm for children (saving 27,370 cm), 197,340 cm for adults (saving 15,120 cm), and 180,190 cm for the elderly (saving 32,270 cm). These findings confirm that the combined Dijkstra–GA approach can produce more stable and efficient solutions, which can be implemented in a web-based system to assist visitors in finding the best routes within the tourist area.

Item Type:

Thesis (Undergraduate)

Contributors:

Contribution	Contributors	NIDN/NIDK	Email
Thesis advisor	Puspaningrum, Eva Yulia	NIDN0005078908	evapuspaningrum.if@upnjatim.ac.id
Thesis advisor	Nurlaili, Afina Lina	NIDN1993121 3202203 2010	afina.lina.if@upnjatim.ac.id

Subjects:

T Technology > T Technology (General)

Divisions:

Faculty of Computer Science > Departemen of Informatics

Depositing User:

Nabili Firyal Wishal

Date Deposited:

04 Dec 2025 07:00

Last Modified:

04 Dec 2025 07:00

URI:

https://repository.upnjatim.ac.id/id/eprint/47829