Decision support for the Technician Routing and Scheduling Problem
@article{Gamst2022DecisionSF,
title={Decision support for the Technician Routing and Scheduling Problem},
author={Mette Gamst and David Pisinger},
journal={ArXiv},
year={2022},
volume={abs/2211.16968}
}The technician routing and scheduling problem (TRSP) consists of technicians serving tasks subject to qualifications, time constraints and routing costs. In the literature, the TRSP is solved either to provide actual technician plans or for performing what-if analyses on different TRSP scenarios. We present a method for building optimal TRSP scenarios, e.g., how many technicians to employ, which technician qualifications to upgrade, etc. The scenarios are built such that the combined TRSP costs…
Figures and Tables from this paper
table 1 
figure 1 
table 2 
figure 2 
table 3 
figure 3 
table 4 
figure 4 
table 5 
figure 5 
table 6 
figure 6 
table 7 
figure 7 
table 8 
figure 8 
table 9 
figure 9 
table 10 
table 11 
table 12 
table 13 
table 14 
table 15 
table 16 
table 17 
table 18 
table 19 
table 20 
table 21 
table 22 
table 23 
table 24 
table 25 
table 26 
table 27 
table 28 
table 29 
table 30 
table 31 
table 32 
table 33 
table 34 
table 35 
table 36 
table 37
References
SHOWING 1-10 OF 39 REFERENCES
A parallel matheuristic for the technician routing and scheduling problem
- Computer ScienceOptim. Lett.
- 2013
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 is described.
On the dynamic technician routing and scheduling problem
- Computer Science, Business
- 2012
The present work proposes an optimization approach for the dynamic version of the Technician Routing and Scheduling Problem, noted D-TRSP, where new requests arrive during the execution of the routes.
Mixed integer linear programming for a multi-attribute technician routing and scheduling problem
- BusinessINFOR Inf. Syst. Oper. Res.
- 2018
A mixed integer linear programming model is proposed to address the multi-attribute technician routing and scheduling problem motivated by an application for the maintenance and repair of electronic transaction equipment and the results explore the difficulty of the problem along various dimensions and underline its inherent complexity.
Workforce scheduling and routing problems: literature survey and computational study
- Computer Science, BusinessAnn. Oper. Res.
- 2016
A survey is presented which attempts to identify the common features of WSRP scenarios and the solution methods applied when tackling these problems and a study on the computational difficulty of solving these type of problems is presented.
A multiperiod workforce scheduling and routing problem with dependent tasks
- Computer Science, BusinessComput. Oper. Res.
- 2020
Column generation based heuristic for tactical planning in multi-period vehicle routing
- BusinessEur. J. Oper. Res.
- 2007
Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem
- BusinessOperations Research Forum
- 2021
An exact branch-and-price algorithm for a multi-attribute technician routing and scheduling problem that can solve instances with up to 45 tasks and greatly improves upon a commercial solver applied to an arc-based mixed integer linear program.
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- BusinessTransp. Sci.
- 1999
A tabu search heuristic, initially designed for the static version of the problem, has been adapted to the dynamic case and implemented on a parallel platform to increase the computational effort.