|
Call for Book Chapters Chapter proposal submission deadline: May 30, 2008 Full chapter deadline: June 30, 2008 There is no apriori limit on the number of pages, in principle, 30 pages is a reasonable limit. |
|||||||||||
|
Global Optimization: Theoretical Foundations and Applications
Volume (s) Editors: Ajith Abraham, Aboul-Ella Hassanien, and Patrick Siarry To be published in "Studies in Computational Intelligence" published by Springer Verlag, Germany Book Objectives & Mission: The field of optimization is interdisciplinary in nature, and has made a significant impact on many areas of technology. As a result, optimization is an indispensable tool for many practitioners in various fields. Conventional optimization techniques are well established and widely published in many excellent textbooks. However, there are new techniques, such as simulated annealing, mean field theory, and genetic algorithms, which have proven to be effective in solving global optimization problems. Many real-life problems require the solution of optimization problems. If the objective function is not known analytically, traditional methods are not applicable and multi-extremum (global) optimization (GO) methods must be used. Computational Intelligence for Optimization is intended as a technical description of the state-of-the-art developments in advanced optimization techniques, specifically simulated annealing, mean field theory, and genetic algorithms, with emphasis on mathematical theory, implementation, and practical applications. Most of the theories covered in this field and their applications are widely scattered in journals, technical reports, and conference proceedings of various fields, making it difficult for people new in the field to find easily. The authors have brought together a comprehensive and organized treatment of these techniques, thus filling a gap in the scientific literature. Therefore, we encourage authors to present original chapter dealing with the incorporation of such CI techniques into Global optimization algorithms and processes.
Topics
Topics include, but are not limited to:
Submission Guidelines and important dates Researchers and practitioners are kindly invited to send on or before May 30 2008 a short email to
containing a preliminary title and a short abstract of their chapter. This will facilitate the planning of the review process. All chapter proposals will be peer reviewed. Full chapters will be expected by June 30 2008. All submitted chapters will be reviewed by at least three reviewers on a double-blind review basis.
Original artwork and a signed copyright release forms will be required for all accepted chapters.
Volume Editors
About the series "Studies in Computational Intelligence"
The series "Studies in Computational Intelligence" (SCI) publishes new developments and advances in the various areas of computational intelligence – quickly and with a high quality. The intent is to cover the theory, applications, and design methods of computational intelligence, as embedded in the fields of engineering, computer science, physics and life science, as well as the methodologies behind them. The series contains monographs, lecture notes and edited volumes in computational intelligence spanning the areas of neural networks, connectionist systems, genetic algorithms, evolutionary computation, artificial intelligence, cellular automata, self-organizing systems, soft computing, fuzzy systems, and hybrid intelligent systems. Critical to both contributors and readers are the short publication time and world-wide distribution - this permits a rapid and broad dissemination of research results. Instructions for Authors (Preparation of Manuscripts)Careful preparation of the manuscripts will help keep production time short and ensure satisfactory appearance of the finished book. Please prepare the manuscript using the author guidelines and format given in the following link: Author Guidelines General guidelines:
Contact information
http://lissi.univ-paris12.fr/~siarry/ & Aboul-Ella Hassanien (Abo )
Kuwait University
|
