Dynamic re-scheduling of technician routes: a case study in the B2B e-mobility sector

In this study, we examine routeing and scheduling of field technicians in the B2B e-Mobility sector. In this industry, timely and adequate responses to service requests arriving throughout the planning horizon are critical, as B2B providers must adhere to service-level agreements to avoid financial penalties. We address a multi-period dynamic workforce (re-)scheduling problem, focusing on real-time re-optimisation triggered by new service requests. The problem incorporates distinct job priorities, time-window constraints, workforce availability, and geographical distribution of charging stations. Dynamic re-scheduling improves operational efficiency in response to disruptions but it may increase anxiety for personnel resulting from frequent schedule changes. In our analysis, we evaluate schedules from both perspectives, i.e., schedule cost and schedule nervousness. The dynamic framework has been implemented using a commercial and an open-source solver, which both apply mathematical programming. For validation, we employ a trace-driven simulation, replicating incoming service requests based on enterprise logbooks, and benchmark the proposed method against the manual planning method of the collaborating company. In addition, we investigate a broad set of event-driven, periodic, and hybrid dynamic re-scheduling strategies to derive best practices on when and how to react to requests with different job priorities. The resulting schedules are evaluated in terms of cost and nervousness to identify strategies leading to Pareto-optimal solutions. Our results indicate that accumulating new information of multiple requests enables better decision-making relative to the routeing of workers. Re-optimising less frequently appears to provide a more stable and coherent decision environment and leads to more cost-efficient schedules.

Authors

Institutions

Publication Details

Journal
Journal of the Operational Research Society
Published
2026-11-14
DOI
https://doi.org/10.1080/01605682.2026.2754334
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Dynamic re-scheduling of technician routes: a case study in the B2B e-mobility sector

Broos Maenhout, Samuel Bakker, Rie Vermeire
Journal of the Operational Research Society
Vehicle Routing Optimization Methods
article

Dynamic re-scheduling of technician routes: a case study in the B2B e-mobility sector

Broos Maenhout, Samuel Bakker, Rie Vermeire
article en

Abstract

In this study, we examine routeing and scheduling of field technicians in the B2B e-Mobility sector. In this industry, timely and adequate responses to service requests arriving throughout the planning horizon are critical, as B2B providers must adhere to service-level agreements to avoid financial penalties. We address a multi-period dynamic workforce (re-)scheduling problem, focusing on real-time re-optimisation triggered by new service requests. The problem incorporates distinct job priorities, time-window constraints, workforce availability, and geographical distribution of charging stations. Dynamic re-scheduling improves operational efficiency in response to disruptions but it may increase anxiety for personnel resulting from frequent schedule changes. In our analysis, we evaluate schedules from both perspectives, i.e., schedule cost and schedule nervousness. The dynamic framework has been implemented using a commercial and an open-source solver, which both apply mathematical programming. For validation, we employ a trace-driven simulation, replicating incoming service requests based on enterprise logbooks, and benchmark the proposed method against the manual planning method of the collaborating company. In addition, we investigate a broad set of event-driven, periodic, and hybrid dynamic re-scheduling strategies to derive best practices on when and how to react to requests with different job priorities. The resulting schedules are evaluated in terms of cost and nervousness to identify strategies leading to Pareto-optimal solutions. Our results indicate that accumulating new information of multiple requests enables better decision-making relative to the routeing of workers. Re-optimising less frequently appears to provide a more stable and coherent decision environment and leads to more cost-efficient schedules.

Journal of the Operational Research Society
Ghent University (BE)
Vehicle Routing Optimization Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon