Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)

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 plan...

Full description

Saved in:
Bibliographic Details
Main Author: Yoesoef, Nalafi Ierawan, -
Format: Theses and Dissertations NonPeerReviewed
Language:Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Published: 2021
Subjects:
Online Access:https://repository.unair.ac.id/111415/4/1.%20HALAMAN%20JUDUL.pdf
https://repository.unair.ac.id/111415/2/2.%20ABSTRAK.pdf
https://repository.unair.ac.id/111415/1/3.%20DAFTAR%20ISI.pdf
https://repository.unair.ac.id/111415/3/4.%20BAB%20I%20PENDAHULUAN.pdf
https://repository.unair.ac.id/111415/9/5.%20BAB%20II%20TINJAUAN%20PUSTAKA.pdf
https://repository.unair.ac.id/111415/6/6.%20BAB%20III%20METODE%20PENELITIAN.pdf
https://repository.unair.ac.id/111415/10/7.%20BAB%20IV%20PEMBAHASAN.pdf
https://repository.unair.ac.id/111415/8/8.%20BAB%20V%20PENUTUP.pdf
https://repository.unair.ac.id/111415/5/9.%20DAFTAR%20PUSTAKA.pdf
https://repository.unair.ac.id/111415/11/10.%20LAMPIRAN.pdf
https://repository.unair.ac.id/111415/7/11.%20PERMOHONAN%20EMBARGO.pdf
https://repository.unair.ac.id/111415/
http://www.lib.unair.ac.id
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universitas Airlangga
Language: Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
id id-langga.111415
record_format dspace
spelling id-langga.1114152021-10-18T10:24:02Z https://repository.unair.ac.id/111415/ Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP) Yoesoef, Nalafi Ierawan, - QA1-939 Mathematics 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. 2021 Thesis NonPeerReviewed text id https://repository.unair.ac.id/111415/4/1.%20HALAMAN%20JUDUL.pdf text id https://repository.unair.ac.id/111415/2/2.%20ABSTRAK.pdf text id https://repository.unair.ac.id/111415/1/3.%20DAFTAR%20ISI.pdf text id https://repository.unair.ac.id/111415/3/4.%20BAB%20I%20PENDAHULUAN.pdf text id https://repository.unair.ac.id/111415/9/5.%20BAB%20II%20TINJAUAN%20PUSTAKA.pdf text id https://repository.unair.ac.id/111415/6/6.%20BAB%20III%20METODE%20PENELITIAN.pdf text id https://repository.unair.ac.id/111415/10/7.%20BAB%20IV%20PEMBAHASAN.pdf text id https://repository.unair.ac.id/111415/8/8.%20BAB%20V%20PENUTUP.pdf text id https://repository.unair.ac.id/111415/5/9.%20DAFTAR%20PUSTAKA.pdf text id https://repository.unair.ac.id/111415/11/10.%20LAMPIRAN.pdf text id https://repository.unair.ac.id/111415/7/11.%20PERMOHONAN%20EMBARGO.pdf Yoesoef, Nalafi Ierawan, - (2021) Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP). Skripsi thesis, UNIVERSITAS AIRLANGGA. http://www.lib.unair.ac.id
institution Universitas Airlangga
building Universitas Airlangga Library
continent Asia
country Indonesia
Indonesia
content_provider Universitas Airlangga Library
collection UNAIR Repository
language Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
Indonesian
topic QA1-939 Mathematics
spellingShingle QA1-939 Mathematics
Yoesoef, Nalafi Ierawan, -
Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)
description 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.
format Theses and Dissertations
NonPeerReviewed
author Yoesoef, Nalafi Ierawan, -
author_facet Yoesoef, Nalafi Ierawan, -
author_sort Yoesoef, Nalafi Ierawan, -
title Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)
title_short Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)
title_full Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)
title_fullStr Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)
title_full_unstemmed Hybrid Firefly Algorithm (FA) dan Flower Pollination Algorithm (FPA) untuk Menyelesaikan Multi-Trip Vehicle Routing Problem (MTVRP)
title_sort hybrid firefly algorithm (fa) dan flower pollination algorithm (fpa) untuk menyelesaikan multi-trip vehicle routing problem (mtvrp)
publishDate 2021
url https://repository.unair.ac.id/111415/4/1.%20HALAMAN%20JUDUL.pdf
https://repository.unair.ac.id/111415/2/2.%20ABSTRAK.pdf
https://repository.unair.ac.id/111415/1/3.%20DAFTAR%20ISI.pdf
https://repository.unair.ac.id/111415/3/4.%20BAB%20I%20PENDAHULUAN.pdf
https://repository.unair.ac.id/111415/9/5.%20BAB%20II%20TINJAUAN%20PUSTAKA.pdf
https://repository.unair.ac.id/111415/6/6.%20BAB%20III%20METODE%20PENELITIAN.pdf
https://repository.unair.ac.id/111415/10/7.%20BAB%20IV%20PEMBAHASAN.pdf
https://repository.unair.ac.id/111415/8/8.%20BAB%20V%20PENUTUP.pdf
https://repository.unair.ac.id/111415/5/9.%20DAFTAR%20PUSTAKA.pdf
https://repository.unair.ac.id/111415/11/10.%20LAMPIRAN.pdf
https://repository.unair.ac.id/111415/7/11.%20PERMOHONAN%20EMBARGO.pdf
https://repository.unair.ac.id/111415/
http://www.lib.unair.ac.id
_version_ 1715207658674323456