ORDER RELATION BETWEEN INTERVALS AND ITS APPLICATION TO SHORTEST-PATH PROBLEM

被引：17

作者：

OKADA, S ^{[1
]}

GEN, M ^{[1
]}

机构：

[1] ASHIKAGA INST TECHNOL,ASHIKAGA 326,JAPAN

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 1993年 / 25卷 / 1-4期

关键词：

INTERVAL; ORDER RELATION; NETWORK; SHORTEST PATH PROBLEM;

D O I：

10.1016/0360-8352(93)90242-P

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

It is true that intervals are frequently partially ordered and cannot be compared. Nevertheless, various definitions for ranking intervals have been proposed. In this paper, we propose a new definition for order relation between intervals by introducing a Parameter called ''a degree between partial and total order'', and apply it to the shortest path problem with arcs represented as intervals. In order to solve this problem, we modify the Dijkstra's algorithm, and propose a new algorithm obtaining some incomparable interval solutions. Finally, a numerical example is shown.

引用

页码：147 / 150

页数：4

共 7 条

[1]

Alefeld G., 1983, INTRO INTERVAL COMPU, P1

[2]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[3] RANKING FUZZY NUMBERS IN THE SETTING OF POSSIBILITY THEORY [J].