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 条
  • [21] Simulated annealing-genetic algorithm for transit network optimization
    Zhao, F
    Zeng, XG
    JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 2006, 20 (01) : 57 - 68
  • [22] Application of neural network based on the genetic simulated annealing algorithm in failure diagnosis
    Hu Yu-lan
    Fu Wen
    Li Xue-mei
    Proceedings of 2006 Chinese Control and Decision Conference, 2006, : 615 - 618
  • [23] Novel Framework Based on Genetic Algorithm and Simulated Annealing Algorithm for Optimization of BP Neural Network Applied to Network IDS
    Chiba, Zouhair
    Abghour, Noreddine
    Moussaid, Khalid
    El Omri, Amina
    Rida, Mohamed
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON SMART CITY APPLICATIONS (SCA'18), 2018,
  • [24] A new optimization algorithm of kinoforms based on simulated annealing
    Nozaki, Shinya
    Chen, Yen-Wei
    Nakao, Zensho
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS: KES 2007 - WIRN 2007, PT II, PROCEEDINGS, 2007, 4693 : 303 - 310
  • [25] Machining sequencing optimization based on Simulated Annealing Algorithm
    Qiao, Lihong
    Hu, Quanwei
    Zhang, Hongwei
    ADVANCED MANUFACTURING TECHNOLOGY, PTS 1-4, 2012, 472-475 : 1632 - +
  • [26] A fast kinoform optimization algorithm based on simulated annealing
    Chen, YW
    Yamauchi, S
    Wang, N
    Nakao, Z
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (04) : 774 - 776
  • [27] Application of Simulated Annealing Algorithm in Core Flow Distribution Optimization
    Wang, Zixuan
    Wang, Yan
    Xu, Haipeng
    Xie, Heng
    ENERGIES, 2022, 15 (21)
  • [28] The application of genetic and simulated annealing algorithm in FBG sensor network
    Wang, YuBao
    Fan, XiaoYu
    Zhang, LinLin
    Lu, GuoWei
    Yao, Yue
    Zhang, ZhiChao
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 12973 - +
  • [29] A simulated annealing algorithm for stiffness optimization
    Vasile, Alexandru
    Coropetchi, Iulian Constantin
    Sorohan, Stefan
    Picu, Catalin Radu
    Constantinescu, Dan Mihai
    4TH INTERNATIONAL CONFERENCE ON STRUCTURAL INTEGRITY (ICSI 2021), 2022, 37 : 857 - 864
  • [30] A simulated annealing algorithm for multiobjective optimization
    Suppapitnarm, A
    Seffen, KA
    Parks, GT
    Clarkson, PJ
    ENGINEERING OPTIMIZATION, 2000, 33 (01) : 59 - 85