Stochastic mobile facility routing and scheduling problem

We consider the mobile facility routing and scheduling problem with stochastic demand (MFRSPSD). MFRSPSD simultaneously determines the route and schedule of a fleet of mobile facilities which serve customers with uncertain demand in order to minimize the total cost generated over the planning horizon. The problem is formulated as a two-stage stochastic programming model, in which the first stage decision deals with the temporal and spatial movement of the MFs and the second stage handles how MFs serve customer demands. An algorithm based on the multicut version of L-shaped method is developed. The computational results show that the algorithm yields high quality upper and lower bounds within reasonable computation time for medium scale problems.