A genetic algorithm for the fuzzy shortest path problem in a fuzzy network

被引:21
作者
Lin, Lihua [1 ]
Wu, Chuzheng [1 ]
Ma, Li [1 ]
机构
[1] Xian Univ Sci & Technol, Dept Telecommun & Informat, Xian 710054, Peoples R China
基金
中国国家自然科学基金;
关键词
Fuzzy graph; Shortest path problem; Fuzzy shortest path problem; Genetic algorithm; ROBUST;
D O I
10.1007/s40747-020-00195-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The shortest path problem (SPP) is an optimization problem of determining a path between specified source vertexsand destination vertextin a fuzzy network. Fuzzy logic can handle the uncertainties, associated with the information of any real life problem, where conventional mathematical models may fail to reveal proper result. In classical SPP, real numbers are used to represent the arc length of the network. However, the uncertainties related with the linguistic description of arc length in SPP are not properly represented by real number. We need to address two main matters in SPP with fuzzy arc lengths. The first matter is how to calculate the path length using fuzzy addition operation and the second matter is how to compare the two different path lengths denoted by fuzzy parameter. We use the graded mean integration technique of triangular fuzzy numbers to solve this two problems. A common heuristic algorithm to solve the SPP is the genetic algorithm. In this manuscript, we have introduced an algorithmic method based on genetic algorithm for determining the shortest path between a source vertex s and destination vertex t in a fuzzy graph with fuzzy arc lengths in SPP. A new crossover and mutation is introduced to solve this SPP. We also describe the QoS routing problem in a wireless ad hoc network.
引用
收藏
页码:225 / 234
页数:10
相关论文
共 40 条
[1]   Analysis of Feeder Bus Network Design and Scheduling Problems [J].
Almasi, Mohammad Hadi ;
Mounes, Sina Mirzapour ;
Koting, Suhana ;
Karim, Mohamed Rehan .
SCIENTIFIC WORLD JOURNAL, 2014,
[2]   Unified approach to fuzzy graph problems [J].
Blue, M ;
Bush, B ;
Puckett, J .
FUZZY SETS AND SYSTEMS, 2002, 125 (03) :355-368
[3]  
Chanas S., 1983, INTERVAL FUZZY MATH, P35
[4]   Distance formula and shortest paths for the (n, k)-star graphs [J].
Cheng, Eddie ;
Grossman, Jerrold W. ;
Liptak, Laszlo ;
Qiu, Ke ;
Shen, Zhizhang .
INFORMATION SCIENCES, 2010, 180 (09) :1671-1680
[5]   The canonical representation of multiplication operation on triangular fuzzy numbers [J].
Chou, CC .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2003, 45 (10-11) :1601-1610
[6]  
Cormen T. H., 2001, The Knuth-Morris-Pratt Algorithm, V2nd
[7]   Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment [J].
Deng, Yong ;
Chen, Yuxin ;
Zhang, Yajuan ;
Mahadevan, Sankaran .
APPLIED SOFT COMPUTING, 2012, 12 (03) :1231-1237
[8]  
Dijkstra E. W., 1959, NUMERISCHE MATH, V1, P269, DOI [10.1007/BF01386390/METRICS, 10.1007/BF01386390, DOI 10.1007/BF01386390]
[9]  
Dubois Didier J, 1980, FUZZY SETS SYSTEMS T, V144
[10]   Heuristic shortest path algorithms for transportation applications: State of the art [J].
Fu, L ;
Sun, D ;
Rilett, LR .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (11) :3324-3343