Highway Capacity Manual改訂の動向--テイラ-教授の講演より

Transportation research. part c, emerging technologies

Transportation Networks. Optimality. Cost Functions. Deterministic User Equilibrium Assignment. Stochastic User Equilibrium Assignment. Trip Table Estimation. Network Reliability. Network Design. Conclusions. References. Index.

Transportation network analysis

https://link.springer.com/content/pdf/10.1057%2Fjors.1996.159.pdf

Modeling and Analysis of Stochastic Systems

Transportation Research, Part A: Policy and Practice

Modeling Departure Time Decisions During Hurricanes Using a Dynamic Discrete Choice Framework

This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing In the self-interested routing policy each agent selects a path that optimizes its own utility, while the system-optimum routing agents are assigned paths with the goal of maximizing system performance This paper considers a scenario where a centralized network manager wishes to optimize utilities over all agents, ie, implement a system-optimum routing policy In many real-life scenarios, however, the system manager is unable to influence the route assignment of all agents due to limited influence on route choice decisions Motivated by such scenarios, a computationally tractable method is presented that computes the minimal amount of agents that the system manager needs to influence (compliant agents) in order to achieve system optimal performance Moreover, this methodology can also determine whether a given set of compliant agents is sufficient to achieve system optimum and compute the optimal route assignment for the compliant agents to do so Experimental results are presented showing that in several large-scale, realistic traffic networks optimal flow can be achieved with as low as 13% of the agent being compliant and up to 54%

Traffic Optimization For a Mixture of Self-interested and Compliant Agents

Traffic assignment is used to determine the number of users on roadway links in a network. While this problem has been widely studied in transportation literature, its use of the concept of equilibrium has attracted considerable interest in the field of game theory. The approaches used in both transportation and game theory disciplines are explored, and the similarities and dissimilarities between them are studied. In particular, treatment of multiple equilibrium solutions using equilibrium refinements and learning algorithms which converge to equilibria under incomplete information and/or bounded rationality of players are discussed in detail.

Game Theory and Traffic Assignment

Game Theory and Trac Assignment

Natural or human-made disasters often force individuals to evacuate to safer places. Depending on the nature of the disaster, evacuations may require people to travel short distances or long distances, and may affect a city, multiple states, or at times an entire nation. From a transportation perspective, resource constraints such as limited roadway capacity and vehicle availability restrict the ability to plan a safe and efficient evacuation. The chapter discusses the difficulties that surround a large-scale evacuation and presents a summary of studies that use mathematical models to address these problems. It highlights some of the challenges in post-disaster management. The chapter describes modeling approaches to forecast the decisions, and how simulation tools built on the principles can support advance planning for evacuations. Vehicle availability also plays a major role in evacuation, even in regions with a high per-capita automobile ownership rate, since households without automobiles often have fewer resources in general.

Tarun Rambha

Papers

Modeling Departure Time Decisions During Hurricanes Using a Dynamic Discrete Choice Framework

Traffic Optimization For a Mixture of Self-interested and Compliant Agents

Game Theory and Traffic Assignment

Game Theory and Trac Assignment

Transportation Network Issues in Evacuations