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

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.