Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.16968

Decision support for the Technician Routing and Scheduling Problem

Mette Gamst·David Pisinger
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 (OPEX) and investment costs (CAPEX) are minimized. Using a holistic approach we can generate scenarios that would not have been found by studying the investments individually. The proposed method consists of a matheuristic based on column generation. To reduce computational time, the routing costs of a technician are approximated. The proposed method is evaluated on data from the literature and on real-life data from a telecommunication company. The evaluation shows that the proposed method successfully suggests attractive scenarios. The method especially excels in ensuring that more tasks are serviced but also reduces travel time with around 16% in the real-life instance. We believe that the proposed method could constitute an important strategic tool in field service companies and we propose future research directions to further its applicability.

Explore related subjects

math.DScs.DM

Keep this discovery

BibTeXRIS

Mette Gamst, David Pisinger. 2022-11-01. Decision support for the Technician Routing and Scheduling Problem. https://arxiv.org/abs/2211.16968

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS↗
arXiv2026

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS↗
arXiv2026

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS↗