Nonlinear min-cost-pursued route-swapping dynamic system
Summary: This study proposes a nonlinear min-cost-pursued swapping dynamic (NMSD) system to model the evolution of selfish routing games on traffic network where travelers only swap from previous costly routes to the least costly ones. NMSD is a rational behavior adjustment process with stationary link flow pattern being the Wardrop user equilibrium. NMSD is able to prevent two behavioral deficiencies suffered by the existing min-cost-oriented models and keep solution invariance. NMSD relaxes the homogeneous user assumption, and the continuous-time NMSD (CNMSD) and discrete-time NMSD (DNMSD) share the same revision protocol. Moreover, CNMSD is Lyapunov-stable. Two numerical examples are conducted. The first one is designed to characterize the NMSD-conducted network traffic evolution and test the stability of day-to-day NMSD. The second one aims to explore the impacts of network scale on the stability of route-swaps conducted by pairwise and min-cost-pursed swapping behaviors.
- A nonlinear pairwise swapping dynamics to model the selfish rerouting evolutionary game
- Nonlinear relative-proportion-based route adjustment process for day-to-day traffic dynamics: modeling, equilibrium and stability analysis
- A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium
- Routing into two parallel links: Game-theoretic distributed algorithms
- Selfish Routing in Capacitated Networks
This page was built for publication: Nonlinear min-cost-pursued route-swapping dynamic system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312191)
