Routing with nonlinear multiattribute cost functions

DOI10.1016/0096-3003(93)90060-RzbMath0777.90060OpenAlexW2066060390MaRDI QIDQ686201

Pitu B. Mirchandani, Malgorzata M. Wiecek

Publication date: 14 October 1993

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(93)90060-r

zbMATH Keywords

surveymultiple criteriaapproximate algorithmsPareto-optimal paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06)

Related Items

The most critical path in a PERT network: A heuristic approach ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Multicriteria adaptive paths in stochastic, time-varying networks

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On a multicriteria shortest path problem
• Shortest paths in networks with vector weights
• A parametric approach to solving bicriterion shortest path problems
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• The shortest path problem with two objective functions
• Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
• A bicriterion shortest path algorithm
• An empirical investigation of some bicriterion shortest path algorithms
• Time dependency in multiple objective dynamic programming
• A multiple criteria decision making approach for the assembly line balancing problem
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• On the Maximum Expected Flow in a Network
• Technical Note—Shortest-Path Algorithms: A Comparison
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• An Appraisal of Some Shortest-Path Algorithms