Optimasi Vehicle Routing Problem With Multiple Trips and Intermediate Facility (VRPMTIF) Menggunakan Metode Nearest Neighbour (NN) dan A*

ADE NOVIANTI HIDAYAH, NIM. 13610008 (2018) Optimasi Vehicle Routing Problem With Multiple Trips and Intermediate Facility (VRPMTIF) Menggunakan Metode Nearest Neighbour (NN) dan A*. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

[img]
Preview
Text (Optimasi Vehicle Routing Problem With Multiple Trips and Intermediate Facility (VRPMTIF) Menggunakan Metode Nearest Neighbour (NN) dan A*)
13610008_BAB-I_BAB-VI_DAFTAR-PUSTAKA.pdf - Published Version

Download (6MB) | Preview
[img] Text (Optimasi Vehicle Routing Problem With Multiple Trips and Intermediate Facility (VRPMTIF) Menggunakan Metode Nearest Neighbour (NN) dan A*)
13610008_BAB-II_SAMPAI_SEBELUM-BAB-TERAKHIR.pdf - Published Version
Restricted to Registered users only

Download (10MB)

Abstract

Vehicle routing problem (VRP) is a matter of determining vehicle routes that play an important role in the industrial world, namely the problem of logistics and transportation management. There are various VRP models that are developing, one of which is the Vehicle Routing Problem with Multiple Trips and Intermediate Facility (VRPMTIF) which is discussed in this study by taking the problem of optimization of waste transport routes in the Jatinom Sector in Klaten City. This study compares the Nearest Neighbor Method and Method A * in the process of forming a route. Based on the number of routes, both methods produce three trips in one route and carry 18 m3 of 14 polling stations. Based on the effectiveness of distance and time taken, the route in the Nearest Neighbor Method produces the least total distance and visit time compared to Method A *. Where the route with Nearest Neighboring method traveled 111.84 km, with a travel time of 275.76 minutes, while the route on Method A * traveled as far as 123.65 km and travel time was 293.475 minutes. These results prove that, the route formed using the Nearest Neighbor Method is more effective 11.81 km and the time needed is also more effective 17.715 minutes.

Item Type: Thesis (Skripsi)
Additional Information: Dr. M. Wakhid Musthofa, M. Si
Uncontrolled Keywords: Nearest Neighbour (NN) and A*, Vehicle Routing Problem with Multiple Trips and Intermediate Facility (VRPMTIF), Route.
Subjects: Matematika
Divisions: Fakultas Sains dan Teknologi > Matematika (S1)
Depositing User: Drs. Mochammad Tantowi, M.Si.
Date Deposited: 08 Mar 2019 13:52
Last Modified: 08 Mar 2019 13:52
URI: http://digilib.uin-suka.ac.id/id/eprint/33655

Share this knowledge with your friends :

Actions (login required)

View Item View Item
Chat Kak Imum