Multi-trip Vehicle Routing Problem with StochasticDemands

摘要

We consider a version of vehicle routing problem where the vehicles are dispatched multiple times a dayrnfor product delivery and the orders (demands) arrive randomly throughout the day. There are two types ofrndecisions, order assignment decisions and dispatch decisions. An order assignment decision decides how thernorders are assigned to vehicles but the assigned orders are not dispatched until a dispatch decision is madernwhich gives a vehicle routing plan to fulˉll the delivery. A general framework is presented and then twornvariations are studied. For each variation, a stochastic programming model is proposed and a solution pro-rncedure is developed. Preliminary results show that our solution procedures achieve signiˉcant improvementrnover the current practice.