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

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

John R. Current, Jared L. Cohon, 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 making; shortest path; interactive method; two objectives; noninferior set estimation; noninferior solution set

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C31: Sensitivity, stability, parametric optimization

90B50: Management decision making, including multiple objectives

Related Items

The determination of the path with minimum-cost norm value, Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, Label correcting methods to solve multicriteria shortest path problems, Routing with nonlinear multiattribute cost functions, Optimal paths in bi-attribute networks with fractional cost functions, A bi-objective uncapacitated facility location problem, A multiobjective approach to vendor selection, The median tour and maximal covering tour problems: Formulations and heuristics, On the sum-max bicriterion path problem., The interactive analysis of the multicriteria shortest path problem by the reference point method., Multiobjective routing problems, Multiobjective transportation network design and routing problems: Taxonomy and annotation, Multiobjective routing of hazardous materials in stochastic networks

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