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

被引:0
|
作者
Lihua Lin
Chuzheng Wu
Li Ma
机构
[1] Xi’an University of Science and Technology,Department of Telecommunication and information
来源
关键词
Fuzzy graph; Shortest path problem; Fuzzy shortest path problem; Genetic algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
The shortest path problem (SPP) is an optimization problem of determining a path between specified source vertex s and destination vertex t in 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
页数:9
相关论文
共 50 条
  • [31] Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
    Parimala, Mani
    Broumi, Said
    Prakash, Karthikeyan
    Topal, Selcuk
    COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (05) : 2373 - 2381
  • [32] Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem
    Dey, Arindam
    Pal, Anita
    Pal, Tandra
    MATHEMATICS, 2016, 4 (04)
  • [33] Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
    Broumi, Said
    Talea, Mohamed
    Bakali, Assia
    Smarandache, Florentin
    Nagarajan, Deivanayagampillai
    Lathamaheswari, Malayalan
    Parimala, Mani
    COMPLEX & INTELLIGENT SYSTEMS, 2019, 5 (04) : 371 - 378
  • [34] Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
    Said Broumi
    Mohamed Talea
    Assia Bakali
    Florentin Smarandache
    Deivanayagampillai Nagarajan
    Malayalan Lathamaheswari
    Mani Parimala
    Complex & Intelligent Systems, 2019, 5 : 371 - 378
  • [35] Pythagorean fuzzy shortest hyper path in a network
    Basha, M. Asim
    Jabarulla, M. Mohammed
    JOURNAL OF INTERDISCIPLINARY MATHEMATICS, 2024, 27 (05) : 1163 - 1173
  • [36] Shortest path algorithm of a network via picture fuzzy digraphs and its application
    Mani, Parimala
    Vasudevan, Biju
    Sivaraman, Murali
    MATERIALS TODAY-PROCEEDINGS, 2021, 45 : 3014 - 3018
  • [37] A GENETIC ALGORITHM FOR SOLVING FUZZY SHORTEST PATH PROBLEMS WITH INTERVAL TYPE-2 FUZZY ARC LENGTHS
    Dey, Arindam
    Pradhan, Rangaballav
    Pal, Anita
    Pal, Tandra
    MALAYSIAN JOURNAL OF COMPUTER SCIENCE, 2018, 31 (04) : 255 - 270
  • [38] The shortest path problem with discrete fuzzy arc lengths
    Kung, JY
    Chuang, TN
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2005, 49 (2-3) : 263 - 270
  • [39] An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph
    Biswas, Siddhartha Sankar
    Alam, Bashir
    Doja, M. N.
    APPLIED COMPUTATIONAL INTELLIGENCE AND SOFT COMPUTING, 2013, 2013
  • [40] Fuzzy Shortest Path Algorithm Based on Comparative Relation
    Huyen, V. T. T.
    Luan, N. T.
    Tuan, L. M.
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2014, 14 (05): : 20 - 25