Efficient keystone species identification strategy based on tabu search

被引:1
|
作者
Fan, Chuanjin [1 ]
Zhu, Donghui [1 ]
Zhang, Tongtong [2 ]
Wu, Ruijia [3 ]
机构
[1] Shandong Univ, Sch Math & Stat, Weihai, Shandong, Peoples R China
[2] Shandong Univ, SDU ANU Joint Sci Coll, Weihai, Shandong, Peoples R China
[3] Shandong Univ, Sch Law, Weihai, Shandong, Peoples R China
来源
PLOS ONE | 2023年 / 18卷 / 05期
关键词
FOOD WEBS; SECONDARY EXTINCTIONS; ECOLOGICAL NETWORKS; BIODIVERSITY LOSS; ECOSYSTEM; ROBUSTNESS; COMPLEXITY; CENTRALITY; DYNAMICS;
D O I
10.1371/journal.pone.0285575
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
As species extinction accelerates globally and biodiversity declines dramatically, identifying keystone species becomes an effective way to conserve biodiversity. In traditional approaches, it is considered that the extinction of species with high centrality poses the greatest threat to secondary extinction. However, the indirect effect, which is equally important as the local and direct effects, is not included. Here, we propose an optimized disintegration strategy model for quantitative food webs and introduced tabu search, a metaheuristic optimization algorithm, to identify keystone species. Topological simulations are used to record secondary extinctions during species removal and secondary extinction areas, as well as to evaluate food web robustness. The effectiveness of the proposed strategy is also validated by comparing it with traditional methods. Results of our experiments demonstrate that our strategy can optimize the effect of food web disintegration and identify the species whose extinction is most destructive to the food web through global search. The algorithm provides an innovative and efficient way for further development of keystone species identification in the ecosystem.
引用
收藏
页数:19
相关论文
共 50 条
  • [21] A stochastic Tabu Search strategy and its global convergence
    Tian, P
    Ma, J
    Fan, ZP
    SMC '97 CONFERENCE PROCEEDINGS - 1997 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: CONFERENCE THEME: COMPUTATIONAL CYBERNETICS AND SIMULATION, 1997, : 410 - 414
  • [22] A new edge removal strategy for complex networks based on an improved tabu search algorithm
    Gao, Xiang
    Chen, Michael Z. Q.
    Zhang, Liangyin
    2022 41ST CHINESE CONTROL CONFERENCE (CCC), 2022, : 965 - 970
  • [23] An efficient tabu search algorithm for the linear ordering problem
    Sakabe, Masahiro
    Yagiura, Mutsunori
    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2022, 16 (04):
  • [24] Efficient heuristic and tabu search for hardware/software partitioning
    Jigang Wu
    Pu Wang
    Siew-Kei Lam
    Thambipillai Srikanthan
    The Journal of Supercomputing, 2013, 66 : 118 - 134
  • [25] EPCOT - AN EFFICIENT PROCEDURE FOR COLORING OPTIMALLY WITH TABU SEARCH
    DUBOIS, N
    DEWERRA, D
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1993, 25 (10-11) : 35 - 45
  • [26] Helex: an Evolutionary Tabu Search Strategy for the Identification of Helical Regions in cryo-Electron Microscopy Reconstructions
    Rusu, Mirabela
    Birmanns, Stefan
    BIOPHYSICAL JOURNAL, 2011, 100 (03) : 323 - 323
  • [27] Optimization of Network Disintegration Strategy based on Tabu-Genetic Hybrid Search Algorithm
    Feng, Yuan
    Zeng, Chengyi
    Li, Menglin
    Liu, Hongfu
    2020 CHINESE AUTOMATION CONGRESS (CAC 2020), 2020, : 5108 - 5111
  • [28] Efficient heuristic and tabu search for hardware/software partitioning
    Wu, Jigang
    Wang, Pu
    Lam, Siew-Kei
    Srikanthan, Thambipillai
    JOURNAL OF SUPERCOMPUTING, 2013, 66 (01): : 118 - 134
  • [29] Efficient Tabu Search Algorithm for the Cyclic Inspection Problem
    Bozejko, Wojciech
    Grymin, Radoslaw
    Pempera, Jaroslaw
    Wodecki, Mieczyslaw
    16TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING MODELS IN INDUSTRIAL AND ENVIRONMENTAL APPLICATIONS (SOCO 2021), 2022, 1401 : 751 - 757
  • [30] Tabu search based circuit optimization
    Sait, SM
    Zahra, MM
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2002, 15 (3-4) : 357 - 368