Heuristic for vehicle routing problem with release and due dates

This research is classifies as non-classical Vehicle Routing Problem (VRP) where the maximum release date of customer’s demand of the route determine the vehicle departure time. Thus, there could be lateness on the delivery process from awaiting all customers’ demand of the route to be released. A mathematical formulation is developed to represent the problem studied. Insertion method based on the cheapest cost is used to generate an initial solution. Then, Local Search technique is applied to improve the solution in term of minimization of total traveling and tardiness cost.