Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands

• DOI: 10.1111/itor.12560
• Publication Date: 2018-05-15T08:53:54Z
• Authors: Laura Calvet; Dandan Wang; Angel Juan; Lluc Bové
• Keywords: Vehicle Routing Problem; Depot

Abstract When capacity constraints have to be considered at each depot due the existence of a limited number capacitated vehicles, multidepot vehicle routing problem (MDVRP) is nontrivial extension well‐known (CVRP). The MDVRP combines customer‐to‐depot assignment with several CVRPs. In real‐life scenarios, it usual find uncertainty in customers' demands. There are few works on stochastic (SMDVRP) and, best our knowledge, most them assume an unlimited fleet vehicles depot. This paper presents simheuristic framework combining Monte Carlo simulation metaheuristic algorithm deal SMDVRP fleets (and, therefore, serving capacity). Its efficiency tested set instances, which extend ones available literature for deterministic version problem.