Shipping and Transport Optimization on Vehicle Routing Problem (VRP) with Genetic Algorithm

Anggara Hayun Anujuprana

Abstract


Transport was one of the important issues that are owned by the logistics department, so that transport costs should be as efficient as possible because it can contribute more in order to reduce the total cost and to improve the company’s competitive advantage. This research aims to generate a distribution service that has the shortest total mileage of limitations of the capacity of the vehicles, so that the distribution of the goods shall not exceed the limit of vehicles owned. Capacitated Vehicle Routing Problem (CVRP) was one of the problems with using a mathematical model based on considerations of distance and capacity of the vehicle in order to obtain the solution of this problem, use genetic algorithm (GA). GA chosen because it has the advantages of other methods, this genetic algorithm proposed has much quicker convergence speed, stronger overcoming getting into partial optimal ability. Therefore, it was more practical significance and value so as to reduce operating cost and improve economic benefit. As a support of basic goods distribution system, the system will be creating applications that integrate with the delivery process is used to determine which OOAD methods and system design requirements in accordance with company requirements. This system will be used as a tool to support the company's performance and speed up the process of making the distribution of goods.

Keywords: VRP, Genetic Algorithm, Transportation, OOAD.


Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email: EJBM@iiste.org

ISSN (Paper)2222-1905 ISSN (Online)2222-2839

Please add our address "contact@iiste.org" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright © www.iiste.org