implementasi algoritma cluster first – route second untuk penyelesaian vehicle routing problem with soft time windows (studi kasus depot air minum isi ulang “way”)
| Main Author: | Mirza, Iskandar |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2012
|
| Subjects: | |
| Online Access: |
http://kc.umn.ac.id/12110/1/BAB%20V.pdf http://kc.umn.ac.id/12110/2/HALAMAN%20AWAL.pdf http://kc.umn.ac.id/12110/3/DAFTAR%20PUSTAKA.pdf http://kc.umn.ac.id/12110/4/BAB%20II.pdf http://kc.umn.ac.id/12110/5/LAMPIRAN.pdf http://kc.umn.ac.id/12110/5/BAB%20I.pdf http://kc.umn.ac.id/12110/6/BAB%20III.pdf http://kc.umn.ac.id/12110/7/BAB%20IV.pdf http://kc.umn.ac.id/12110/ |
Daftar Isi:
- 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.