Optimization models for large scale network evacuation planning and management: A literature review
V Bayram - Surveys in Operations Research and Management …, 2016 - Elsevier
This study presents a comprehensive review of network-based large scale emergency
evacuation planning and management literature. Evacuation planning and management …
evacuation planning and management literature. Evacuation planning and management …
Bridging the user equilibrium and the system optimum in static traffic assignment: a review
V Morandi - 4OR, 2024 - Springer
Solving the road congestion problem is one of the most pressing issues in modern cities
since it causes time wasting, pollution, higher industrial costs and huge road maintenance …
since it causes time wasting, pollution, higher industrial costs and huge road maintenance …
Nash equilibria and the price of anarchy for flows over time
R Koch, M Skutella - Theory of Computing Systems, 2011 - Springer
We study Nash equilibria in the context of flows over time. Many results on static routing
games have been obtained over the last ten years. In flows over time (also called dynamic …
games have been obtained over the last ten years. In flows over time (also called dynamic …
On the price of anarchy for flows over time
Dynamic network flows, or network flows over time, constitute an important model for real-
world situations where steady states are unusual, such as urban traffic and the Internet …
world situations where steady states are unusual, such as urban traffic and the Internet …
Solutions to the routing problem: towards trustworthy autonomous vehicles
LZ Varga - Artificial Intelligence Review, 2022 - Springer
The general expectation is that the traffic in the cities will be almost optimal when the
collective behaviour of autonomous vehicles will determine the traffic. Each member of the …
collective behaviour of autonomous vehicles will determine the traffic. Each member of the …
Long-term behavior of dynamic equilibria in fluid queuing networks
A fluid queuing network constitutes one of the simplest models in which to study flow
dynamics over a network. In this model we have a single source-sink pair, and each link has …
dynamics over a network. In this model we have a single source-sink pair, and each link has …
A Stackelberg strategy for routing flow over time
U Bhaskar, L Fleischer, E Anshelevich - Games and Economic Behavior, 2015 - Elsevier
Routing games are studied to understand the impact of individual users' decisions on
network efficiency. Most prior work on efficiency in routing games uses a simplified model …
network efficiency. Most prior work on efficiency in routing games uses a simplified model …
Dynamic equilibria in fluid queueing networks
R Cominetti, J Correa, O Larré - Operations Research, 2015 - pubsonline.informs.org
Flows over time provide a natural and convenient description for the dynamics of a
continuous stream of particles traveling from a source to a sink in a network, allowing to track …
continuous stream of particles traveling from a source to a sink in a network, allowing to track …
Convergence of approximate and packet routing equilibria to Nash flows over time
We consider a dynamic model of traffic that has received a lot of attention in the past few
years. Infinitesimally small agents aim to travel from a source to a destination as quickly as …
years. Infinitesimally small agents aim to travel from a source to a destination as quickly as …
Decentralized utilitarian mechanisms for scheduling games
Abstract Game Theory and Mechanism Design are by now standard tools for studying and
designing massive decentralized systems. Unfortunately, designing mechanisms that induce …
designing massive decentralized systems. Unfortunately, designing mechanisms that induce …