ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the single objective problem and the third approach is based on dynamic programming. The labeling methods usually producing several nondominated paths, we propose a fuzzy number ranking method to determine a fuzzy short- est path. Illustrative examples are worked out to show the e ectiveness of our algorithms.