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 条
  • [31] Tabu search based circuit optimization
    Sait, SM
    Youssef, H
    Zahra, MM
    PROCEEDINGS OF THE 8TH GREAT LAKES SYMPOSIUM ON VLSI, 1998, : 338 - 343
  • [32] An efficient Tabu Search heuristic for the School Timetabling Problem
    Santos, HG
    Ochi, LS
    Souza, MJF
    EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 468 - 481
  • [33] A novel forward search strategy to automatically harmonize intensification and diversification in tabu search
    Lei, KY
    Wang, F
    Qiu, YH
    Liu, GY
    He, Y
    ISADS 2005: INTERNATIONAL SYMPOSIUM ON AUTONOMOUS DECENTRALIZED SYSTEMS,PROCEEDINGS, 2005, : 513 - 519
  • [34] Qubit Mapping Based on Tabu Search
    Jiang, Hui
    Deng, Yu-Xin
    Xu, Ming
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2024, 39 (02) : 421 - 433
  • [35] A Time-Efficient Method for Metaheuristics: Using Tabu Search and Tabu GA as a Case
    Tsai, Chun-Wei
    Tseng, Shih-Pang
    Chiang, Ming-Chao
    Yang, Chu-Sing
    HIS 2009: 2009 NINTH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS, VOL 2, PROCEEDINGS, 2009, : 24 - +
  • [36] IMPROVED TABU SEARCH BASED ENERGY EFFICIENT ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKs
    Kaur, Jaspreet
    Gangwar, R. C.
    2015 International Conference on Green Computing and Internet of Things (ICGCIoT), 2015, : 637 - 642
  • [37] Dynamic Tabu Search for Non Stationary Social Network Identification Based on Graph Coloring
    Ruiz, Israel Rebollo
    Romay, Manuel Grana
    SOFT COMPUTING MODELS IN INDUSTRIAL AND ENVIRONMENTAL APPLICATIONS, 2013, 188 : 495 - +
  • [38] Tabu annealing: An efficient and scalable strategy for document retrieval
    Thiagarajar College of Engineering, Madurai-15, Tamil Nadu, India
    Int. J. Intell. Inf. Database Syst., 2009, 3 (326-337):
  • [39] Efficiency of Tabu-Search-Based Conformational Search Algorithms
    Grebner, Christoph
    Becker, Johannes
    Stepanenko, Svetlana
    Engels, Bernd
    JOURNAL OF COMPUTATIONAL CHEMISTRY, 2011, 32 (10) : 2245 - 2253
  • [40] An efficient tabu search algorithm for the permutation flow shop problem
    Dong, Xingye
    Huang, Houktian
    Chen, Ping
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 499 - 504