The interactive analysis of the multicriteria shortest path problem by the reference point method.
From MaRDI portal
Publication:1406958
DOI10.1016/S0377-2217(02)00594-5zbMath1043.90077WikidataQ58921715 ScholiaQ58921715MaRDI QIDQ1406958
Janusz Granat, Francesca Guerriero
Publication date: 7 September 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (11)
Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ On nadir points of multiobjective integer programming problems ⋮ Common Route Planning for Carpoolers – Model and Exact Algorithm ⋮ An interactive algorithm for multi-objective route planning ⋮ An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ An interactive algorithm for deciding multi‐criteria weights in incomplete information environment ⋮ Using matrices to link conflict evolution and resolution in a graph model ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ Computing the nadir point for multiobjective discrete optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a multicriteria shortest path problem
- A parametric approach to solving bicriterion shortest path problems
- Generalized dynamic programming for multicriteria optimization
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- Theory of multiobjective optimization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- A bicriterion shortest path algorithm
- A multicriteria Pareto-optimal path algorithm
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
- An interactive procedure using domination cones for bicriterion shortest path problems
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Interactive specification and analysis of aspiration-based preferences.
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- An empirical investigation of some bicriterion shortest path algorithms
- Parallel asynchronous label-correcting methods for shortest paths
- A label correcting approach for solving bicriterion shortest-path problems
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A simple and fast label correcting algorithm for shortest paths
- A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
This page was built for publication: The interactive analysis of the multicriteria shortest path problem by the reference point method.
