Methods for solving road network problems with disruptions

DOI10.1016/j.endm.2018.01.019zbMath1392.90025OpenAlexW2789612454WikidataQ130204817 ScholiaQ130204817MaRDI QIDQ1742219

Yipeng Huang, Christophe Duhamel, Andréa Cynthia Santos

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)

Related Items (1)

Model and methods to address urban road network problems with disruptions

Cites Work

• Unnamed Item
• Unnamed Item
• Distances in orientations of graphs
• A review of urban transportation network design problems
• Strongly connected orientations of mixed multigraphs
• Robbins's Theorem for Mixed Multigraphs
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms

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