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

DOI10.1007/S10479-024-06325-6MaRDI QIDQ7002527zbMATH OpenFDO

Authors Ricardo B. Damm, A. A. Chaves, José Angel Riveaux, Débora P. Ronconi

Publication date 3 April 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-06325-6

zbMATH Keywords

biased random-key genetic algorithmmulti-objectiveQ-learningrouting and scheduling technicians

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption
• A biased random key genetic algorithm for the field Technician scheduling problem
• A GRASP-based approach for technicians and interventions scheduling for telecommunications
• A multiperiod workforce scheduling and routing problem with dependent tasks
• A parallel matheuristic for the technician routing and scheduling problem
• A robust optimization approach to dispatching technicians under stochastic service times
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
• Benchmarks for basic scheduling problems
• Bi-objective scheduling on a restricted batching machine
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• Decision support for the technician routing and scheduling problem
• Effective heuristic procedures for a field technician scheduling problem
• Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization
• Exploratory analysis of stochastic local search algorithms in biobjective optimization
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Genetic local search for multi-objective flowshop scheduling problems
• Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation
• Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• On the minimization of traffic congestion in road networks with tolls
• Optimization of the technician routing and scheduling problem for a telecommunication industry
• Randomized heuristics for the family traveling salesperson problem
• Refined ranking relations for selection of solutions in multi objective metaheuristics
• Resource constrained routing and scheduling: review and research prospects
• Scheduling technicians and tasks in a telecommunications company
• The bi-objective pollution-routing problem
• The dial-a-ride problem with private fleet and common carrier
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications

This page was built for publication: Scheduling technicians and tasks through an adaptive multi-objective biased random-key genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7002527)