Routing with nonlinear multiattribute cost functions

DOI10.1016/0096-3003(93)90060-RzbMATH Open0777.90060OpenAlexW2066060390MaRDI QIDQ686201FDOQ686201

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

surveyapproximate algorithmsmultiple criteriaPareto-optimal paths

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Non-additive shortest path in the context of traffic assignment
• Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On One Routing Problem with Non-Additive Cost Aggregation
• The most critical path in a PERT network: A heuristic approach
• Optimal paths in bi-attribute networks with fractional cost functions
• Title not available (Why is that?)
• Multicriteria adaptive paths in stochastic, time-varying networks

Uses Software

• Algorithm 97

   Recommendations

• Title not available (Why is that?) 👍 👎
• Optimal paths in bi-attribute networks with fractional cost functions 👍 👎
• Title not available (Why is that?) 👍 👎
• Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Routing with nonlinear multiattribute cost functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686201)