Improvement Route for Distribution Solutions MDVRP (Multi Depot Vehicle Routing Problem) using Genetic Algorithm

10Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The Supply Chain Management Division (SCM) of KM Rubber Company is responsible for delivering the sole product, crumb rubber, from its various factories in Sumatera to the destination ports for further delivery to customers or export destinations. The aim of this study is to provide the improved route for the depot distribution to each destination ports with the shortest time and distance. Writing stage begins with preliminary studies, followed by the identification of the problem, determine the purpose of research, data collection, data processing that contains the initial distribution system optimization solved by methods of transportation and distribution of a new route that is resolved by Genetic Algorithm, and closed by the analysis and conclusions. The manual calculation method to obtain the optimal route gives a total transport distance of 8832.12 km; while the distribution of the proposed route using Genetic Algorithms generate total distance routes as far as 5188.06 km. As the distance is shorter the new route will generate minimal costs and shorter travel time.

Cite

CITATION STYLE

APA

Fitriana, R., Moengin, P., & Kusumaningrum, U. (2019). Improvement Route for Distribution Solutions MDVRP (Multi Depot Vehicle Routing Problem) using Genetic Algorithm. In IOP Conference Series: Materials Science and Engineering (Vol. 528). Institute of Physics Publishing. https://doi.org/10.1088/1757-899X/528/1/012042

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free