Evolutionary Intelligence

, Volume 4, Issue 1, pp 1–2 | Cite as

Special issue on modern search heuristics and applications


Since its inception in the early 1980s, we have seen a lot of exciting developments in the field of metaheuristics. The complexity of many real-world problems, which are often associated with large search spaces, real-time performance demands and dynamic environments, has made exact solution methods impractical to solve them within a reasonable amount of time. This gives rise to various types of non-exact metaheuristic approaches, including the nature-inspired and non nature-inspired ones (see [1, 2, 3, 4]).

In general, metaheuristics can be viewed as higher level frameworks aimed at efficiently and effectively exploring a search space [5]. Unlike conventional methods, which assume that the objective functions can be solved mathematically, metaheuristics typically do not make much assumption about the problem to be solved or the underlying search space. This makes them applicable to a wide domain of tasks where little information is known about the characteristics of the utility measure. Among the most well-known metaheuristic approaches are those based on the process of natural selection, such as Genetic Algorithms (GA), Genetic Programming (GP), Evolution Strategies (ES), Evolutionary Programming (EP) and Differential Evolution (DE). Other popular metaheuristics include Simulated Annealing that takes inspiration from physics and Swarm Intelligence algorithms such as Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) that imitate the social behavior of ants or birds. Scatter Search and Tabu Search are examples of non nature-inspired metaheuristics. These metaheuristics have been applied to areas as diverse as chemistry, computer graphics and visual arts, computer security, data mining, distributed systems, learning and teaching, economics and finance, engineering, healthcare, telecommunication networks, transportation and logistics, manufacturing, military and defense, production, and other combinatorial optimization problems.

Ever since the publication of the No Free Lunch theorem [6], a theoretical result proving that the performance of every optimization algorithm over all possible (finite) problems is the same, researchers and practitioners alike have radically changed their view about designing and developing modern search heuristics. Instead of trying to propose universally applicable algorithms, they now start to propose approaches that are tailored to specific problems.

Following the trend, this special issue brings together four papers in which the use of metaheuristics in specific application domains is discussed. Three of the papers included were among the invited submissions from the Special Session on Evolutionary Computing that was held at the 9th IEEE International Conference on Cognitive Informatics (ICCI 2010), Tsinghua University, Beijing, China [7]. Each of these papers was substantially revised and extended based on the original conference version. All accepted papers were rigorously reviewed in two rounds by two to three anonymous reviewers. These excellent contributions clearly showcase the state-of-the-art on ‘co-design’ of problem solutions and algorithms or data structures.

In the paper by Wang et al., Novel Evolutionary Algorithms for Supervised Classification Problems: An Experimental Study, GA and GP have been used to synthesize classifiers. Here, the goal is to solve unbalanced data mining as well as financial prediction tasks. The authors introduce a novel classifier structure which is especially suitable for these purposes together with a new fitness measure, also developed with this goal in mind. They compare their algorithms with other evolutionary classification methods as well as some traditional classifiers. The superiority of the targeted optimization/application co-design is clearly shown.

Next in the line, Iacca et al. in their paper Composed compact Differential Evolution introduces a new distributed compact DE algorithm. Here, the application domain is not a specific class of optimization problems to be solved but rather the conditions under which this solution should take place: the proposed algorithm has a small memory footprint, which allows it to be integrated into devices with little computational power such as robotics controllers. In such an environment, the algorithm can be used to solve numerical problems with efficiency close to those offered by other population-based metaheuristics.

The penultimate paper, A Hybrid Harmony Search Algorithm for MRI Brain Segmentation, by Alia et al. presents the use of Harmony Search (HS) for medical image segmentation. A combination of HS with fuzzy clustering (with variable numbers of clusters) is applied to identify tissues of different types in MRI brain scans. Detailed experiments based on both real and simulated MRI data have been carried out by the authors. This new approach not only demonstrates how closely optimization and application can be interwoven, but it also provides results that are superior compared to the related work.

Finally, Rubio et al.’s paper Studying the Application of Ant Colony Optimization and River Formation Dynamics to the Steiner Tree Problem compares an emerging metaheuristic invented by the authors, called River Formation Dynamics (RFD), to ACO in solving the Steiner Tree Problem. The experimental results clearly show that the node-potential idea of RFD outperforms the edge-potential concept of ACO in this application domain.

To end, we would like to thank the authors for their high quality contributions to this special issue. We also wish to acknowledge all the reviewers for their expertise and time, in particular those who have provided constructive comments and suggestions. A further special note of thanks goes to the Editor-in-Chief, Larry Bull, for handling the review process of Wang et al.’s paper, and Srilakshmi Patrudu for her editorial assistance and professional support.


  1. 1.
    Weise T (2009) Global optimization algorithms—theory and application. it-weise.de (self-published): GermanyGoogle Scholar
  2. 2.
    Chiong R (ed) (2009) Nature-inspired algorithms for optimisation, volume 193 of studies in computational intelligence. Springer, BerlinGoogle Scholar
  3. 3.
    Chiong R, Dhakal S (eds) (2009) Natural intelligence for scheduling, planning and packing problems, volume 250 of studies in computational intelligence. Springer, BerlinGoogle Scholar
  4. 4.
    Chiong R (ed) (2009) Nature-inspired informatics for intelligent applications and knowledge discovery: implications in business, science and engineering. Information Science Reference, HersheyGoogle Scholar
  5. 5.
    Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surveys (C SUR) 35(3):268–308CrossRefGoogle Scholar
  6. 6.
    Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput (IEEE-TEC) 1(1):67–82CrossRefGoogle Scholar
  7. 7.
    Sun F, Wang Y, Lu J, Zhang B, Kinsner W, Zadeh LA (eds) (2010). In: Proceedings of the 9th IEEE international conference on cognitive informatics (ICCI’10), Tsinghua University: Běijīng, China. IEEE Computer Society Press, Los AlamitosGoogle Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.Faculty of Information & Communication TechnologiesSwinburne University of TechnologyMelbourneAustralia
  2. 2.Nature Inspired Computation & Applications LaboratoryUniversity of Science and Technology of ChinaHefeiChina

Personalised recommendations