Open Vehicle Routing Problem Optimization under Realistic Assumptions

Abstract

MDOVRP is a variant of classical VRP, which seeks to find a set of non-depot returning vehicle routes dispatching form several depots. A new integer linear programming model is presented considering limited number of vehicles at each depot. Randomly generated smallsized MDOVRPs are solved for validation and verification of the proposed model. Due to the complexity of the problem, a simulated annealing algorithm (SA) is developed for medium and large-sized MDVRPs' benchmarks.