Universitas Syiah Kuala | ELECTRONIC THESES AND DISSERTATION

Electronic Theses and Dissertation

Universitas Syiah Kuala

    SKRIPSI
RAIYAN FITRAH, OPTIMASI RUTE PENGANTARAN PAKET SICEPAT EKSPRES MENGGUNAKAN ALGORITMA CHEAPEST INSERTION HEURISTIC DAN KOMBINASI ALGORTIMA BRANCH AND BOUND-CHEAPEST INSERTION HEURISTIC. Banda Aceh Fakultas MIPA Matematika,2026

Penentuan rute pengantaran paket yang efisien berperan penting dalam meningkatkan kualitas layanan perusahaan ekspedisi melalui pengurangan waktu pengiriman, biaya operasional, dan penggunaan bahan bakar. pada sicepat ekspres banda aceh, penentuan rute masih bergantung pada pengalaman kurir sehingga belum menerapkan metode optimasi untuk memperoleh rute terpendek. oleh karena itu, penelitian ini bertujuan menentukan rute pengantaran paket yang optimal menggunakan algoritma cheapest insertion heuristic serta kombinasi algoritma branch and bound-cheapest insertion heuristic. penelitian ini menggunakan 12 titik lokasi yang disimbolkan dengan huruf



Abstract

Determining an efficient package delivery route is an important factor in improving the service quality of courier companies. An optimal route can reduce delivery time, operational costs, and fuel consumption. At SiCepat Express Banda Aceh, delivery routes are still primarily determined based on couriers' experience rather than by applying optimization methods to identify the shortest route. Therefore, this study aims to determine the optimal package delivery route using the Cheapest Insertion Heuristic algorithm and a combination of the Branch and Bound-Cheapest Insertion Heuristic algorithms. This study employed 12 locations, represented by the letters A through L, consisting of one SiCepat Express office as the starting and ending point and 11 package delivery destinations. The distance data between locations were obtained from Google Maps and modeled as a weighted graph. The data were then processed using the Cheapest Insertion Heuristic algorithm and the combined Branch and Bound–Cheapest Insertion Heuristic algorithm to determine the optimal delivery route. The results show that the Cheapest Insertion Heuristic algorithm produced the route A–C–H–G–D–I–J–K–L–F–E–B–A with a total travel distance of 25.65 km. Meanwhile, the combination of the Branch and BoundCheapest Insertion Heuristic algorithms generated the route A–C–D–I–H–G–J–K–L–F–E–B–A with the same total travel distance of 25.65 km. Although the sequence of visited locations differed, both methods yielded the same travel distance, indicating that they can be effectively applied to determine efficient package delivery routes at SiCepat Express Banda Aceh.



    SERVICES DESK