Algorithms for biobjective shortest path problems in fuzzy networks

MaRDI QIDQ4915506zbMATH OpenFDO

Authors Iraj Mahdavi, Nezam Mahdavi-Amiri, Shahrbanoo Nejati

Publication date 10 April 2013

zbMATH Keywords

biobjective shortest pathdynamic programmingfuzzy networkfuzzy ranking methodslabeling method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• Algorithm for fuzzy multi-objective shortest path problem
• A shortest path problem on a network with fuzzy arc lengths
• Shortest path problem in a fuzzy network
• Fuzzy shortest path problem with finite fuzzy quantities
• The shortest path problem with discrete fuzzy arc lengths

Cited in

(4)

• A biobjective Dijkstra algorithm
• A new algorithm for the discrete fuzzy shortest path problem in a network
• Algorithm for fuzzy multi-objective shortest path problem
• A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network

This page was built for publication: Algorithms for biobjective shortest path problems in fuzzy networks

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