OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) MENGGUNAKAN METODE VARIABLE NEIGHBORHOOD SEARCH (VNS)

SYAHFITRI, MUNAWAROH and Yunita, Yunita and Primanita, Anggina (2024) OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) MENGGUNAKAN METODE VARIABLE NEIGHBORHOOD SEARCH (VNS). Undergraduate thesis, Sriwijaya University.

	Text RAMA_55021_09021282025107.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (24MB) | Request a copy
	Text RAMA_55021_09021282025107_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (4MB) | Request a copy
	Text RAMA_55021_09021282025107_0006068305_0206088901_01_front_ref .pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (6MB)
	Text RAMA_55021_09021282025107_0006068305_0206088901_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (5MB) | Request a copy
	Text RAMA_55021_09021282025107_0006068305_0206088901_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (5MB) | Request a copy
	Text RAMA_55021_09021282025107_0006068305_0206088901_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (4MB) | Request a copy
	Text RAMA_55021_09021282025107_0006068305_0206088901_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_55021_09021282025107_0006068305_0206088901_06.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (653kB) | Request a copy
	Text RAMA_55021_09021282025107_0006068305_0206088901_07_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (942kB) | Request a copy
	Text RAMA_55021_09021282025107_0006068305_0206088901_08_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (91kB) | Request a copy

Abstract

The distribution of goods in the logistics sector faces challenges in optimizing distance, time, and delivery route efficiency. The Vehicle Routing Problem (VRP), including its variant VRPTW, which considers time constraints, is an effective approach to address these challenges. This study applies the Variable Neighborhood Search (VNS) algorithm as a heuristic method to solve the VRPTW. VNS leverages diverse solution exploration and local search to enhance solution quality. Using the Gehring-Homberger dataset, the method achieved a 15.16% improvement in distance efficiency, with a slight time decrease of 0.37%. The results demonstrate that the VNS algorithm can produce near-optimal solutions, with efficiency influenced by initial solutions and iterations. This study contributes to logistics optimization and opens opportunities for further development, such as integrating other methods or applying the approach to larger, more complex datasets

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	VRP, VRPTW, VNS, Distribusi Barang Logistik
Subjects:	Q Science > Q Science (General) > Q1-295 General
Divisions:	09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User:	Munawaroh Syahfitri
Date Deposited:	13 Jan 2025 03:09
Last Modified:	13 Jan 2025 04:45
URI:	http://repository.unsri.ac.id/id/eprint/164110

Actions (login required)

View Item