Solving the nonadditive traffic equilibrium problem

MaRDI QIDQ4363161zbMATH OpenFDO

Authors David Bernstein, Steven A. Gabriel

Publication date 18 December 1997

zbMATH Keywords

NE/SQP algorithmnonlinear complementaritytraffic equilibrium

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• The Traffic Equilibrium Problem with Nonadditive Path Costs
• Improved noniterative algorithm for solving the traffic equilibrium problem
• A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
• Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
• On nonadditive route costs consideration for the traffic equilibrium problem

Cited in

(18)

• A globally convergent algorithm for solving special utilization equations
• Reformulating the traffic equilibrium problem via a smooth gap function.
• Non-additive shortest path in the context of traffic assignment
• A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
• Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
• Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem
• Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
• A complementary formulation for traffic equilibrium problem with a new nonadditive route cost
• The Traffic Equilibrium Problem with Nonadditive Path Costs
• On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
• Solving multi-objective traffic assignment
• On nonadditive route costs consideration for the traffic equilibrium problem
• A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
• Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
• A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
• A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand
• Improved noniterative algorithm for solving the traffic equilibrium problem

This page was built for publication: Solving the nonadditive traffic equilibrium problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363161)