A Fast Reoptimization Approach for the Dynamic Technician Routing and Scheduling Problem

V Pillac,C Guéret,A L Medaglia

doi:10.1007/978-3-319-58253-5_20

A Fast Reoptimization Approach for the Dynamic Technician Routing and Scheduling Problem

V Pillac, C Guéret + Show 1 more

https://doi.org/10.1007/978-3-319-58253-5_20

Copy DOI

Publication Date: Sep 19, 2017

Citations: 8

Affiliation: Universidad de Los Andes, University of Angers

#Dynamic Vehicle Routing Problem #Technician Routing + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

The Technician Routing and Scheduling Problem (TRSP) consists in routing staff to serve requests for service, taking into account time windows, skills, tools, and spare parts. Typical applications include maintenance operations and staff routing in telecoms, public utilities, and in the health care industry. In this paper we tackle the Dynamic TRSP (D-TRSP) in which new requests appear over time. We propose a fast reoptimization approach based on a parallel Adaptive Large Neighborhood Search (RpALNS) able to achieve state-of-the-art results on the Dynamic Vehicle Routing Problem with Time Windows. In addition, we solve a set of randomly generated D-TRSP instances and discuss the potential gains with respect to a heuristic modeling a human dispatcher solution.

Full Text