EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

1555. Technician Routing and Scheduling for Tasks with Uncertain Resolution Locations

Invited abstract in session WA-26: Optimization problems in scheduling, stream Combinatorial Optimization.

Wednesday, 8:30-10:00
Room: 012 (building: 208)

Authors (first author is the speaker)

1. Siv Sørensen
DTU Management, Technical University of Denmark
2. David Pisinger
Management, DTU

Abstract

We introduce a new extension of the Technician Routing and Scheduling Problem (TRSP), where tasks are associated with multiple potential resolution locations, each with a distinct probability of success. Our objective is to efficiently resolve all tasks while minimizing resource consumption, such as driving distance or time.
We investigate various routing and scheduling strategies and compare their performance against a known brute force approach employed in the telecommunication 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 having 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.

Keywords

Status: accepted

Back to the list of papers