Author/Authors :
Pichka، Kh. نويسنده Industrial Engineering Department, University of Tafresh, Tafresh, Iran , , Ashjari، B. نويسنده Department of Industrial Engineering, Tafresh University, Tafresh, Iran , , Ziaeifar، A. نويسنده School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , , Nickbeen، P. نويسنده Industrial Engineering Department, University of Kurdistan, Sanandaj, Iran ,
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.
