A Node Selecting Approach for Traffic Network Based on Artificial Slime Mold

被引:12
作者
Cai, Zhengying [1 ]
Xiong, Zeping [1 ]
Wan, Kunpeng [1 ]
Xu, Yaqi [1 ]
Xu, Fan [1 ]
机构
[1] China Three Gorges Univ, Coll Comp & Informat Technol, Yichang 443002, Peoples R China
基金
中国国家自然科学基金;
关键词
Traffic network; node selecting; artificial intelligence; slime mold; foraging behaviour; ALGORITHM; RANKING; AWARE;
D O I
10.1109/ACCESS.2020.2964002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The node selecting problem of traffic network is a significant issue and is difficult to be solved. In this paper, an artificial slime mold method is proposed to help us solve the problem. First, the chief components of an artificial slime mold are introduced to simulate the foraging behavior of a true slime mold, including external food sources, plasmodium, myxamoeba, nucleus, and nutrients. Then the learning mechanism of nutrient concentration for the artificial slime mold is illustrated, though there is no brain or neuron in its body. After that, the node selecting approach is described according to the propagation capabilities of nodes. Second, the algorithm flow is designed to show how to solve this kind of complex selecting problem. The algorithm flow to select important traffic nodes by artificial slime mold is composed of 4 main steps, including initialization, food searching, feeding, and selecting for output. Third, a comprehensive example is designed and derived from references to certificate that the proposed artificial slime mold can help us select important traffic nodes by their generated traffic topologies. The contributions of this paper are important both for traffic node selecting and artificial learning mechanism in theoretical and practical aspects.
引用
收藏
页码:8436 / 8448
页数:13
相关论文
共 25 条
[1]   Approximating Mexican highways with slime mould [J].
Adamatzky, Andrew ;
Martinez, Genaro J. ;
Chapa-Vergara, Sergio V. ;
Asomoza-Palacio, Rene ;
Stephens, Christopher R. .
NATURAL COMPUTING, 2011, 10 (03) :1195-1214
[2]   ROAD PLANNING WITH SLIME MOULD: IF PHYSARUM BUILT MOTORWAYS IT WOULD ROUTE M6/M74 THROUGH NEWCASTLE [J].
Adamatzky, Andrew ;
Jones, Jeff .
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2010, 20 (10) :3065-3084
[3]   The Impact of Rank Attack on Network Topology of Routing Protocol for Low-Power and Lossy Networks [J].
Anhtuan Le ;
Loo, Jonathan ;
Lasebae, Aboubaker ;
Vinel, Alexey ;
Chen, Yue ;
Chai, Michael .
IEEE SENSORS JOURNAL, 2013, 13 (10) :3685-3692
[4]   Node centrality indices in food webs: Rank orders versus distributions [J].
Bauer, Barbara ;
Jordan, Ferenc ;
Podani, Janos .
ECOLOGICAL COMPLEXITY, 2010, 7 (04) :471-477
[5]   Location Aware and Node Ranking Value-Assisted Embedding Algorithm for One-Stage Embedding in Multiple Distributed Virtual Network Embedding [J].
Cao, Haotong ;
Guo, Yongan ;
Hu, Yue ;
Wu, Shengchen ;
Zhu, Hongbo ;
Yang, Longxiang .
IEEE ACCESS, 2018, 6 :78425-78436
[6]   A Efficient Mapping Algorithm With Novel Node-Ranking Approach for Embedding Virtual Networks [J].
Cao, Haotong ;
Zhu, Yongxu ;
Yang, Longxiang ;
Zheng, Gan .
IEEE ACCESS, 2017, 5 :22054-22066
[7]   Incorporating network structure with node contents for community detection on large networks using deep learning [J].
Cao, Jinxin ;
Jin, Di ;
Yang, Liang ;
Dang, Jianwu .
NEUROCOMPUTING, 2018, 297 :71-81
[8]   An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem [J].
Chen, Bi Yu ;
Lam, William H. K. ;
Sumalee, Agachai ;
Shao, Hu .
MATHEMATICAL AND COMPUTER MODELLING, 2011, 54 (5-6) :1428-1439
[9]   Virtual Network Embedding Through Topology-Aware Node Ranking [J].
Cheng, Xiang ;
Su, Sen ;
Zhang, Zhongbao ;
Wang, Hanchi ;
Yang, Fangchun ;
Luo, Yan ;
Wang, Jie .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (02) :39-47
[10]   Automated Optimization of Intersections Using a Genetic Algorithm [J].
Cruz-Piris, Luis ;
Lopez-Carmona, Miguel A. ;
Marsa-Maestre, Ivan .
IEEE ACCESS, 2019, 7 :15452-15468