On a multicriteria shortest path problem
From MaRDI portal
Publication:790051
DOI10.1016/0377-2217(84)90077-8zbMath0533.90090OpenAlexW2051956023MaRDI QIDQ790051
Ernesto Queirós Vieira Martins
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90077-8
algorithmsspanning tree444.90098Multicriteria shortest path problemsmultiple labelling schemenon-dominated paths
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)
Related Items (96)
Multiobjective routing of hazardous materials in stochastic networks ⋮ Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ Minmax robustness for multi-objective optimization problems ⋮ Multiobjective shortest path problems with lexicographic goal-based preferences ⋮ Optimization problems with color-induced budget constraints ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Coordinated routing of electric commercial vehicles with intra-route recharging and en-route battery swapping ⋮ Two exact algorithms for the traveling umpire problem ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Path Problems in Complex Networks ⋮ Unnamed Item ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ Bicriteria shortest path in networks of queues ⋮ Choquet-based optimisation in multiobjective shortest path and spanning tree problems ⋮ On computing Pareto optimal paths in weighted time-dependent networks ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Multiobjective routing problems ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ Finding all nondominated points of multi-objective integer programs ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ An improved multiobjective shortest path algorithm ⋮ Computing representations using hypervolume scalarizations ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ Unnamed Item ⋮ Time depending shortest-path problems with applications to railway networks ⋮ An aggregate label setting policy for the multi-objective shortest path problem ⋮ Solving the multi‐objective bike routing problem by meta‐heuristic algorithms ⋮ Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ The Steiner bi-objective shortest path problem ⋮ On the minimum \(s-t\) cut problem with budget constraints ⋮ Targeted multiobjective Dijkstra algorithm ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Lower bound sets for biobjective shortest path problems ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ An interactive approach to identify the best compromise solution for two objective shortest path problems ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Generalized multiple objective bottleneck problems ⋮ Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem ⋮ Connectedness of efficient solutions in multiple objective combinatorial optimization ⋮ Fuzzy shortest path problems incorporating interactivity among paths. ⋮ An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ A biobjective Dijkstra algorithm ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ A robust optimization approach with probe-able uncertainty ⋮ A multicriteria Pareto-optimal path algorithm ⋮ Routing with nonlinear multiattribute cost functions ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Efficient solutions for the bicriteria network flow problem ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Network reduction for the acyclic constrained shortest path problem ⋮ The shortest path problem with discrete fuzzy arc lengths ⋮ The fuzzy shortest path length and the corresponding shortest path in a network ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ A new algorithm for the discrete fuzzy shortest path problem in a network ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ On finding dissimilar Pareto-optimal paths ⋮ Minimum cost path problems with relays ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ The determination of the path with minimum-cost norm value ⋮ A bicriterion approach for routing problems in multimedia networks ⋮ Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks ⋮ Hierarchical Multiobjective Shortest Path Problems ⋮ Energy-optimal routes for battery electric vehicles ⋮ Heuristics for the bi-objective path dissimilarity problem ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ Candidate Sets for Alternative Routes in Road Networks ⋮ Combinatorial optimization in system configuration design ⋮ Connectedness of efficient solutions in multiple criteria combinatorial optimization ⋮ An empirical investigation of some bicriterion shortest path algorithms ⋮ Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications ⋮ Optimization Problems with Color-Induced Budget Constraints ⋮ A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ Shortest paths with ordinal weights ⋮ Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles ⋮ The rough interval shortest path problem ⋮ Optimal Control with Budget Constraints and Resets ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite ⋮ Dynamic shortest path in stochastic dynamic networks: Ship routing problem ⋮ Analysis of multicriteria decision aid in Europe
Cites Work
This page was built for publication: On a multicriteria shortest path problem
