A Node Selecting Approach for Traffic Network Based on Artificial Slime Mold
Open Access
- 6 January 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 8436-8448
Abstract
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.Keywords
Funding Information
- National Natural Science Foundation of China (71471102)
- Hubei Provincial Department of Education (D20101203)
- Yichang University Applied Basic Research Project in China (A17-302-a13)
This publication has 24 references indexed in Scilit:
- Maximizing destructiveness of node capture attack in wireless sensor networksThe Journal of Supercomputing, 2015
- Ranking the spreading ability of nodes in network coreInternational Journal of Modern Physics C, 2015
- SuperedgeRank algorithm and its application in identifying opinion leader of online public opinion supernetworkExpert Systems with Applications, 2014
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problemMathematical and Computer Modelling, 2011
- Approximating Mexican highways with slime mouldNatural Computing, 2011
- Virtual network embedding through topology-aware node rankingACM SIGCOMM Computer Communication Review, 2011
- Node centrality indices in food webs: Rank orders versus distributionsEcological Complexity, 2010
- ROAD PLANNING WITH SLIME MOULD: IF PHYSARUM BUILT MOTORWAYS IT WOULD ROUTE M6/M74 THROUGH NEWCASTLEInternational Journal of Bifurcation and Chaos, 2010
- Rules for Biologically Inspired Adaptive Network DesignScience, 2010
- Basic routines for the Rank-2k update: 2D torus vs reconfigurable networkParallel Computing, 1995