Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
DOI10.1016/J.AMC.2010.08.035zbMATH Open1202.90059OpenAlexW2043633463MaRDI QIDQ613225FDOQ613225
Jun-Seok Oh, Dongjoo Park, Anthony Chen, Will Recker
Publication date: 20 December 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.08.035
Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Traffic problems in operations research (90B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Network economics: a variational inequality approach
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- A class of iterative methods for solving nonlinear projection equations
- A class of projection and contraction methods for monotone variational inequalities
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Modified Projection-Type Methods for Monotone Variational Inequalities
- A new method for a class of linear variational inequalities
- Equilibrium, games, and pricing in transportation and telecommunication networks
- An approach to nonlinear programming
- A multiclass, multicriteria traffic network equilibrium model
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- Solving a class of linear projection equations
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
Cited In (10)
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- A Jacobian smoothing inexact Newton method for solving the nonlinear complementary problem
- Non-additive shortest path in the context of traffic assignment
- Un algoritmo global con jacobiano suavizado para problemas de complementariedad no lineal
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
- A rank-dependent bi-criterion equilibrium model for stochastic transportation environment
- A simulated annealing for multi-criteria network path problems
- An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix
- Modeling mode and route similarities in network equilibrium problem with go-green modes
Recommendations
- Optimization of congestion pricing road network with variable demands 👍 👎
- The Traffic Equilibrium Problem with Nonadditive Path Costs 👍 👎
- A variational inequality formulation of the dynamic traffic assignment problem 👍 👎
- Equilibrium algorithms with nonmonotone line search technique for solving the traffic assignment problems 👍 👎
- Traffic assignment: on the interplay between optimization and equilibrium problems 👍 👎
- Bi-Objective Network Equilibrium, Traffic Assignment and Road Pricing 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
