Scheduling technicians and tasks through an adaptive multi-objective biased random-key genetic algorithm

R. B. Damm (), A. A. Chaves (), J. A. Riveaux () and D. P. Ronconi ()
Additional contact information
R. B. Damm: University of São Paulo
A. A. Chaves: Univ. Fed. of São Paulo
J. A. Riveaux: University of São Paulo
D. P. Ronconi: University of São Paulo

Annals of Operations Research, 2025, vol. 346, issue 2, No 10, 945-980

Abstract: Abstract This work addresses a practical problem concerning the daily scheduling of tasks for field technicians and route planning, taking into account time windows, task priority, technicians’ skills, working hours, and lunch breaks. In line with the demands and expectations of large cities’ customers, we pursue two goals simultaneously: to maximize the weighted sum of the attended tasks and to perform the highest-priority tasks as soon as possible within their time windows. This is done without disregarding the fact that more efficient routes reduce fuel consumption. This paper presents a bi-objective mixed integer programming model for the problem and introduces an innovative approach that combines a multi-objective BRKGA with the Q-Learning method. Q-Learning is a reinforcement learning method that controls the parameters of the BRKGA during the evolutionary process, learning the best configuration based on rewards. Extensive numerical experiments and comparisons with the Nondominated Sorting Genetic Algorithm II and the Strength Pareto Evolutionary Algorithm 2 show that the proposed multi-objective biased random-key genetic algorithm outperforms the other approaches in instances with up to 200 tasks and 30 technicians, which are typical instances encountered in practice. The developed approach facilitates parameter calibration and consistently attains a substantial portion of the Pareto frontier in the multi-objective STRSP.

Keywords: Routing and scheduling technicians; Multi-objective; Biased random-key genetic algorithm; Q-Learning (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06325-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:346:y:2025:i:2:d:10.1007_s10479-024-06325-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-06325-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().