Jurnal Teknik Industri
Vol. 19 No. 2 (2017): Desember 2017

Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk, dan Kendaraan dengan Kompartemen Majemuk

Suprayogi Suprayogi (Institut Teknologi Bandung, Bandung)
Daniel Bunga Paillin (Universitas Pattimura, Ambon)

Article Info

Publish Date
08 Jan 2018

Abstract

This paper discusses a variant of the basic vehicle routing problem (VRP) by including the following characteristics: fleet size and mix, multiple trips, split delivery, and multiple compartments. One of real cases of this problem is related to determining tanker’s routes in delivering fuel products from a supply port to a number of destination ports. Each tanker has several compartments where each compartment is dedicated to a certain fuel product. In this paper, a solution approach based on genetic algorithm (GA) is proposed and tested using nine hypothetical instances. Experiment results show that the proposed GA gives consistent results measured by coefficient variations

Copyrights © 2017




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
649.385 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Teknik Industri
Website

Abbrev

ind

Publisher

Universitas Kristen Petra Surabaya

Subject

Industrial & Manufacturing Engineering

Description

Jurnal Teknik Industri aims to: Promote a comprehensive approach to the application of industrial engineering in industries as well as incorporating viewpoints of different disciplines in industrial engineering. Strengthen academic exchange with other institutions. Encourage scientist, practicing ...