Large-Scale Periodic Routing Problems for Supporting Planning of Mobile Personnel Tasks

Implementation concepts of a decision support system for large-scale periodic time-dependent vehicle routing and scheduling problems with complex constraints supporting planning and management of mobile personnel tasks (sales representatives and others) are discussed. Complex nonuniform constraints with respect to frequency, time windows, working time, etc. are taken into account with additional fast adaptive procedures for operational rescheduling of plans in presence of various disturbances. Five individual solution quality indicators with respect to a single personnel person are considered. This paper deals with modeling issues corresponding to the problem and general solution concepts.

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

[2]  Pierre Hansen,et al.  A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows , 2014, Comput. Oper. Res..

[3]  Vassilios S. Vassiliadis,et al.  List-based threshold-accepting algorithm for zero-wait scheduling of multiproduct batch plants , 2002 .

[4]  Jarosław Hurkała.  Time-Dependent Traveling Salesman Problem with Multiple Time Windows , 2015, FedCSIS.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Vassilios S. Vassiliadis,et al.  A novel threshold accepting meta-heuristic for the job-shop scheduling problem , 2004, Comput. Oper. Res..

[7]  Daniela Favaretto,et al.  Ant colony system for a VRP with multiple time windows and multiple visits , 2007 .

[8]  Maria Grazia Speranza,et al.  Short Term Strategies for a Dynamic Multi-Period Routing Problem , 2009 .

[9]  Ann Melissa Campbell,et al.  Forty years of periodic vehicle routing , 2014, Networks.

[10]  Tomasz Sliwinski,et al.  Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks , 2014, J. Appl. Math..

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

[12]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[13]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[14]  CD Tarantilis,et al.  A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem , 2003, J. Oper. Res. Soc..

[15]  Dirk Van Oudheusden,et al.  The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..

[16]  Jaroslaw Hurkala,et al.  Effective Design of the Simulated Annealing Algorithm for the Flowshop Problem with Minimum Makespan Criterion , 2012 .

[17]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

[18]  Karen Renee Smilowitz,et al.  Modeling Techniques for Periodic Vehicle Routing Problems , 2006 .

[19]  Richard F. Hartl,et al.  Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..

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