A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem

This paper considers the mobile facility routing and scheduling problem with stochastic demand (MFRSPSD). The MFRSPSD simultaneously determines the route and schedule of a fleet of mobile facilities which serve customers with uncertain demand to minimize the total cost generated during 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 MFs and the second stage handles how MFs serve customer demands. An algorithm based on the multicut version of the L-shaped method is proposed in which several lower bound inequalities are developed and incorporated into the master program. The computational results show that the algorithm yields a tighter lower bound and converges faster to the optimal solution. The result of a sensitivity analysis further indicates that in dealing with stochastic demand the two-stage stochastic programming approach has a distinctive advantage over the model considering only the average demand in terms of cost reduction.

[1]  Walter J. Gutjahr,et al.  The bi-objective stochastic covering tour problem , 2012, Comput. Oper. Res..

[2]  Gilbert Laporte,et al.  An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers , 1995, Transp. Sci..

[3]  Suzanne van der Ster,et al.  A two-stage approach to the orienteering problem with stochastic weights , 2014, Comput. Oper. Res..

[4]  T. P. M. Pakkala,et al.  A Bayesian approach to a dynamic inventory model under an unknown demand distribution , 2002, Comput. Oper. Res..

[5]  M. Goodchild,et al.  The Multiobjective Vending Problem: A Generalization of the Travelling Salesman Problem , 1988 .

[6]  George O. Wesolowsky,et al.  Dynamic Facility Location , 1973 .

[7]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[8]  G. O. Wesolowsky,et al.  Facility location when demand is time dependent , 1991 .

[9]  H. L. Ong,et al.  An Integer L-shaped Algorithm for Time-Constrained Traveling Salesman Problem with Stochastic Travel and Service times , 2004, Asia Pac. J. Oper. Res..

[10]  Andrew Lim,et al.  An iterative three-component heuristic for the team orienteering problem with time windows , 2014, Eur. J. Oper. Res..

[11]  Oded Berman,et al.  A Location Model for Urban Hierarchy Planning with Population Dynamics , 2009 .

[12]  Nacima Labadie,et al.  The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search , 2012, Eur. J. Oper. Res..

[13]  Michel Gendreau,et al.  The orienteering problem with stochastic travel and service times , 2011, Ann. Oper. Res..

[14]  Gilbert Laporte,et al.  Heuristics for the multi-vehicle covering tour problem , 2000, Comput. Oper. Res..

[15]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[16]  Barrett W. Thomas,et al.  Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits , 2013, Oper. Res..

[17]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[18]  João C. N. Clímaco,et al.  Capacitated dynamic location problems with opening, closure and reopening of facilities , 2006 .

[19]  Thomas C. Sharkey,et al.  Integrated dynamic single-facility location and inventory planning problems , 2013 .

[20]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

[21]  R. Montemanni,et al.  Objective function evaluation methods for the orienteering problem with stochastic travel and service times , 2014 .

[22]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[23]  Gautam Mitra,et al.  Computational solution of capacity planning models under uncertainty , 2000, Parallel Comput..

[24]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[25]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[26]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[27]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

[28]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[29]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[30]  Charles ReVelle,et al.  SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER.: THE SHORTEST COVERING PATH PROBLEM: AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN , 1984 .

[31]  Gilbert Laporte,et al.  The Dynamic Uncapacitated Hub Location Problem , 2011, Transp. Sci..

[32]  Mark S. Daskin,et al.  The orienteering problem with stochastic profits , 2008 .

[33]  Richard D. Wollmer,et al.  Two stage linear programming under uncertainty with 0–1 integer first stage variables , 1980, Math. Program..

[34]  Patrick Jaillet,et al.  A Priori Optimization , 1990, Oper. Res..

[35]  Halit Üster,et al.  Dynamic-demand capacitated facility location problems with and without relocation , 2011 .

[36]  Erik Rolland,et al.  Efficient Algorithms for Solving the Shortest Covering Path Problem , 1994, Transp. Sci..

[37]  Robert H. Storer,et al.  An approximate dynamic programming approach for the vehicle routing problem with stochastic demands , 2009, Eur. J. Oper. Res..

[38]  G. O. Wesolowsky,et al.  The Multiperiod Location-Allocation Problem with Relocation of Facilities , 1975 .

[39]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[40]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[41]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[42]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[43]  J. Birge,et al.  A multicut algorithm for two-stage stochastic linear programs , 1988 .

[44]  J. Current,et al.  The median tour and maximal covering tour problems: Formulations and heuristics , 1994 .

[45]  Justo Puerto,et al.  The multi-period incremental service facility location problem , 2009, Comput. Oper. Res..

[46]  S. Raghavan,et al.  The Mobile Facility Routing Problem , 2011, Transp. Sci..

[47]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[48]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[49]  Gino J. Lim,et al.  A decomposition approach for facility location and relocation problem with uncertain number of future facilities , 2012, Eur. J. Oper. Res..

[50]  Ronald H. Ballou,et al.  Dynamic Warehouse Location Analysis , 1968 .

[51]  Marc Goetschalckx,et al.  A stochastic programming approach for supply chain network design under uncertainty , 2004, Eur. J. Oper. Res..

[52]  C. Canel,et al.  Multi-period international facilities location: An algorithm and application , 1997 .

[53]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[54]  Gilbert Laporte,et al.  The orienteering problem with variable profits , 2013, Networks.

[55]  J. Current,et al.  The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .