Description
We introduce a new extension of the Technician Routing and Schedul-ing Problem (TRSP), where tasks are associated with multiple poten-
tial resolution locations, each with a distinct probability of success.
Our objective is to efficiently resolve all tasks while minimizing re-
source consumption, such as driving distance or time. We investigate
various routing and scheduling strategies and compare their perfor-
mance against a known brute force approach employed in the telecom-
munication sector. Additionally, we model the problem as a Markov
Decision Process (MDP) to find an optimal decision making policy for
the technicians, that minimizes the expected resource consumption for
solving all tasks. We will also analyze a range of ’what if’ scenarios,
where we relax common problem constraints such as technicians hav-
ing to finish their current task before starting another. Computational
results are reported for simulated scenarios with a varying number of
technicians, resolution locations, and tasks, along with different spatial
configurations of the resolution locations for each task.
| Period | 3 Jul 2024 |
|---|---|
| Event title | EURO-2024 Copenhagen: 33rd European Conference on Operational Research |
| Event type | Conference |
| Conference number | 33 |
| Location | Copenhagen, DenmarkShow on map |
| Degree of Recognition | International |