Swarm intelligence algorithm is to simulate the behaviour of groups of organisms to solve the target problem heuristic search algorithm. This paper briefly describes four swarm intelligence algorithms, focus on analysis of the ant colony algorithm and artificial fish algorithm and how to merge the two algorithms. Based on ACO and AFSA, a new fusion algorithm is proposed. The fusion algorithm has the robustness and parallelism of the ant colony algorithm, and has the advantages of strong global search ability and fast search speed of artificial fish swarm algorithm. The convergence of the improved fusion algorithm is proved by analysis, and the algorithm is applied to the field of protein folding prediction. It can be found that the new fuse algorithm, which in the case of find out the minimum energy value, the time required for the algorithm is less than that of the basic algorithm. It not only ensures the quality of the optimal value, but also greatly saves the calculation time. It has great practical value.
Swarm intelligence algorithm ACO AFSA Protein folding
This is a preview of subscription content, log in to check access.
This work was supported by the Natural Science Foundation of Guangxi Province, China (Grant No. 2016GXNSFAA380211) and Doctoral Foundation of Guangxi University of Science and Technology (Grant No. XKB17Z08).
Rubio-Largo, A., Vega-Rodriguez, M.A., Gomez-Pulido, J.A., et al.: A comparative study on multiobjective swarm intelligence for the routing and wavelength assignment problem. IEEE Transac. Syst. Man Cybern. Part C 42(6), 1644–1655 (2012)CrossRefGoogle Scholar
Du, X., Cheng, L., Liu, L.: A swarm intelligence algorithm for joint sparse recovery. IEEE Signal Process. Lett. 20(6), 611–614 (2013)CrossRefGoogle Scholar
Afshar, M.H.: A parameter free continuous ant colony optimization algorithm for the optimal design of storm sewer networks: constrained and unconstrained approach. Adv. Eng. Softw. 41(2), 188–195 (2010)CrossRefGoogle Scholar
Zhao, H., Li, M., Weng, X.: Distributed artificial bee colony cotton algorithm for solving function optimization problems. Control and Decision 30(7), 1181–1188 (2015)zbMATHGoogle Scholar
Tzul, F.O., Vasilchuk, D., Makhatadze, G.I.: Evidence for the principle of minimal frustration in the evolution of protein folding landscapes. Proc. Natl. Acad. Sci. 114(9), E1627–E1632 (2017)CrossRefGoogle Scholar
Prigozhin, M.B., Chao, S.H., Sukenik, S., et al.: Mapping fast protein folding with multiple-site fluorescent probes. Proc. Natl. Acad. Sci. USA 112(26), 7966–7971 (2015)CrossRefGoogle Scholar
Peter, E.K., Shea, J.E., Pivkin, I.V.: Coarse kMC-based replica exchange algorithms for the accelerated simulation of protein folding in explicit solvent. Phys. Chem. Chem. Phys. 18(18), 13052–13065 (2016)CrossRefGoogle Scholar
Lee, M., Yoon, J., Jang, S., et al.: Conformational sampling of metastable states: tq-REM as a novel replica exchange method. Phys. Chem. Chem. Phys. 19(7), 5454 (2017)CrossRefGoogle Scholar
Han, M., Xu, J., Ren, Y., et al.: Simulation of coupled folding and binding of an intrinsically disordered protein in explicit solvent with metadynamics. J. Mol. Graph. Model. 68, 114–127 (2016)CrossRefGoogle Scholar
Llanes, A., Munoz, A., Bueno-crespo, A., et al.: Soft computing techniques for the protein folding problem on high performance computing architectures. Curr. Drug Targets 17(14), 1626–1648 (2016)CrossRefGoogle Scholar
Alekseenko, A., Kononova, O., Kholodov, Y., et al.: SOP-GPU: influence of solvent-induced hydrodynamic interactions on dynamic structural transitions in protein assemblies. J. Comput. Chem. 37(17), 1537–1551 (2016)CrossRefGoogle Scholar
Li, C., Lü, D., Zhang, L., et al.: Approach to the unfolding and folding dynamics of add A-riboswitch upon adenine dissociation using a coarse-grained elastic network model. J. Chem. Phys. 145(1), 11 (2016)CrossRefGoogle Scholar