A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration

DOI10.1016/j.ejor.2018.11.004zbMath1430.90115OpenAlexW2899721843WikidataQ113102325 ScholiaQ113102325MaRDI QIDQ1711440

Alfredo Moreno, Douglas J. Alem, Pedro Augusto Munari

Publication date: 18 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationbranch-and-cutBenders decompositioncrew scheduling and routingroad restoration

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (18)

A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem ⋮ Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks ⋮ Modeling emergency response operations: a theory building survey ⋮ Decomposition-based algorithms for the crew scheduling and routing problem in road restoration ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges ⋮ Routing multiple work teams to minimize latency in post-disaster road network restoration ⋮ Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties ⋮ Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach ⋮ Robust post-disaster route restoration ⋮ Minimizing latency in post-disaster road clearance operations ⋮ Interdependent integrated network design and scheduling problems with movement of machines ⋮ Building disaster preparedness and response capacity in humanitarian supply chains using the social vulnerability index ⋮ Integrating location and network restoration decisions in relief networks under uncertainty ⋮ Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters

Uses Software

• NETGEN

Cites Work

• A note on two problems in connexion with graphs
• Network repair crew scheduling and routing for emergency relief distribution problem
• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Optimal scheduling of emergency roadway repair and subsequent relief distribution
• Partitioning procedures for solving mixed-variables programming problems
• New optimality cuts for a single-vehicle stochastic routing problem
• Multi-vehicle prize collecting arc routing for connectivity problem
• The Benders decomposition algorithm: a literature review
• Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
• A survey on Benders decomposition applied to fixed-charge network design problems
• An improved Benders decomposition algorithm for the tree of hubs location problem
• Integer Programming Formulation of Traveling Salesman Problems
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Benchmarking optimization software with performance profiles.

This page was built for publication: A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration