IMPLEMENTASI ALGORITMA HILL CLIMBING DALAM OPTIMASI RUTE PERJALANAN PETUGAS SURVEI PERBAIKAN BANGUNAN

GUNAWAN, PRIO ARIEF (2025) IMPLEMENTASI ALGORITMA HILL CLIMBING DALAM OPTIMASI RUTE PERJALANAN PETUGAS SURVEI PERBAIKAN BANGUNAN. S1 thesis, Universitas Mercu Buana Jakarta.

Preview	Text (HAL COVER) 01 COVER.pdf Download (589kB) | Preview
	Text (BAB I) 02 BAB 1.pdf Restricted to Registered users only Download (92kB)
	Text (BAB II) 03 BAB 2.pdf Restricted to Registered users only Download (157kB)
	Text (BAB III) 04 BAB 3.pdf Restricted to Registered users only Download (31kB)
	Text (BAB IV) 05 BAB 4.pdf Restricted to Registered users only Download (1MB)
	Text (BAB V) 06 BAB 5.pdf Restricted to Registered users only Download (29kB)
	Text (DAFTAR PUSTAKA) 07 DAFTAR PUSTAKA.pdf Restricted to Registered users only Download (98kB)
	Text (LAMPIRAN) 08 LAMPIRAN.pdf Restricted to Registered users only Download (1MB)

Abstract

Route efficiency is a significant challenge in building repair surveys that involve visiting multiple locations. This study aims to implement the Hill Climbing algorithm, specifically the Steepest Ascent Hill Climbing method, to determine the shortest route in the context of building repair surveys. The algorithm is applied using a simulation-based approach in Node.js with randomly generated survey location datasets. The simulation results show that the Hill Climbing algorithm effectively optimizes travel distance with efficient execution time. Evaluations based on total travel distance and execution time demonstrate the algorithm's ability to produce near-optimal solutions. This research is expected to contribute to the development of heuristic-based systems for route optimization in construction and logistics. Keywords: Hill Climbing, Shortest Route, Route Optimization, Building Repair Surveys, Heuristic Algorithm Efisiensi rute merupakan salah satu tantangan dalam survei perbaikan bangunan yang melibatkan kunjungan ke banyak lokasi. Penelitian ini bertujuan untuk mengimplementasikan algoritma Hill Climbing, khususnya metode Steepest Ascent Hill Climbing, untuk menentukan rute terpendek dalam konteks survei perbaikan bangunan. Algoritma ini diterapkan menggunakan simulasi berbasis Node.js dengan dataset lokasi survei yang dirancang secara acak. Hasil simulasi menunjukkan bahwa algoritma Hill Climbing efektif dalam mengoptimalkan jarak tempuh dengan waktu eksekusi yang efisien. Evaluasi dilakukan berdasarkan total jarak tempuh dan waktu eksekusi, menunjukkan kemampuan algoritma dalam menghasilkan solusi yang mendekati optimal. Penelitian ini diharapkan dapat memberikan kontribusi dalam pengembangan sistem berbasis heuristik untuk optimasi rute di bidang konstruksi dan logistik. Kata kunci: Hill Climbing, Rute Terpendek, Optimasi Rute, Survei Perbaikan Bangunan, Algoritma Heuristik

Item Type:	Thesis (S1)
Call Number CD:	FIK/INFO. 25 166
NIM/NIDN Creators:	41521110069
Uncontrolled Keywords:	Hill Climbing, Rute Terpendek, Optimasi Rute, Survei Perbaikan Bangunan, Algoritma Heuristik
Subjects:	000 Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 000. Computer Science, Information and General Works/Ilmu Komputer, Informasi, dan Karya Umum > 004 Data Processing, Computer Science/Pemrosesan Data, Ilmu Komputer, Teknik Informatika 500 Natural Science and Mathematics/Ilmu-ilmu Alam dan Matematika > 510 Mathematics/Matematika > 518 Numerical Analysis/Analisis Numerik, Analisa Numerik > 518.1 Algorithms/Algoritma 700 Arts/Seni, Seni Rupa, Kesenian > 740 Drawing and Decorative Art/Menggambar dan Seni Dekorasi > 747 Interior Decoration/Dekorasi Interior, Desain Interior > 747.8 Decoration of Specific Types of Buildings/Dekorasi Bangunan Tertentu
Divisions:	Fakultas Ilmu Komputer > Informatika
Depositing User:	khalimah
Date Deposited:	26 Aug 2025 08:33
Last Modified:	26 Aug 2025 08:33
URI:	http://repository.mercubuana.ac.id/id/eprint/97114

Actions (login required)

View Item