The shortest path problem with two objective functions

DOI10.1016/0377-2217(86)90092-5zbMath0594.90087OpenAlexW1998132337MaRDI QIDQ1077332

Mordechai I. Henig

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90092-5

zbMATH Keywords

branch and boundnondominated pathsquasiconvex utility functionsshortest path in a networktwo objective functions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Utility theory (91B16)

Related Items (50)

A new look at fractional programming ⋮ The median tour and maximal covering tour problems: Formulations and heuristics ⋮ Experiments with dynamic programming algorithms for nonseparable problems ⋮ Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Decision-making based on approximate and smoothed Pareto curves ⋮ The most critical path in a PERT network: A heuristic approach ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Discrete dynamic programming with outcomes in random variable structures ⋮ A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem ⋮ New approach for nonseparable dynamic programming problems ⋮ C-programming: A nonlinear parametric optimization method ⋮ Balancing profits and costs on trees ⋮ Paths with minimum range and ratio of arc lengths ⋮ Multiobjective routing problems ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Multi-postpath-based lookahead multiconstraint QoS routing ⋮ Enabling local computation for partially ordered preferences ⋮ A general decomposition approach for multi-criteria decision trees ⋮ A fully polynomial time approximation scheme for the probability maximizing shortest path problem ⋮ Variable-sized uncertainty and inverse problems in robust optimization ⋮ On the sum-max bicriterion path problem. ⋮ Generalized dynamic programming for multicriteria optimization ⋮ An interactive approach to identify the best compromise solution for two objective shortest path problems ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Extension of dynamic programming to nonseparable dynamic optimization problems ⋮ Fast approximation algorithms for routing problems with hop-wise constraints ⋮ Maximum probability shortest path problem ⋮ A survey of recent developments in multiobjective optimization ⋮ A multicriteria Pareto-optimal path algorithm ⋮ Routing with nonlinear multiattribute cost functions ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Network reduction for the acyclic constrained shortest path problem ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Nodal aggregation of resource constraints in a shortest path problem ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ C-programming and the minimization of pseudolinear and additive concave functions ⋮ The determination of the path with minimum-cost norm value ⋮ A new model for path planning with interval data ⋮ A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks ⋮ Local Computation Schemes with Partially Ordered Preferences ⋮ Efficiently Generating k-Best Solutions to Procurement Auctions ⋮ Low earth orbit satellite based communication systems -- research opportunities ⋮ An empirical investigation of some bicriterion shortest path algorithms ⋮ Infrastructure development for conversion to environmentally friendly fuel ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite ⋮ An interactive procedure using domination cones for bicriterion shortest path problems ⋮ A parametric approach to solving bicriterion shortest path problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bicriterion shortest path algorithm
• Dynamic programming in multiplicative lattices
• Validity of Local Search in Multiparametric and Vector Linear Programming
• Combinatorial Optimization with Rational Objective Functions
• Note on Multiple Objective Dynamic Programming
• Preference Order Dynamic Programming
• Ordinal Dynamic Programming
• Multidimensional Line Search Using a Binary Preference Relation
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Sur L'enveloppe convexe des nuages de points aleatoires dans Rⁿ. I

This page was built for publication: The shortest path problem with two objective functions