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
来源
2023 3RD ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS TECHNOLOGY AND COMPUTER SCIENCE, ACCTCS | 2023年
关键词
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 条
  • [21] Optimization model of heliostatic field based on simulated annealing algorithm
    Zhao, Xuezhuan
    Wang, Yuyan
    Wang, Xinyi
    Cao, Keai
    2024 5TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATION, ICCEA 2024, 2024, : 221 - 227
  • [22] Study on the layout optimization of platform based on simulated annealing algorithm
    Zheng, Dequan
    Zheng, D. (zhengdequan@hit.edu.cn), 1793, Academy Publisher (08): : 1793 - 1800
  • [23] Mixed optimization of power transmission structures: An application of the simulated annealing algorithm
    Martinez, S.
    Paris, J.
    Colominas, I.
    Navarrina, F.
    Casteleiro, M.
    REVISTA INTERNACIONAL DE METODOS NUMERICOS PARA CALCULO Y DISENO EN INGENIERIA, 2014, 30 (02): : 121 - 135
  • [24] Research on Location Selection Based on Genetic and Simulated Annealing Algorithm
    Tao, Wenyuan
    Liu, Jiayue
    CONTEMPORARY RESEARCH ON E-BUSINESS TECHNOLOGY AND STRATEGY, 2012, 332 : 271 - +
  • [25] Research on emergency vehicles routing based on simulated annealing algorithm
    Wang, Q. (wangqr003@163.com), 1600, Binary Information Press, Flat F 8th Floor, Block 3, Tanner Garden, 18 Tanner Road, Hong Kong (10): : 5055 - 5061
  • [26] Research on TSP Solution Based on Improved Simulated Annealing Algorithm
    Qi, Anzhi
    PROCEEDINGS OF THE 2017 4TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTER (MACMC 2017), 2017, 150 : 121 - 124
  • [27] Application Research of Improved Simulated Annealing Algorithm in Vehicle Routing Problems
    Yan, Dongmei
    Lu, Chenghua
    INFORMATION TECHNOLOGY FOR MANUFACTURING SYSTEMS II, PTS 1-3, 2011, 58-60 : 1031 - 1036
  • [28] The Optimization of the Search Scheme by the Simulated Annealing Algorithm
    Niu, Guangshuo
    PROCEEDINGS OF THE 2016 6TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS, ENVIRONMENT, BIOTECHNOLOGY AND COMPUTER (MMEBC), 2016, 88 : 1378 - 1381
  • [29] An Improved Simulated Annealing Algorithm based on Genetic Algorithm
    Li, Shufei
    MECHATRONICS AND INTELLIGENT MATERIALS II, PTS 1-6, 2012, 490-495 : 267 - 271
  • [30] Research on location selection based on genetic and simulated annealing algorithm
    Tao, Wenyuan
    Liu, Jiayue
    1600, Springer Verlag (332): : 271 - 281