Fuzzy Ant Colony Optimization algorithm for Shortest Path Problem under uncertain environment

被引：0
|
作者：
Yin, Wenshuang [1 ]
Wei, Daijun [1 ]
机构：
[1] School of Science, Hubei University for Nationalities, No. 39, Xueyuan Road, Enshi 445000, China
来源：
ICIC Express Letters | 2014年 / 8卷 / 07期
基金：
中国国家自然科学基金;
关键词：
Artificial intelligence - Fuzzy rules - Ant colony optimization - Graph theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
How to solve the Shortest Path Problem (SPP) under uncertain environment is an open issue. In this paper, a generalized ant colony algorithm is proposed to deal with SPP under uncertain environment. First, we add each fuzzy number of two connected edges together. Second, by adopting the graded mean integration representation of fuzzy numbers, we can compare the distance between two different paths with their fuzzy path lengths. The proposed Fuzzy Ant Colony Optimization (FACO) algorithm can practically solve the SPP under fuzzy environment, especially in large-scale networks. A numerical example of a transportation network is provided to demonstrate the efficiency of the proposed method. © 2014 ISSN 1881-803X.
引用
收藏
页码：1839 / 1844
相关论文
共 50 条
  • [21] Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment
    Enayattabar, Mohammad
    Ebrahimnejad, Ali
    Motameni, Homayun
    COMPLEX & INTELLIGENT SYSTEMS, 2019, 5 (02) : 93 - 100
  • [22] Congested Traffic Based on Ant Colony Algorithm for Shortest Path Algorithm
    Yang Haoxiong
    Hu Yang
    2015 INTERNATIONAL CONFERENCE ON LOGISTICS, INFORMATICS AND SERVICE SCIENCES (LISS), 2015,
  • [23] A dynamic shortest path algorithm based on an improved ant colony algorithm
    Zhang, S. J.
    2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [24] Approach to Find Shortest Path Using Ant Colony Algorithm
    Basha, Mudasar
    Kumar, M. Siva
    Pranav, Vemulapalli Sai
    Rehman, B. Khaleelu
    INTELLIGENT COMMUNICATION, CONTROL AND DEVICES, ICICCD 2017, 2018, 624 : 1243 - 1252
  • [25] Compare Ant-colony and Genetic algorithm for shortest path problem and introduce their parallel implementations
    Katona, Geza
    Juhasz, Janos
    Lenart, Balazs
    2015 INTERNATIONAL CONFERENCE ON MODELS AND TECHNOLOGIES FOR INTELLIGENT TRANSPORTATION SYSTEMS (MT-ITS), 2015, : 312 - 319
  • [26] 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
  • [27] Shortest path problem using Bellman algorithm under neutrosophic environment
    Said Broumi
    Arindam Dey
    Mohamed Talea
    Assia Bakali
    Florentin Smarandache
    Deivanayagampillai Nagarajan
    Malayalan Lathamaheswari
    Ranjan Kumar
    Complex & Intelligent Systems, 2019, 5 : 409 - 416
  • [28] Shortest path problem using Bellman algorithm under neutrosophic environment
    Broumi, Said
    Dey, Arindam
    Talea, Mohamed
    Bakali, Assia
    Smarandache, Florentin
    Nagarajan, Deivanayagampillai
    Lathamaheswari, Malayalan
    Kumar, Ranjan
    COMPLEX & INTELLIGENT SYSTEMS, 2019, 5 (04) : 409 - 416
  • [29] A novel Hybrid ant colony algorithm for solving the shortest path problems with mixed fuzzy arc weights
    Alhousrya, Obaida
    Bennagi, Aseel
    Cotfas, Petru A.
    Cotfas, Daniel T.
    ALEXANDRIA ENGINEERING JOURNAL, 2024, 109 : 841 - 855
  • [30] A different approach for solving the shortest path problem under mixed fuzzy environment
    Kumar R.
    Jha S.
    Singh R.
    International Journal of Fuzzy System Applications, 2020, 9 (02) : 132 - 161
12345