An optimization approach for communal home meal delivery service: A case study

This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a real-life case study from Central Finland over several alternative scenarios using the SPIDER commercial solver. The comparison with current practice reveals that a significant savings potential can be obtained using off-the-shelf optimization tools. As such, the potential for supporting real-life communal routing problems can be considered to be important for VRP practitioners.

[1]  Geir Hasle,et al.  Industrial Vehicle Routing , 2007, Geometric Modelling, Numerical Simulation, and Optimization.

[2]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[3]  Knut-Andreas Lie,et al.  Geometric Modelling, Numerical Simulation, and Optimization - Applied Mathematics at SINTEF , 2007, Geometric Modelling, Numerical Simulation, and Optimization.

[4]  Christos D. Tarantilis,et al.  Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm , 2005, J. Oper. Res. Soc..

[5]  André Langevin,et al.  A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing , 2006, Comput. Oper. Res..

[6]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[7]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[8]  Denis Borenstein,et al.  SCOLDSS: A Decision Support System for the Planning of Solid Waste Collection , 2007, Decision Support for Global Enterprises.

[9]  Maged Dessouky,et al.  Impacts of management practices and advanced technologies on demand responsive transit systems , 2004 .

[10]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[11]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[12]  Saïd Salhi,et al.  A multi-phase constructive heuristic for the vehicle routing problem with multiple trips , 2003, Discret. Appl. Math..

[13]  Alfredo Olivera,et al.  Adaptive memory programming for the vehicle routing problem with multiple trips , 2007, Comput. Oper. Res..

[14]  Nan Xia,et al.  A model for the fleet sizing of demand responsive transportation services with time windows , 2006 .

[15]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[16]  Torsten Fahle,et al.  A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem , 2006, Comput. Oper. Res..

[17]  Harri Niska,et al.  Improved route planning and scheduling of waste collection and transport , 2006, Expert Syst. Appl..

[18]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[19]  Barrett W. Thomas,et al.  A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows , 2007, INFORMS J. Comput..

[20]  Michel Gendreau,et al.  A Survey of Heuristics for the Vehicle Routing Problem Part I: Basic Problems and Supply Side Extensions , 2008 .

[21]  Alexander Popov,et al.  Routing Optimization for Waste Management , 2005, Interfaces.

[22]  O. Bräysy,et al.  Communal Transportation: Challenges for Largescale Routing Heuristics , 2007 .

[23]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[24]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[25]  André Langevin,et al.  A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading , 2005, Comput. Oper. Res..

[26]  A. Tsakalidis,et al.  Integrating GIS, GPS and GSM technologies for the effective management of ambulances , 2001 .

[27]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[28]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[29]  Wen-Chyuan Chiang,et al.  Integrating multi-product production and distribution in newspaper logistics , 2008, Comput. Oper. Res..

[30]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[31]  Michel Bierlaire,et al.  School Bus Routing and Scheduling Problem , 2002, OR.

[32]  Mikael Rönnqvist,et al.  Laps Care - an operational system for staff planning of home care , 2006, Eur. J. Oper. Res..

[33]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[34]  Michel Gendreau,et al.  A Survey of Heuristics for the Vehicle Routing Problem Part II: Demand Side Extensions , 2008 .

[35]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[36]  Paul F. Hanley,et al.  Transportation cost changes with statewide school district consolidation , 2007 .

[37]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

[38]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[39]  André Langevin,et al.  A survey of models and algorithms for winter road maintenance. Part IV: Vehicle routing and fleet sizing for plowing and snow disposal , 2005, Comput. Oper. Res..

[40]  Nathalie Perrier,et al.  A survey of models and algorithms for winter road maintenance. Part II: system design for snow disposal , 2006, Comput. Oper. Res..

[41]  BräysyOlli,et al.  Vehicle Routing Problem with Time Windows, Part II , 2005 .

[42]  Ramesh Krishnamurti,et al.  The multiple TSP with time windows: vehicle bounds based on precedence graphs , 2006, Oper. Res. Lett..

[43]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[44]  Jean-Yves Potvin,et al.  Vehicle routing and scheduling with dynamic travel times , 2006, Comput. Oper. Res..

[45]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[46]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[47]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .