A biased random key genetic algorithm for the field Technician scheduling problem

DOI10.1016/j.cor.2016.05.003zbMath1349.90334OpenAlexW2385288821MaRDI QIDQ342506

Mauricio G. C. Resende, Ricardo B. Damm, Débora P. Ronconi

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.05.003

zbMATH Keywords

heuristictime windowsbiased random key genetic algorithmrouting and scheduling technicians

Mathematics Subject Classification ID

Mixed integer programming (90C11) Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Optimization of the technician routing and scheduling problem for a telecommunication industry, A genetic algorithm using triplet nucleotide encoding and DNA reproduction operations for unconstrained optimization problems, The capacitated family traveling salesperson problem, Branch-and-price for a multi-attribute technician routing and scheduling problem, A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar, Bi-objective scheduling on a restricted batching machine, Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm

Cites Work

• Unnamed Item
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• A biased random-key genetic algorithm for the unequal area facility layout problem
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
• A parallel matheuristic for the technician routing and scheduling problem
• A GRASP-based approach for technicians and interventions scheduling for telecommunications
• A biased random-key genetic algorithm for road congestion minimization
• A biased random-key genetic algorithm for the Steiner triple covering problem
• Scheduling technicians and tasks in a telecommunications company
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• Tabu search for total tardiness minimization in flowshop scheduling problems
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Effective heuristic procedures for a field technician scheduling problem
• Benchmarks for basic scheduling problems
• A hybrid genetic algorithm for the job shop scheduling problem
• A biased random-key genetic algorithm for single-round divisible load scheduling
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Manpower allocation with time windows and job-teaming constraints
• Randomized heuristics for the family traveling salesperson problem
• Improved heuristics for the regenerator location problem
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut