Main Article Content
Using Tabu Search Heuristics in Solving the Vehicle Routing Problem with Time Windows: Application to a Mauritian Firm
Abstract
In this paper a Tabu Search algorithm has been developed to solve the Vehicle Routing Problem with Time Windows where the capacity of vehicle has been taken as a constraint and the time window within which a customer has to be serviced. The Tabu Search algorithm has been applied to a real life situation for a Mauritian company. The optimal routes of the delivery of frozen chicken were found and it was then possible to minimize the cost of transport within the required the time constraint.
Keywords: Vehicle routing Problem, Tabu Search method