Application research of visualization optimization algorithm of network topology based on simulated annealing algorithm

被引:0
|
作者
Wan, Linyi [1 ]
Liu, Xibin [1 ]
机构
[1] Xiamen Univ Malaysia, Sch Elect & Comp Engn, JalanSunsuria, Sepang 43900, Selangor, Malaysia
关键词
simulated annealing algorithm; complex networks; topological structure; visualization algorithm;
D O I
10.1109/ACCTCS58815.2023.00076
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
People have successfully applied complex network theory to many cross-cutting fields, including social network construction, route planning, and association information mining. For complex networks, the visualization of network topology is one of the main ways to express and convey information. With the help of visualization techniques, users can visually and intuitively perceive the objects and inter-object relationships expressed by the network. However, many complex network visualization algorithms often ignore the user's intuitive cognitive needs for complex networks, making the final generated network visualization results suffer from path intersection and node overlap. This paper proposes a visualization optimization algorithm based on the simulated annealing algorithm oriented to the mainstream force layout algorithm to optimize and design a reasonable optimization function. It adjusts the structures that are unfavorable to visual cognition and improves the cognitive efficiency of users in the visualization of network topology. The author expects that the research in this paper will be helpful for the optimization of network topology visualization algorithms for complex networks and their applications.
引用
收藏
页码:150 / 155
页数:6
相关论文
共 50 条
  • [1] Research on Network Optimization Based on Simulated Annealing Genetic Algorithm
    Chen, Xinyun
    PROCEEDINGS OF THE 2017 5TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTING TECHNOLOGY (ICMMCT 2017), 2017, 126 : 1349 - 1354
  • [2] Heterogeneous Networks Topology Optimization Based on Simulated Annealing Algorithm
    Wu, Chuanlong
    Wang, Menglin
    Ma, Bing
    Chen, Kebin
    PROCEEDINGS OF 2020 IEEE 4TH INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC 2020), 2020, : 2074 - 2078
  • [3] Research on Parallel Topology Analysis Algorithm Based on Simulated Annealing
    Wang Xin-liang
    Chen Jian-Lin
    Ma Tian-Fang
    Liu Zhi-huai
    Liu Na
    Fang Wei
    Liu Xue-bin
    Zhang Li-Wei
    Wu Jun
    PROCEEDINGS OF 2019 IEEE 8TH JOINT INTERNATIONAL INFORMATION TECHNOLOGY AND ARTIFICIAL INTELLIGENCE CONFERENCE (ITAIC 2019), 2019, : 1703 - 1706
  • [4] Genetic Algorithm Optimization Research Based On Simulated Annealing
    Lan, Shunan
    Lin, Weiguo
    2016 17TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2016, : 491 - 494
  • [5] Study on network topology visualization algorithm and implement based on A* algorithm
    Yuan, W
    Pei, CX
    Xiao, HY
    Zhu, CH
    Chen, N
    Yi, YH
    PDCAT 2005: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, Proceedings, 2005, : 154 - 156
  • [6] Network Site Optimization and Clustering Study Based on Simulated Annealing Algorithm
    Yang, Lin-Shen
    Wen, Bin
    Yan, Jie-Jun
    IEEE ACCESS, 2023, 11 : 108167 - 108177
  • [7] Chaotic simulated annealing particle swarm optimization algorithm research and its application
    Yang, Y. (yuyang@cqu.edu.cn), 1722, Zhejiang University (47):
  • [8] Application of Simulated Annealing Algorithm In Sintering Burdening Optimization
    Chang, Jian
    Su, Buxin
    Zhang, Jianliang
    Cao, Weichao
    Guo, Hongwei
    Ren, Shan
    ADVANCES IN METALLURGICAL AND MINING ENGINEERING, 2012, 402 : 116 - 122
  • [10] Solving topology optimization problems using the Modified Simulated Annealing Algorithm
    Millan Paramo, C.
    Begambre Carrillo, O.
    REVISTA INTERNACIONAL DE METODOS NUMERICOS PARA CALCULO Y DISENO EN INGENIERIA, 2016, 32 (02): : 65 - 69