Metaheuristics for the work‐troops scheduling problem

DOI10.1111/itor.12925MaRDI QIDQ6056168

Unnamed Author, Andréa Cynthia Santos, Dario José Aloise

Publication date: 29 September 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

ILSschedulingGRASPnetwork designhumanitarian logisticsdisaster relief

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

An enhanced GRASP approach for the index tracking problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Network repair crew scheduling and routing for emergency relief distribution problem
• Work-troop scheduling for road network accessibility after a major earthquake
• Road network emergency accessibility planning after a major earthquake
• A GRASP metaheuristic to improve accessibility after a disaster
• A survey of dynamic network flows
• A probabilistic heuristic for a computationally difficult set covering problem
• Minimizing latency in post-disaster road clearance operations
• Improving post-disaster road network accessibility by strengthening links against failures
• Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
• Network repair crew scheduling for short-term disasters
• TTT plots: a perl program to create time-to-target plots
• An annotated bibliography of GRASP-Part II: Applications
• Fragile networks: identifying vulnerabilities and synergies in an uncertain age
• Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
• Model and methods to address urban road network problems with disruptions

This page was built for publication: Metaheuristics for the work‐troops scheduling problem