An interactive approach to identify the best compromise solution for two objective shortest path problems

DOI10.1016/0305-0548(90)90042-6zbMath0698.90084OpenAlexW2025640489MaRDI QIDQ912767

Jared L. Cohon, John R. Current, Charles S. Re Velle

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90042-6

zbMATH Keywords

decision makingshortest pathinteractive methodtwo objectivesnoninferior set estimationnoninferior solution set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)

Related Items (18)

An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs ⋮ The median tour and maximal covering tour problems: Formulations and heuristics ⋮ Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Multiobjective routing of hazardous materials in stochastic networks ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem ⋮ Multiobjective routing problems ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ On the sum-max bicriterion path problem. ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Routing with nonlinear multiattribute cost functions ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A combined interactive approach for solving E-convex multiobjective nonlinear programming problem ⋮ The determination of the path with minimum-cost norm value ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ A bi-objective uncapacitated facility location problem ⋮ A multiobjective approach to vendor selection

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• On a multicriteria shortest path problem
• The shortest path problem with two objective functions
• Multiobjective programming and planning
• A bicriterion shortest path algorithm
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• Shortest-path algorithms: Taxonomy and annotation
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• An efficient algorithm for K shortest simple paths
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• Deterministic network optimization: A bibliography

This page was built for publication: An interactive approach to identify the best compromise solution for two objective shortest path problems