Analisis Performansi Chaotic Maps Pada Flower Pollination Algorithm Untuk Menyelesaikan Vehicle Routing Problem With Time Windows

Rakhmawati, Ismi Yayuk (2024) Analisis Performansi Chaotic Maps Pada Flower Pollination Algorithm Untuk Menyelesaikan Vehicle Routing Problem With Time Windows. Masters thesis, Institut Teknologi Sepuluh Nopember.

Text 6010211001-Master_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2026. Download (2MB) | Request a copy

Abstract

Vehicle Routing Problem with Time Windows (VRPTW) merupakan suatu permasalahan penentuan rute kendaraan yang digunakan untuk melayani pelanggan yang melibatkan lebih dari satu kendaraan, sehingga diperoleh rute dengan jarak minimum tanpa melanggar kendala kapasitas muatan kendaraan dan rentang waktu yang dimiliki oleh pelanggan untu menerima pelayanan. Flower Pollination Algorithm (FPA) merupakan salah satu algoritma yang terinspirasi dari proses penyerbukan bunga pada tanaman. Dalam FPA, terdapat dua langkah kunci yaitu penyerbukan global dan penyerbukan lokal yang ditentukan oleh switch probability, p E [0,1]. Pada penelitian ini FPA dimodifikasi dengan Chaotic Maps untuk menghadirkan strategi yang berbeda. Logistic, iterative, sine, tent, and singer maps merupakan jenis Chaotic Maps yang digunakan pada penelitian ini. Tiga jenis dataset, kecil, sedang dan besar akan diuji. Pada penelitian ini Algoritma FPA kombinasi Chaotic Maps jenis Logistic diklaim memiliki performa yang paling baik diantara seluruh algoritma yang diuji. Analisis dalam penelitian ini menggunakan Average Relative Percentage Deviation (ARPD) dan Rata-rata Running Time.
=================================================================================================================================
Vehicle Routing Problem with Time Windows (VRPTW) is a vehicle route deciding problem that is used in order to serve customer who involved more than one vehicle with a limited time, so as a minimum distance route is obtained without disobeying vehicle capacity cargo restriction and time range. Flower Pollination Algorithm (FPA) is an algorithm which inspires from nature that is flower pollination process toward a plant. Within an FPA, there are two main steps to use, they are global flower pollination and local flower pollination. Those two steps are determined by using switch probability. In this research, FPA was modified with Chaotic Maps to present a different strategy. Logistic, iterative, sine, tent, and singer maps are the types of Chaotic Maps used in this research. Three types of datasets, small, medium and large will be tested. In this research, the FPA algorithm combined with Logistic type Chaotic Maps is claimed to have the best performance among all the algorithms tested. The analysis in this study uses Average Relative Percentage Deviation (ARPD) and Average Running Time.

Item Type:	Thesis (Masters)
Uncontrolled Keywords:	Vehicle Routing Problem, Time Windows, Chaotic Maps, Flower Polllination Algorithm
Subjects:	T Technology > T Technology (General) > T57.74 Linear programming
Divisions:	Faculty of Industrial Technology and Systems Engineering (INDSYS) > Industrial Engineering > 26101-(S2) Master Thesis
Depositing User:	Ismi Yayuk Rakhmawati
Date Deposited:	15 Jul 2024 07:02
Last Modified:	15 Jul 2024 07:02
URI:	http://repository.its.ac.id/id/eprint/108297

Actions (login required)

View Item