Methods for solving road network problems with disruptions

DOI10.1016/J.ENDM.2018.01.019MaRDI QIDQ1742219zbMATH OpenOpenAlexWikidataFDO

Authors Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel

Publication date 11 April 2018

Full work available at URL https://doi.org/10.1016/j.endm.2018.01.019

zbMATH Keywords

heuristicsroad networkiterated local searchbiased random key genetic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Recommendations

• Multi-objective discrete urban road network design
• Dynamic shortest path problems: hybrid routing policies considering network disruptions
• Optimizing reserve capacity of urban road networks in a discrete network design problem
• An exact method for the biobjective shortest path problem for large-scale road networks
• A linear programming approach to the optimum network orientation problem

Cites work

• scientific article; zbMATH DE number 3706451 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A review of urban transportation network design problems
• Distances in orientations of graphs
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
• Robbins's Theorem for Mixed Multigraphs
• Strongly connected orientations of mixed multigraphs

Cited in

(3)

• Model and methods to address urban road network problems with disruptions
• Dynamic shortest path problems: hybrid routing policies considering network disruptions
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Methods for solving road network problems with disruptions

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