Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)
Total View This Week7
Total View This Week7
Institusion
Universitas Airlangga
Author
Yoesoef, Nalafi Ierawan, -
Subject
QA1-939 Mathematics
Datestamp
2021-10-18 10:24:02
Abstract :
Multi-Trip Vehicle Routing Problem (MTVRP is a variation of the Vehicle Routing Problem (VRP) with multi-trip expansion for each vehicle that will distribute to customers and there are additional capacity and time constraints with each vehicle being able to travel more than one route during the planning period. The aim is to determine an effective route and time to reduce transportation costs by meeting existing constraints. Flower Pollination Algorithm (FPA) is an algorithm that is inspired by the process of pollinating flowers in plants. There are two main processes contained in this algorithm, namely pollination. global and local pollination which is determined based on switch probability which is located at interval [0,1]. Firefly Algorithm is an algorithm that is inspired by the behavior of fireflies, where each firefly is attracted to move closer to the firefly that emits light brighter than itself. Dig language In order to complete this thesis, the Java programming language is implemented on 2 data, namely, small data (9 customers), and big data (100 customers). The best results are obtained from the application of the firefly algorithm and the flower algorithm for small data obtained 1355 km, and large data obtained 3122 km. Based on the results of the running program, it shows that the greater the maximum iteration parameter, the better the objective function value; the greater the number of popsize parameters, the better the objective function value tends to be; and the smaller the switch probability parameter, the better the objective function value tends to be.
Multi-Trip Vehicle Routing Problem (MTVRP is a variation of the Vehicle Routing Problem (VRP) with multi-trip expansion for each vehicle that will distribute to customers and there are additional capacity and time constraints with each vehicle being able to travel more than one route during the planning period. The aim is to determine an effective route and time to reduce transportation costs by meeting existing constraints. Flower Pollination Algorithm (FPA) is an algorithm that is inspired by the process of pollinating flowers in plants. There are two main processes contained in this algorithm, namely pollination. global and local pollination which is determined based on switch probability which is located at interval [0,1]. Firefly Algorithm is an algorithm that is inspired by the behavior of fireflies, where each firefly is attracted to move closer to the firefly that emits light brighter than itself. Dig language In order to complete this thesis, the Java programming language is implemented on 2 data, namely, small data (9 customers), and big data (100 customers). The best results are obtained from the application of the firefly algorithm and the flower algorithm for small data obtained 1355 km, and large data obtained 3122 km. Based on the results of the running program, it shows that the greater the maximum iteration parameter, the better the objective function value; the greater the number of popsize parameters, the better the objective function value tends to be; and the smaller the switch probability parameter, the better the objective function value tends to be.
Download
book
BibTex
Latex, Jabref
cloud_download
Original Resource
url resource Institution
