Decomposition-based algorithms for the crew scheduling and routing problem in road restoration

DOI10.1016/j.cor.2020.104935zbMath1458.90123MaRDI QIDQ2177830

Alfredo Moreno, Douglas J. Alem, Pedro Augusto Munari

Publication date: 6 May 2020

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

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/136877328/MorenoEtalCOP2020.pdf

zbMATH Keywords

Benders decomposition; hybrid method; crew scheduling and routing; road restoration; branch-and-Benders-cut; decomposition-based metaheuristic

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• Hyperheuristics
• Paramils
• Concorde