A parallel matheuristic for the technician routing and scheduling problem

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...

Full description

Saved in:
Bibliographic Details
Published in:Optimization letters 2013-10, Vol.7 (7), p.1525-1535
Main Authors: Pillac, V., Guéret, C., Medaglia, A. L.
Format: Article
Language:English
Subjects:
Computational Intelligence
Computer Science
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 present a formal definition of the TRSP, discuss its relation with the Vehicle Routing Problem with Time Windows (VRPTW), and review related research. From a methodological perspective, we describe a matheuristic composed of a constructive heuristic, a parallel Adaptive Large Neighborhood Search, and a mathematical programming based post-optimization procedure that successfully tackles the TRSP. We validate the matheuristic on the Solomon VRPTW instances, where we achieve an average gap of , and matched 44 out of 55 optimal solutions. Finally, we illustrate how the matheuristic successfully solves a set of TRSP instances extended from the Solomon benchmark.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-012-0567-4