Tabu Search and Memetic Algorithms for a Real Scheduling and Routing Problem

The Scheduling and Routing Problem (SRP) is a special case of the well-known vehicle routing problem, where a set of employees should perform an ensemble of services, at the clients’ locations. In this work, we present a real SRP faced by a company of water and electricity distribution. Under some particular constraints, the company seeks to minimize the total distance traveled by its technicians. The services required by the clients consist of installation, maintenance and control operations. The problem is modeled as a mixed integer linear program. Three meta-heuristic algorithms based on tabu search methodology and memetic algorithm are proposed to solve it. These algorithms are tested on a set of real instances and others generated randomly. To measure the quality of the solutions obtained by our algorithms their results are compared to those given by CPLEX.

[1]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[3]  K. Takahashi,et al.  A Support System for Home Care Service Based on Multi-agent System , 2005, 2005 5th International Conference on Information Communications & Signal Processing.

[4]  Jesper Larsen,et al.  The Home Care Crew Scheduling Problem , 2008 .

[5]  Michel Gendreau,et al.  A column generation approach for a multi-attribute vehicle routing problem , 2015, Eur. J. Oper. Res..

[6]  Anand Subramanian,et al.  An iterated local search heuristic for the split delivery vehicle routing problem , 2015, Comput. Oper. Res..

[7]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[8]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[9]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[10]  Hoong Chuin Lau,et al.  The patrol scheduling problem , 2012 .

[11]  Mikael Rönnqvist,et al.  Operations Research Improves Quality and Efficiency in Home Care , 2009, Interfaces.

[12]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[13]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[14]  L. Song,et al.  Manpower allocation with time windows , 2004, J. Oper. Res. Soc..

[15]  Jennifer Lynn Rich,et al.  A Home Health Care Routing and Scheduling Problem , 1998 .

[16]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[17]  Ramasamy Panneerselvam,et al.  A Survey on the Vehicle Routing Problem and Its Variants , 2012 .

[18]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[19]  Reza Tavakkoli-Moghaddam,et al.  A New Capacitated Vehicle Routing Problem with Split Service for Minimizing Fleet Cost by Simulated Annealing , 2007, J. Frankl. Inst..

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

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

[23]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[24]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[25]  Pisal Yenradee,et al.  PSO-based algorithm for home care worker scheduling in the UK , 2007, Comput. Ind. Eng..

[26]  Andrew Lim,et al.  The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach , 2012, Eur. J. Oper. Res..

[27]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

[28]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[29]  Henry C. W. Lau,et al.  A hybrid genetic algorithm for the multi-depot vehicle routing problem , 2008, Eng. Appl. Artif. Intell..

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

[31]  Andrew Lim,et al.  Manpower allocation with time windows and job teaming constraints , 2003 .

[32]  Pieter Smet,et al.  Security personnel routing and rostering: a hyper-heuristic approach , 2011 .

[33]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

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

[35]  Gilbert Laporte,et al.  Solving a home-care districting problem in an urban setting , 2003, J. Oper. Res. Soc..

[36]  Esben Kolind,et al.  The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach , 2009, Comput. Oper. Res..

[37]  Teodor Gabriel Crainic,et al.  A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows , 2013, Eur. J. Oper. Res..

[38]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[39]  Patrick De Causmaecker,et al.  Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem , 2010, IEEE Congress on Evolutionary Computation.

[40]  Gilbert Laporte,et al.  Scheduling technicians and tasks in a telecommunications company , 2008, J. Sched..

[41]  Kenny Q. Zhu,et al.  A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.