Non-additive shortest path in the context of traffic assignment
DOI10.1016/J.EJOR.2018.01.017zbMATH Open1403.90227OpenAlexW2782972773MaRDI QIDQ1754328FDOQ1754328
Marie Schmidt, Olga Perederieieva, Andrea Raith
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
Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Traffic problems in operations research (90B20)
Cites Work
- Reformulating the traffic equilibrium problem via a smooth gap function.
- 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
- On the convergence of descent methods for monotone variational inequalities
- A label correcting approach for solving bicriterion shortest-path problems
- Origin-Based Algorithm for the Traffic Assignment Problem
- Multi-objective and multi-constrained non-additive shortest path problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A bicriterion shortest path algorithm
- A multicriteria Pareto-optimal path algorithm
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- A comparison of solution strategies for biobjective shortest path problems
- Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- A framework for and empirical study of algorithms for traffic assignment
- Efficient models for timetable information in public transportation systems
- 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
- Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
- On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
- Shortest paths on dynamic graphs
- Algorithms for time-dependent bicriteria shortest path problems
- Cost versus time equilibrium over a network
- Algorithms – ESA 2004
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost
- Routing with nonlinear multiattribute cost functions
- Speeding up Martins' algorithm for multiple objective shortest path problems
Cited In (4)
- 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
- On One Routing Problem with Non-Additive Cost Aggregation
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Multi-objective and multi-constrained non-additive shortest path problems 👍 👎
- The Traffic Equilibrium Problem with Nonadditive Path Costs 👍 👎
- Algorithms – ESA 2004 👍 👎
- GENERALIZED SHORTEST PATH AND TRAFFIC EQUILIBRIUM IN COMPLEX TRANSPORTATION NETWORKS 👍 👎
- Algorithms for non-linear and stochastic resource constrained shortest path 👍 👎
- On One Routing Problem with Non-Additive Cost Aggregation 👍 👎
- Non-Convex Traffic Assignment on a Rectangular Grid Network 👍 👎
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)
