Anda belum login :: 23 Nov 2024 10:53 WIB
Detail
BukuPenentuan Rute Pendistribusian untuk Meminimasi Biaya Distribusi Menggunakan Algoritma Heurustik dan Pendekatan Simulasi (Studi Kasus : PT. Dharma Bhakti Mandiri)
Bibliografi
Author: RUFINA, THERESA WIDYASMARA ; Hidayat, Trifenaus Prabu (Advisor)
Topik: Traveling Salesman Problem (TSP); Vehicle Routing; distribution costs; the Minimum Spanning Tree; Biaya Distribusi
Bahasa: (ID )    
Penerbit: Program Studi Teknik Industri Fakultas Teknik Unika Atma Jaya     Tempat Terbit: Jakarta    Tahun Terbit: 2010    
Jenis: Theses - Undergraduate Thesis
Fulltext: Theresa Widyasmara Rufina's Undergraduated Theses.pdf (2.6MB; 83 download)
Ketersediaan
  • Perpustakaan Pusat (Semanggi)
    • Nomor Panggil: FTI-622
    • Non-tandon: tidak ada
    • Tandon: 1
 Lihat Detail Induk
Abstract
PT. Dharma Bhakti Mandiri represent a company that is engaged in the sale of equipment - medical equipment. Marketing areas are the focus of this research is the Greater Jakarta area with 26 consumers who are home sick. With the number of requests that come every day, often times a company can’t determine the proper distribution routes that could affect the swelling cost of distribution. Distribution problem is often called the Traveling salesman problem (TSP). TSP is a problem that find the optimal route on a graph that comes from a node to pass through all the nodes and return to the home node. TSP is closely associated with the Vehicle Routing Problem (VRP), which aims to minimize the cost of distributing goods. In this study, beginning with the search for the minimum spanning tree of graph the location of businesses and consumers, creating a mathematical model that became the basis for determining the cost of distribution. Having obtained the optimal route and making a mathematical model of the simulation model by using software Promedel 6. Simulation model was made because of demand that comes to PT. Dharma Bhakti Mandiri is always changing and uncertain distribution routes,so that can’t be solved using analytic methods.
Opini AndaKlik untuk menuliskan opini Anda tentang koleksi ini!

Lihat Sejarah Pengadaan  Konversi Metadata   Kembali
design
 
Process time: 0.25 second(s)