Tabu Search and Memetic Algorithms for a Real Scheduling and Routing Problem
First online: 20.11.2017
Cite this article as: El-Yaakoubi, A., El-Fallahi, A., Cherkaoui, M., Reghioui Hamzaoui, M. (2017) doi:10.23773/2017_7
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.
Scheduling and routing problem meta-heuristic algorithms tabu search memetic algorithm