implementasi algoritma cluster first – route second untuk penyelesaian vehicle routing problem with soft time windows (studi kasus : depot air minum isi ulang “way”)

Mirza, Iskandar (2012) implementasi algoritma cluster first – route second untuk penyelesaian vehicle routing problem with soft time windows (studi kasus : depot air minum isi ulang “way”). Bachelor Thesis thesis, Universitas Multimedia Nusantara.

[img]
Preview
Text
BAB V.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img] Text
HALAMAN AWAL.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB)
[img]
Preview
Text
DAFTAR PUSTAKA.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (913kB) | Preview
[img]
Preview
Text
BAB II.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img] Text
LAMPIRAN.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB)
[img]
Preview
Text
BAB I.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img]
Preview
Text
BAB III.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img] Text
BAB IV.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (2MB)

Abstract

Drinking water depot business requires vehicle management for delivery of orders. In this study the author has a purpose, namely to design and create application that can solve Vehicle Routing Problem with Soft Time Windows (VRPSTW). This research presents the creation of application with heuristic algorithm cluster first – route second. Application built using C # programming language and Ms. Access database. Consumers are first grouped into clusters, then served with the order of distance from the nearest depot notified in advance. Results of testing the application indicates that the delivery process is more effective than without the use of application.

Item Type: Thesis (Bachelor Thesis)
Subjects: 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming > 005.2 Programming for Specific Computers, Algorithm, HTML, PHP, java, C++
Divisions: Faculty of Engineering & Informatics > Informatics
Depositing User: mr admin umn
Date Deposited: 31 Jan 2020 02:48
Last Modified: 18 Aug 2023 08:04
URI: https://kc.umn.ac.id/id/eprint/12110

Actions (login required)

View Item View Item