Non-additive shortest path in the context of traffic assignment
From MaRDI portal
Publication:1754328
DOI10.1016/j.ejor.2018.01.017zbMath1403.90227OpenAlexW2782972773MaRDI QIDQ1754328
Olga Perederieieva, Andrea Raith, Marie E. Schmidt
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.01.017
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Traffic problems in operations research (90B20)
Related Items (2)
Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models
Cites Work
- A framework for and empirical study of algorithms for traffic assignment
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- Multi-objective and multi-constrained non-additive shortest path problems
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- An aggregate label setting policy for the multi-objective shortest path problem
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
- Routing with nonlinear multiattribute cost functions
- A comparison of solution strategies for biobjective shortest path problems
- Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
- A bicriterion shortest path algorithm
- A multicriteria Pareto-optimal path algorithm
- Cost versus time equilibrium over a network
- Reformulating the traffic equilibrium problem via a smooth gap function.
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- On the convergence of descent methods for monotone variational inequalities
- A label correcting approach for solving bicriterion shortest-path problems
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Algorithms for time-dependent bicriteria shortest path problems
- Efficient models for timetable information in public transportation systems
- Shortest paths on dynamic graphs
- Origin-Based Algorithm for the Traffic Assignment Problem
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives
- Algorithms – ESA 2004
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
This page was built for publication: Non-additive shortest path in the context of traffic assignment
