An indirect search algorithm for disaster restoration with precedence and synchronization constraints

DOI10.1186/S40736-017-0032-5MaRDI QIDQ1704041zbMATH OpenOpenAlexWikidataFDO

Authors Akifumi Kira, Hidenao Iwane, Hirokazu Anai, Yutaka Kimura, Katsuki Fujisawa

Publication date 8 March 2018

Published in Pacific Journal of Mathematics for Industry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s40736-017-0032-5

zbMATH Keywords

schedulingvehicle routing problemmathematical optimizationlinear extensionsindirect local search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Recommendations

• Robust post-disaster route restoration
• Emergency path restoration problems
• Strategic network restoration
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• Routing multiple work teams to minimize latency in post-disaster road network restoration

Cites work

• A grouping genetic algorithm for the pickup and delivery problem with time windows
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• Formulation and tabu search algorithm for the resource constrained project scheduling problem.
• Indirect search for the vehicle routing problem with pickup and delivery and time windows
• Manpower allocation with time windows and job-teaming constraints

This page was built for publication: An indirect search algorithm for disaster restoration with precedence and synchronization constraints

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