Non-additive shortest path in the context of traffic assignment
From MaRDI portal
Publication:1754328
Recommendations
- Algorithms – ESA 2004
- The Traffic Equilibrium Problem with Nonadditive Path Costs
- On nonadditive route costs consideration for the traffic equilibrium problem
- Multi-objective and multi-constrained non-additive shortest path problems
- Non-Convex Traffic Assignment on a Rectangular Grid Network
- scientific article; zbMATH DE number 1086906
- Algorithms for non-linear and stochastic resource constrained shortest path
- GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS
- On One Routing Problem with Non-Additive Cost Aggregation
- scientific article; zbMATH DE number 1488064
Cites work
- A bicriterion shortest path algorithm
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- A comparison of solution strategies for biobjective shortest path problems
- A framework for and empirical study of algorithms for traffic assignment
- A label correcting approach for solving bicriterion shortest-path problems
- A multicriteria Pareto-optimal path algorithm
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Algorithms for time-dependent bicriteria shortest path problems
- Algorithms – ESA 2004
- An aggregate label setting policy for the multi-objective shortest path problem
- Cost versus time equilibrium over a network
- Efficient models for timetable information in public transportation systems
- Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
- Multi-objective and multi-constrained non-additive shortest path problems
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- On the convergence of descent methods for monotone variational inequalities
- Origin-Based Algorithm for the Traffic Assignment Problem
- Polynomial-time construction of contraction hierarchies for multi-criteria objectives
- Reformulating the traffic equilibrium problem via a smooth gap function.
- Routing with nonlinear multiattribute cost functions
- Shortest paths on dynamic graphs
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- Speeding up Martins' algorithm for multiple objective shortest path problems
Cited in
(6)- Shortest Paths with Bundles and Non-additive Weights Is Hard
- 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
- Algorithms – ESA 2004
- On One Routing Problem with Non-Additive Cost Aggregation
- On nonadditive route costs consideration for the traffic equilibrium problem
This page was built for publication: Non-additive shortest path in the context of traffic assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754328)
