Abstract

This study considers a Waste Collection Vehicle Routing Problem where the situation happens when vehicle must make a complete trip to make disposal operation per day. The Waste Collection Vehicle Routing Problem objective is to decide the best solution where a vehicle should make the collection first between the customers since there exist larger number of customers. The method proposed to solve the Waste Collection Vehicle Routing Problem is by using Tabu Search Algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call