## 抄録

This paper proposes a model for a robust shortest path problem with random edge costs. The proposed model is formulated as a bicriteria optimization problem to minimize the total cost of the path from a start node to an end node as well as to maximize the range of the confidence interval satisfying the condition that the total cost of any path in the region is less than a target value in terms of robustness. It is not always the case that a solution that simultaneously optimizes all of the objectives exists when the objectives conflict with each other. In this paper, fuzzy goals for both objectives and the aggregation function are introduced in a solution approach that considers the decision maker's preference and the subjectivity of her or his judgment in multicriteria decision making. The fuzzy bicriteria problem is transformed into a constrained shortest path problem. Furthermore, an exact algorithm based on Dijkstra's algorithm and a heuristic algorithm based on the Lagrange relaxation-based algorithm are developed for the constrained shortest path problem.

本文言語 | English |
---|---|

ページ（範囲） | 520-533 |

ページ数 | 14 |

ジャーナル | Information Sciences |

巻 | 221 |

DOI | |

出版ステータス | Published - 2013 2月 1 |

外部発表 | はい |

## ASJC Scopus subject areas

- ソフトウェア
- 制御およびシステム工学
- 理論的コンピュータサイエンス
- コンピュータ サイエンスの応用
- 情報システムおよび情報管理
- 人工知能