Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
From MaRDI portal
Publication:613225
Recommendations
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- scientific article; zbMATH DE number 1086906
- Bi-objective network equilibrium, traffic assignment and road pricing
- scientific article; zbMATH DE number 4016601
- On nonadditive route costs consideration for the traffic equilibrium problem
- A variational inequality formulation of the dynamic traffic assignment problem
- Optimization of congestion pricing road network with variable demands
- Traffic assignment: on the interplay between optimization and equilibrium problems
- scientific article; zbMATH DE number 3940094
- Equilibrium algorithms with nonmonotone line search technique for solving the traffic assignment problems
Cites work
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 1131717 (Why is no real title available?)
- scientific article; zbMATH DE number 844464 (Why is no real title available?)
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A class of iterative methods for solving nonlinear projection equations
- A class of projection and contraction methods for monotone variational inequalities
- A multiclass, multicriteria traffic network equilibrium model
- A new method for a class of linear variational inequalities
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- An approach to nonlinear programming
- Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
- Equilibrium, games, and pricing in transportation and telecommunication networks
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Network economics: a variational inequality approach
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Solving a class of linear projection equations
- The Traffic Equilibrium Problem with Nonadditive Path Costs
Cited in
(15)- An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- Reformulating the traffic equilibrium problem via a smooth gap function.
- A rank-dependent bi-criterion equilibrium model for stochastic transportation environment
- A global Jacobian smoothing algorithm for nonlinear complementarity problems
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- scientific article; zbMATH DE number 2065156 (Why is no real title available?)
- Modeling mode and route similarities in network equilibrium problem with go-green modes
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A Jacobian smoothing inexact Newton method for solving the nonlinear complementary problem
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- A simulated annealing for multi-criteria network path problems
- Algorithms for the Pareto solution of the multicriteria traffic equilibrium problem with capacity constraints of arcs
- Non-additive shortest path in the context of traffic assignment
This page was built for publication: Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613225)
