Vehicle Routing Problem Using Genetic Algorithm with Multi Compartment on Vegetable Distribution

The problem that is often gained by the industries of managing and distributing vegetables is how to distribute vegetables so that the quality of the vegetables can be maintained properly. The problems encountered include optimal route selection and little travel time or so-called TSP (Traveling Sal...

Full description

Saved in:
Bibliographic Details
Published in:IOP conference series. Materials Science and Engineering 2018-03, Vol.325 (1), p.12012
Main Authors: Kurnia, Hari, Wahyuni, Elyza Gustri, Pembrani, Elang Cergas, Gardini, Syifa Tri, Aditya, Silfa Kurnia
Format: Article
Language:English
Subjects:
Genetic algorithms
Mutation
Route planning
Route selection
Travel time
Traveling salesman problem
Vegetables
Vehicle routing
Warehouses
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem that is often gained by the industries of managing and distributing vegetables is how to distribute vegetables so that the quality of the vegetables can be maintained properly. The problems encountered include optimal route selection and little travel time or so-called TSP (Traveling Salesman Problem). These problems can be modeled using the Vehicle Routing Problem (VRP) algorithm with rating ranking, a cross order based crossing, and also order based mutation mutations on selected chromosomes. This study uses limitations using only 20 market points, 2 point warehouse (multi compartment) and 5 vehicles. It is determined that for one distribution, one vehicle can only distribute to 4 market points only from 1 particular warehouse, and also one such vehicle can only accommodate 100 kg capacity.
ISSN:1757-8981
1757-899X
DOI:10.1088/1757-899X/325/1/012012