Traffic assignment problem for a general network

DOI10.6028/jres.073B.010zbMath0197.46003OpenAlexW2006122291MaRDI QIDQ5595976

Frederick T. Sparrow, Stella Dafermos

Publication date: 1969

Published in: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.6028/jres.073b.010

zbMATH Keywords

operations research

Related Items

Competitive routing in multicast communications, A convergence analysis of the price of anarchy in atomic congestion games, The Value of Information in Selfish Routing, Braess' paradox: A cooperative game‐theoretic point of view, Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network, Human migration networks and policy interventions: bringing population distributions in line with system optimization, An alternating direction method of multipliers for solving user equilibrium problem, On replicator equations with nonlinear payoff functions defined by the Ricker models, The price of anarchy in routing games as a function of the demand, Price of Anarchy in Networks with Heterogeneous Latency Functions, Traffic assignment: on the interplay between optimization and equilibrium problems, A convergent and fast path equilibration algorithm for the traffic assignment problem, Evolutionary Game Theory, Financial networks with electronic transactions: modelling, analysis and computations, Fragile networks: identifying vulnerabilities and synergies in an uncertain age, Potential games with continuous player sets, The Dynamic Distance Potential Field in a Situation with Asymmetric Bottleneck Capacities, The price of anarchy is independent of the network topology, Nonadaptive Selfish Routing with Online Demands, Sensitivity of Wardrop Equilibria, Network investment games with Wardrop followers, Selfishness Need Not Be Bad, Financial networks with intermediation: risk management with variable weights, Hub location problems with price sensitive demands, Capacitated refueling station location problem with traffic deviations over multiple time periods, Equilibria on a Congested Transportation Network, On the relationship between Nash—Cournot and Wardrop equilibria, A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods, Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers, Bounding the inefficiency of equilibria in nonatomic congestion games, An algorithm for the classical spatial price equilibrium problem, A maximum entropy fixed-point route choice model for route correlation, A comparison of dynamic user optimal states with zero, fixed and variable tolerances, Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium, Competitive online multicommodity routing, A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand, An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints, Price competition with elastic traffic, The evolution and emergence of integrated social and financial networks with electronic transactions: A dynamic supernetwork theory for the modeling, analysis, and computation of financial flows and relationship levels, Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models, A modified gradient projection algorithm for solving the elastic demand traffic assignment problem, A traffic congestion analysis by user equilibrium and system optimum with incomplete information, A general dynamic spatial price equilibrium model: Formulation, solution, and computational results, Dynamic traffic assignment: Considerations on some deterministic modelling approaches, Column generation for the equilibrium route-flow traffic assignment problem, A network model and algorithm for the analysis and estimation of financial flow of funds, Bilevel programming in traffic planning: Models, methods and challenge, An enhanced dynamic user optimal passenger flow assignment model for metro networks, Formulation and analysis of horizontal mergers among oligopolistic firms with insights into the merger paradox: A supply chain network perspective, Formulation, stability, and computation of traffic network equilibria as projected dynamical systems, Selective bi-coordinate method for limit non-smooth resource allocation type problems, Multiperiod competitive supply chain networks with inventorying and a transportation network equilibrium reformulation, Retarded weighted quasi-variational inequalities for traffic equilibrium problems, Pricing with markups in industries with increasing marginal costs, Demand allocation with latency cost functions, On the performance of approximate equilibria in congestion games, The convergence of equilibrium algorithms with non-monotone line search technique., Dynamics of international financial networks with risk management, A survey of dynamic network flows, A network model of migration equilibrium with movement costs, An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem, Selfish splittable flows and NP-completeness, A survey on the continuous nonlinear resource allocation problem, The price of anarchy in an exponential multi-server, Toll caps in privatized road networks, A path-based double projection method for solving the asymmetric traffic network equilibrium problem, Optimal routing for multiclass networks, Solving multi-objective traffic assignment, The toll effect on price of anarchy when costs are nonlinear and asymmetric, A network equilibrium framework for internet advertising: models, qualitative analysis, and algorithms, A unified network performance measure with importance identification and the ranking of network components, Financial networks with intermediation and transportation network equilibria: A supernetwork equivalence and reinterpretation of the equilibrium conditions with computations, The internet, evolutionary variational inequalities, and the time-dependent Braess paradox, Unnamed Item, Human migration networks, On the continuous quadratic knapsack problem, A new model for selfish routing, Multi-product supply chain horizontal network integration: models, theory, and computational results, Nash equilibria in discrete routing games with convex latency functions, Improving the price of anarchy for selfish routing via coordination mechanisms, Algorithms for quadratic constrained matrix problems, Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem, Dynamic traffic network equilibrium system, A network efficiency measure with application to critical infrastructure networks, Extending the notion of rationality of selfish agents: second order Nash equilibria, Stackelberg strategies and collusion in network games with splittable flow, Optimal routing of vehicles with communication capabilities in disasters, A heuristic algorithm for network equilibration, How much can taxes help selfish routing?, On the severity of Braess's paradox: designing networks for selfish users is hard, Refugee migration networks and regulations: a multiclass, multipath variational inequality framework, Equilibria for networks with malicious users, Sensitivity of Wardrop equilibria, A relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behavior, Stackelberg Strategies and Collusion in Network Games with Splittable Flow, A note on a parameter relating traffic equilibria and system optimal routing, An algorithm for nonlinear multicommodity flow problems, Braess's Paradox in large random graphs, A convergent and efficient decomposition method for the traffic assignment problem, The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions, The price of anarchy in nonatomic consumption-relevance congestion games, A unified convergence framework for nonmonotone inexact decomposition methods, Edge pricing of multicommodity networks for selfish users with elastic demands, Models of Non-atomic Congestion Games – From Unicast to Multicast Routing, Unloading of congestion in deterministic queueing networks, The analysis of Braess' paradox and robustness based on dynamic traffic assignment models, Efficiency and fairness of system-optimal routing with user constraints, Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium, Equilibrium programming:The path following approach and dynamics, A multiclass, multicriteria traffic network equilibrium model, A supply chain network game theory model with product differentiation, outsourcing of production and distribution, and quality and price competition, Optimal control of store-and-forward networks, Pharmaceutical supply chain networks with outsourcing under price and quality competition, Teleshopping versus shopping: A multicriteria network equilibrium framework, Massively parallel implementation of the splitting equilibration algorithm, Multicriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshopping, A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times, A unified description of iterative algorithms for traffic equilibria, The existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problems, A variational inequality formulation of the dynamic traffic assignment problem, Spatial market equilibrium problems as network models, Management of knowledge intensive systems as supernetworks: modeling, analysis, computations, and applications