
as text | as pdf | as ps |
Started as a mere academic curiosity, Evolutionary Algorithms (EAs) first came into sight back in the 1960s. However, it was not until the 1980s that the research on EAs became less theoretical and more practical. As a manifestation of population-based, stochastic search algorithms that mimic natural evolution, EAs use genetic operators such as crossover and mutation for the search process to generate new solutions through a repeated application of variation and selection.
Due to their ability to find satisfactory solutions for conventionally hard and dynamic problems within acceptable time, EAs have attracted interests from many researchers and practitioners in recent years. The general-purpose, black-box character of EAs makes them suitable for a wide range of real-world applications. Standard EAs such as Genetic Algorithms, Evolutionary Programming, Evolution Strategies and Genetic Programming are becoming more and more accepted in the industry and commercial sectors. With the dramatic increase in computational power today, an incredible diversification of new application areas of these techniques can be observed. At the same time, new variants and classes of evolutionary optimisation methods such as Differential Evolution, Estimation of Distribution Algorithms, Cultural Algorithms, Grammatical Evolution, Gene Expression Programming, Cooperative and Competitive Co-evolutionary Algorithms, Multi-objective Evolutionary Algorithms, to name just a few, emerged.
When systems utilising EAs reach production stage, off-the-shelf versions of these methods are regularly replaced by dedicated algorithm variants. These specialised EAs often use tailored reproduction operators, search spaces differing significantly from the well-known binary or tree-based encodings, non-trivial genotype- phenotype mappings, or are hybridised with other optimisation algorithms. This book aims to promote the practitioner's view on EAs by giving a comprehensive discussion of how EAs can be adapted to the requirements of various applications in the real-world domains. It will pool knowledge and experience on how EAs can be exploited to solve a wide range of problems in diverse fields such as scheduling, manufacturing, logistics, space allocation, stock cutting, anomaly detection, engineering design, software testing, bioinformatics and data mining, among others. The main focus will be on applications which are actually delivered and integrated in some industrial or real-world settings.
Researchers and practitioners are invited to submit on or before December 15, 2009 a 2-3 pages proposal to tweise@gmx.de (cc. rchiong@swin.edu.au) clearly explaining the mission and concerns of the proposed chapter. Authors of accepted proposals will be notified between 2 to 3 weeks time about the status of their proposals. Full chapters are expected to be submitted by February 15, 2010. All submitted chapters will be reviewed by at least three reviewers and the final decision of acceptance or rejection will be based on their recommendations.
The full chapters must be prepared according to Springer's style guide for contributed books and conform to additional instructions provided at http://www.it-weise.de/book/style.zip. Manuscript preparation in LaTeX is strongly recommended. Works based on previously published materials must be substantially extended.
| Deadline for chapter proposals: | 15 December 2009 |
| Deadline for full chapters: | 15 February 2010 |
| Notification of review results: | 15 May 2010 |
| Deadline for submission of revised chapters: | 15 July 2010 |
| Notification of the final decision: | 15 September 2010 |
| Deadline for submission of final chapters: | 15 October 2010 |
| Publication of book: | First half of 2011 |
All inquiries can be forwarded to Dr.-Ing. Thomas Weise via e-mail at tweise@gmx.de.
as text | as pdf | as ps |
We have compiled a style guide containing recommendations and tips for authors who wish to submit chapters for consideration in our book. This style guide is written using LaTeX in exactly the style prescribed for the chapters. We provide this guide along with all its LaTeX source files in the archive style.zip. The style guide can therefore serve as an example for using the Springer styles.
We strongly recommend that all authors read the first three sections of the style guide before preparing their submissions.
![]() | R. Chiong (Ed.), Nature-Inspired Algorithms for Optimisation, Berlin: Springer-Verlag, 2009. ISBN 978-3-642-00266-3. [Online: http://www.springer.com/engineering/book/978-3-642-00266-3] | |
![]() | R. Chiong (Ed.), Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery: Implications in Business, Science and Engineering, Hershey, PA: Information Science Reference, 2009. ISBN 978-1-60566-705-8. [Online: http://www.igi-global.com/reference/details.asp?ID=34443] | |
![]() | P.F. Hingston, L.C. Barone and Z. Michalewicz (Eds.), Design by Evolution, Berlin: Springer-Verlag, 2008. ISBN 978-3-540-74109-1. [Online: http://www.springer.com/computer/artificial/book/978-3-540-74109-1] | |
![]() | P. Siarry and Z. Michalewicz (Eds.), Advances in Metaheuristics for Hard Optimization, Berlin: Springer-Verlag, 2008. ISBN 978-3-540-72959-4. [Online: http://www.springer.com/computer/artificial/book/978-3-540-72959-4] |