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

• Published in: Jurnal Teknik Industri
• Main Authors: Suprayogi Suprayogi, Daniel Bunga Paillin
• Format: Article
• Language: English
• Published: Petra Christian University 2017-12-01
• Subjects: vehicle routing problem; fleet size and mix; multiple trips; split delivery; multiple compartments; genetic algorithm
• Online Access: http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/20259

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