- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
The Scientific World Journal
Volume 2014 (2014), Article ID 934890, 3 pages
Recent Advances on Bioinspired Computation
1Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technology, Taiyuan, Shanxi 030024, China
2State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China
3West Texas A&M University, Canyon, TX 79016, USA
4Western Norway Research Institute, 6851 Sogndal, Norway
5School of Science and Technology, Middlesex University, London NW4 4BT, UK
Received 24 February 2014; Accepted 24 February 2014; Published 6 May 2014
Copyright © 2014 Zhihua Cui et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Bioinspired computation (BIC) has become an emerging and popular part of modern computer science, artificial intelligence, computational intelligence, and evolutionary intelligence. BIC is usually based on biological systems that can be often self-organizing, adaptive, and tolerant of random defects. Most BIC algorithms are mostly swarm intelligence (SI) based, and they mimic the successful characteristics of biological and swarm systems. However, bioinspired computation can be very broad, including swarm intelligence [1–7], membrane  and memetic computing, DNA and molecular computing, neural computing, and others. Their applications are also very diverse, including computational intelligence, computational neuroscience, bioinformatics, natural language processing, machine learning, software engineering, scheduling and timetabling, data mining, algorithm theory, and many other areas [9–11].
Recent advances in this area are relatively extensive, and a special issue can serve as a good summary to provide a snapshot of the recent advances. The responses to our call for papers are overwhelming, and we received nearly two hundred submissions, and after rigorous peer review, only a small fraction of the submissions were accepted for this special issue. This special issue starts with the heterogeneous differential evolution by J. Wang et al., followed by the correction of faulty sensors in phased array radars by J. U. Khan et al. A new variant of harmony search has been proposed to solve binary knapsack problems; then a theoretical model for location of terror response facilities was studied by L. P. Meng et al. In addition, a novel variant of bat algorithm based on naïve Bayes methods has been presented to carry out feature selection, followed by a hybrid model based on genetic algorithms and support vector machine for fruit juice classifications by C. Fernandez-Lozano et al., while a modified dynamic neural-fuzzy approach to model customer satisfaction was carried out by C. K. Kwong et al.
On the other hand, an improved firefly algorithm for nonlinear and convex optimization with applications to CAD/CAM has been proposed by A. Gálvez and A. Iglesias, and an effective hybrid by combining the firefly algorithm and harmony search was found to be efficient for global numerical optimization by L. H. Guo et al. Furthermore, noise-assisted multipath traffic distribution networks were studied by N. Asvarujanon et al. Other studies have focussed on the various improvements and diverse applications with detailed case studies. Interested readers are encouraged to read more about this special issue and the open access mode means that you can download papers and study them in great detail when appropriate.Analyzing the current developments, we can expect to look forward to the future. From the bioinspired computation point of view, we think the following eight areas need more research.(i)Complex, real-world applications: more applications should focus on complex, real-world applications in various engineering and industrial designs. Such applications can be highly nonlinear and multimodal, under stringent constraints.(ii)Computationally expensive methods: most applications nowadays are computationally expensive because the evaluations of designs, objectives, and computational tasks are becoming computationally extensive. Many design options have to be evaluated by finite element methods, large-scale finite volume methods, and boundary and extended element methods. For example, applications in aerospace and electromagnetic engineering can take hours up to weeks to evaluate computationally. Therefore, further developments in this area to speed up the computational methods are very important for practical applications.(iii)Data-intensive applications: as the data volumes are expanding dramatically, due to drive in information technology and social media, data-intensive applications become more important. Data mining techniques become more relevant, and bioinspired methods such as PSO, cuckoo search, and firefly algorithm become increasingly popular in such applications [1, 9, 12].(iv)Network and systems: current research activities have also focused on the modeling and simulation of complex networks and systems such as computer networks, electricity grids, energy networks, and biological systems. Other networks such as social networks have also received some attention. It can be expected that more research will be done in this area.(v)Biological applications: bioinspired computation has been applied to biological applications such as protein folding and biological systems . Bioinspired computation has also found applications in bioinformatics and genetic engineering.(vi)Combinatorial problems: most combinatorial optimization problems such as the traveling salesman problem are NP-hard and thus are very challenging to solve. Bioinspired algorithms such as ant colony optimization and cuckoo search can be very powerful alternatives for dealing with such challenging problems.(vii)Large-scale problems: the current applications tend to have problem sizes with a few, up to a few dozen, design variables, while real-world applications tend to have thousands of design variables. Therefore, more applications are becoming increasingly large-scale, and it is not yet clear if the methods that work for small-scale problems can still work for large-scale problems. For example, protein folding problems can be very large-scale, and at the moment, nature-inspired methods such as simulated annealing and firefly algorithm have been found to be useful and efficient.(viii)Data mining and image processing: data mining tends to have data-intensive computation, while image processing can also be very computational extensive as well. Important applications such as feature selection and classifications need efficient methods to solve, especially those large-scale problems.
As we have seen, bioinspired computation is a very active area, and many challenges still remain. It can be expected that more exciting research activities will be seen in the near future.
We, the editors, would like to thank all those who took part in this special issue, including the contributing authors and reviewers. This paper is supported by the National Natural Science Foundation of China under Grant no. 61003053 and the Program for the Top Young Academic Leaders of Higher Learning Institutions of Shanxi.
- X. S. Yang, Z. H. Cui, R. B. Xiao, A. H. Gandomi, and M. Karamanoglu, Swarm Intelligence and Bio-Inspired Computation: Theory and Applications, Elsevier, Waltham, Mass, USA, 2013.
- I. Fister, I. Fister Jr., X. S. Yang, and J. Brest, “A comprehensive review of firefly algorithms,” Swarm and Evolutionary Computation, vol. 13, no. 1, pp. 34–46, 2013.
- X. S. Yang and S. Deb, “Cuckoo search: recent advances and applications,” Neural Computing and Applications, vol. 24, no. 1, pp. 169–174, 2014.
- A. Adamatzky, “Slime mould computes planar shapes,” International Journal of Bio-Inspired Computation, vol. 4, no. 3, pp. 149–154, 2012.
- P. R. Srivastava, A. Varshney, P. Nama, and X. S. Yang, “Software test effort estimation: a model based on cuckoo search,” International Journal of Bio-Inspired Computation, vol. 4, no. 5, pp. 278–285, 2012.
- E. García-Gonzalo and J. L. Fernández-Martínez, “A brief historical review of particle swarm optimization (PSO),” Journal of Bioinformatics and Intelligent Control, vol. 1, no. 1, pp. 3–16, 2012.
- Y. Zhang, “Application swarming intelligence in Bioinformatics: survey,” Journal of Bioinformatics and Intelligent Control, vol. 1, no. 1, pp. 27–39, 2012.
- K. Q. Jiang, B. S. Song, X. L. Shi, and T. Song, “An overview of membrane computing,” Journal of Bioinformatics and Intelligent Control, vol. 1, no. 1, pp. 17–26, 2012.
- X. S. Yang and S. Deb, “Two-stage eagle strategy with differential evolution,” International Journal of Bio-Inspired Computation, vol. 4, no. 1, pp. 1–5, 2012.
- Z. H. Cui, S. J. Fan, J. C. Zeng, and Z. Z. Shi, “Artificial plan optimisation algorithm with three-period photosynthesis,” International Journal of Bio-Inspired Computation, vol. 5, no. 2, pp. 133–139, 2013.
- X. S. Yang, M. Karamanoglu, and X. S. He, “Multi-objective flower algorithm for optimization,” Procedia Computer Science, vol. 18, no. 1, pp. 861–868, 2013.
- B. Maher, A. A. Albrecht, M. Loomes, X. S. Yang, and K. Steinhofel, “A firefly-inspired method for protein structure prediction in lattice models,” Biomolecules, vol. 4, no. 1, pp. 56–75, 2014.