Genetic Algorithm for Waste Transportation Route in Eastern Bandung (Case Study: PD. Kebersihan Kota Bandung)

摘要

VRP highly close related with distance and cost minimization. PD. Kebersihan Kota Bandung has been facing one of the problem related with vehicle routing since this company has not have a fixed route for waste transportation because of their limited vehicle used and it will cost them a lot more if they have to add more vehicle to handle this. Therefore, research on VRP for this case has been done especially in West Bandung Region to find a better solution to reduce total distances and cost in which the company have to pay out. Method used to solve this problem is Genetic Algorithm with Clarke and Wright Saving used first to find initial solution. Genetic Algorithm is problem independent, it means that it can solve a lot of problems in a different field and still have probability to keep continuing to find the best solution including global search. Based on researh that has been done, there are three route with three trucks created with total volume for each vehicle on those route which are 7,053 m3, 6,753 m3, and 6,903 m3 with total distance 65,33 km.