Efficient solution generation for the bicriterion shortest path problems

DOI10.1504/IJOR.2010.035522MaRDI QIDQ606615zbMATH OpenOpenAlexFDO

Authors Abdallah W. Aboutahoun

Publication date 17 November 2010

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijor.2010.035522

zbMATH Keywords

network optimisationcontinuous relaxationbiobjective shortest path problemBSPPefficient extreme pointsnon-dominated setssimplex based algorithms

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Recommendations

• A parametric approach to solving bicriterion shortest path problems
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• A label correcting approach for solving bicriterion shortest-path problems
• A genetic algorithms to solve the bicriteria shortest path problem

Cited in

(10)

• A parametric approach to solving bicriterion shortest path problems
• On the sum-max bicriterion path problem.
• A genetic algorithms to solve the bicriteria shortest path problem
• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
• A comparison of solution strategies for biobjective shortest path problems
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Finding non-dominated bicriteria shortest pairs of disjoint simple paths
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• A comparison of heuristic best-first algorithms for bicriterion shortest path problems
• A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow

This page was built for publication: Efficient solution generation for the bicriterion shortest path problems

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