Model and methods to address urban road network problems with disruptions
From MaRDI portal
Publication:6069920
DOI10.1111/itor.12641OpenAlexW2915950976WikidataQ128363401 ScholiaQ128363401MaRDI QIDQ6069920
Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12641
Related Items (5)
Metaheuristics for the work‐troops scheduling problem ⋮ The strong network orientation problem ⋮ Optimal mixed charging schemes for traffic congestion management with subsidy to new energy vehicle users ⋮ Decentralized resource allocation for interdependent infrastructures resilience: a cooperative game approach ⋮ Learn to decompose multiobjective optimization models for large‐scale networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic shortest path problems: hybrid routing policies considering network disruptions
- Optimizing reserve capacity of urban road networks in a discrete network design problem
- Finding strong bridges and strong articulation points in linear time
- On the minimization of traffic congestion in road networks with tolls
- On arc reversal in balanced digraphs
- Counterexamples to Adám's conjecture on arc reversals in directed graphs
- Distances in orientations of graphs
- Methods for solving road network problems with disruptions
- Probability distribution of solution time in GRASP: an experimental investigation
- Biased random-key genetic algorithms with applications in telecommunications
- A column generation approach for the strong network orientation problem
- Heuristics for urban road network design: lane layout and signal settings
- TTT plots: a perl program to create time-to-target plots
- Survey of research in the design and control of automated guided vehicle systems
- Directing Road Networks by Listing Strong Orientations
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- Strongly connected orientations of mixed multigraphs
- Robbins's Theorem for Mixed Multigraphs
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Iterated local search and simulated annealing algorithms for the inventory routing problem
- Scheduling and routing algorithms for AGVs: A survey
- Arc reversal in nonhamiltonian circulant oriented graphs
- Randomized heuristics for the family traveling salesperson problem
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
- Depth-First Search and Linear Graph Algorithms
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: Model and methods to address urban road network problems with disruptions
