Multi objective optimization in computational intelligence theory and practice 1st Edition Lam Thu Bui - The ebook is ready for download, no waiting required
Multi objective optimization in computational intelligence theory and practice 1st Edition Lam Thu Bui - The ebook is ready for download, no waiting required
https://ebookfinal.com/download/data-mining-and-computational-
intelligence-1st-edition-a-klose/
https://ebookfinal.com/download/the-tao-of-spycraft-intelligence-
theory-and-practice-in-traditional-china-1st-edition-ralph-d-sawyer/
Business Applications And Computational Intelligence Kevin
E. Voges
https://ebookfinal.com/download/business-applications-and-
computational-intelligence-kevin-e-voges/
https://ebookfinal.com/download/computational-gas-solids-flows-and-
reacting-systems-theory-methods-and-practice-1st-edition-sreekanth-
pannala/
https://ebookfinal.com/download/computational-intelligence-the-
experts-speak-1st-edition-david-b-fogel/
Multi objective optimization in computational intelligence
theory and practice 1st Edition Lam Thu Bui Digital
Instant Download
Author(s): Lam Thu Bui, Sameer Alam
ISBN(s): 9781599045009, 1599045001
Edition: 1
File Details: PDF, 8.81 MB
Year: 2008
Language: english
Multi-Objective
Optimization in
Computational Intelligence:
Theory and Practice
Sameer Alam
University of New South Wales, Australia
Copyright © 2008 by IGI Global. All rights reserved. No part of this publication may be reproduced, stored or distributed in any form or by
any means, electronic or mechanical, including photocopying, without written permission from the publisher.
Product or company names used in this set are for identification purposes only. Inclusion of the names of the products or companies does
not indicate a claim of ownership by IGI Global of the trademark or registered trademark.
Multi-objective optimization in computational intelligence : theory and practice / Lam Thu Bui and Ricardo Sameer Alam, editors.
p. cm.
Summary: “This book explores the theoretical, as well as empirical, performance of MOs on a wide range of optimization issues
including combinatorial, real-valued, dynamic, and noisy problems. It provides scholars, academics, and practitioners with a fundamental,
comprehensive collection of research on multi-objective optimization techniques, applications, and practices”--Provided by publisher.
1. Computational intelligence. 2. Evolutionary computation. 3. Mathematical optimization. 4. Artificial intelligence. I. Bui, Lam Thu. II.
Alam, Ricardo Sameer.
Q342.M85 2008
519.6--dc22
2007040640
All work contributed to this book set is original material. The views expressed in this book are those of the authors, but not necessarily of
the publisher.
If a library purchased a print copy of this publication, please go to http://www.igi-global.com/agreement for information on activating
the library's complimentary electronic access to this publication.
Reviewer List
Section I
Fundamentals
Chapter I
An Introduction to Multi-Objective Optimization ................................................................................. 1
Lam Thu Bui, University of New South Wales, Australia
Sameer Alam, University of New South Wales, Australia
Chapter II
Multi-Objective Particles Swarm Optimization Approaches ................................................................ 20
Konstantinos E. Parsopoulos, University of Patras, Greece
Michael N. Vrahatis, University of Patras, Greece
Chapter III
Generalized Differential Evolution for Constrained Multi-Objective Optimization ........................... 43
Saku Kukkonen, Lappeenranta University of Technology, Finland
Jouni Lampinen, University of Vaasa, Finland
Chapter IV
Towards a More Efficient Multi-Objective Particle Swarm Optimizer ................................................ 76
Luis V. Santana-Quintero, CINVESTAV-IPN, Evolutionary Computation Group
(EVOCINV), Mexico
Noel Ramírez-Santiago, CINVESTAV-IPN, Evolutionary Computation Group
(EVOCINV), Mexico
Carlos A. Coello Coello, CINVESTAV-IPN, Evolutionary Computation Group
(EVOCINV), Mexico
Chapter V
Multi-Objective Optimization Using Artificial Immune Systems ..................................................... 106
Licheng Jiao, Xidian University, P.R. China
Maoguo Gong, Xidian University, P.R. China
Wenping Ma, Xidian University, P.R. China
Ronghua Shang, Xidian University, P.R. China
Chapter VI
Lexicographic Goal Programming and Assessment Tools for a
Combinatorial Production Problem ................................................................................................... 148
Seamus M. McGovern, U.S. DOT National Transportation Systems Center, USA
Surendra M. Gupta, Northeastern University, USA
Chapter VII
Evolutionary Population Dynamics and Multi-Objective Optimisation Problems ............................ 185
Andrew Lewis, Griffith University, Australia
Sanaz Mostaghim, University of Karlsruhe, Germany
Marcus Randall, Bond University, Australia
Section II
Applications
Chapter VIII
Multi-Objective Evolutionary Algorithms for Sensor Network Design ............................................ 208
Ramesh Rajagopalan, Syracuse University, USA
Chilukuri K. Mohan, Syracuse University, USA
Kishan G. Mehrotra, Syracuse University, USA
Pramod K. Varshney, Syracuse University, USA
Chapter IX
Evolutionary Multi-Objective Optimization for DNA Sequence Design .......................................... 239
Soo-Yong Shin, Seoul National University, Korea
In-Hee Lee, Seoul National University, Korea
Byoung-Tak Zhang, Seoul National University, Korea
Chapter X
Computational Intelligence to Speed-Up Multi-Objective Design Space
Exploration of Embedded Systems ..................................................................................................... 265
Giuseppe Ascia, Università degli Studi di Catania, Italy
Vincenzo Catania, Università degli Studi di Catania, Italy
Alessandro G. Di Nuovo, Università degli Studi di Catania, Italy
Maurizio Palesi, Università degli Studi di Catania, Italy
Davide Patti, Università degli Studi di Catania, Italy
Chapter XI
Walking with EMO: Multi-Objective Robotics for Evolving Two, Four,
and Six-Legged Locomotion............................................................................................................... 300
Jason Teo, Universiti Malaysia Sabah, Malaysia
Lynnie D. Neri, Universiti Malaysia Sabah, Malaysia
Minh H. Nguyen, University of New South Wales, Australia
Hussein A. Abbass, University of New South Wales, Australia
Chapter XII
Evolutionary Multi-Objective Optimization in Energy Conversion Systems:
From Component Detail to System Configuration ............................................................................. 333
Andrea Toffolo, University of Padova, Italy
Chapter XIII
Evolutionary Multi-Objective Optimization for Assignment Problems ............................................ 364
Mark P. Kleeman, Air Force Institute of Technology, USA
Gary B. Lamont, Air Force Institute of Technology, USA
Chapter XIV
Evolutionary Multi-Objective Optimization in Military Applications .............................................. 388
Mark P. Kleeman, Air Force Institute of Technology, USA
Gary B. Lamont, Air Force Institute of Technology, USA
Section I
Fundamentals
Chapter I
An Introduction to Multi-Objective Optimization ................................................................................. 1
Lam Thu Bui, University of New South Wales, Australia
Sameer Alam, University of New South Wales, Australia
This chapter is devoted to summarize all common concepts related to multiobjective optimization (MO).
An overview of “traditional” as well as CI-based MO is given. Further, all aspects of performance as-
sessment for MO techniques are discussed. Finally, challenges facing MO techniques are addressed.
All of these description and analysis give the readers basic knowledge for understandings the rest of
the book.
Chapter II
Multi-Objective Particles Swarm Optimization Approaches ................................................................ 20
Konstantinos E. Parsopoulos, University of Patras, Greece
Michael N. Vrahatis, University of Patras, Greece
The multiple criteria nature of most real world problems has boosted research on multiobjective algorithms
that can tackle such problems effectively, with the smallest possible computational burden. Particle Swarm
Optimization has attracted the interest of researchers due to its simplicity, effectiveness and efficiency
in solving numerous single-objective optimization problems. Up-to-date, there are a significant number
of multiobjective Particle Swarm Optimization approaches and applications reported in the literature.
This chapter aims at providing a review and discussion of the most established results on this field, as
well as exposing the most active research topics that can give initiative for future research.
Chapter III
Generalized Differential Evolution for Constrained Multi-Objective Optimization ........................... 43
Saku Kukkonen, Lappeenranta University of Technology, Finland
Jouni Lampinen, University of Vaasa, Finland
Multiobjective optimization with Evolutionary Algorithms has been gaining popularity recently because
its applicability in practical problems. Many practical problems contain also constraints, which must be
taken care of during optimization process. This chapter is about Generalized Differential Evolution, which
is a general-purpose optimizer. It is based on a relatively recent Evolutionary Algorithm, Differential
Evolution, which has been gaining popularity because of its simplicity and good observed performance.
Generalized Differential Evolution extends Differential Evolution for problems with several objectives
and constraints. The chapter concentrates on describing different development phases and performance
of Generalized Differential Evolution but it also contains a brief review of other multiobjective DE
approaches. Ability to solve multiobjective problems is mainly discussed, but constraint handling and
the effect of control parameters are also covered. It is found that GDE versions, in particular the latest
version, are effective and efficient for solving constrained multiobjective problems.
Chapter IV
Towards a More Efficient Multi-Objective Particle Swarm Optimizer ................................................ 76
Luis V. Santana-Quintero, CINVESTAV-IPN, Evolutionary Computation Group
(EVOCINV), Mexico
Noel Ramírez-Santiago, CINVESTAV-IPN, Evolutionary Computation Group
(EVOCINV), Mexico
Carlos A. Coello Coello, CINVESTAV-IPN, Evolutionary Computation Group
(EVOCINV), Mexico
This chapter presents a hybrid between a particle swarm optimization (PSO) approach and scatter search.
The main motivation for developing this approach is to combine the high convergence rate of the PSO
algorithm with a local search approach based on scatter search, in order to have the main advantages of
these two types of techniques. We propose a new leader selection scheme for PSO, which aims to accel-
erate convergence by increasing the selection pressure. However, this higher selection pressure reduces
diversity. To alleviate that, scatter search is adopted after applying PSO, in order to spread the solutions
previously obtained, so that a better distribution along the Pareto front is achieved. The proposed ap-
proach can produce reasonably good approximations of multiobjective problems of high dimensionality,
performing only 4,000 fitness function evaluations. Test problems taken from the specialized literature
are adopted to validate the proposed hybrid approach. Results are compared with respect to the NSGA-
II, which is an approach representative of the state-of-the-art in the area.
Chapter V
Multi-Objective Optimization Using Artificial Immune Systems ..................................................... 106
Licheng Jiao, Xidian University, P.R. China
Maoguo Gong, Xidian University, P.R. China
Wenping Ma, Xidian University, P.R. China
Ronghua Shang, Xidian University, P.R. China
This chapter focuses on extending Artificial Immune Systems (AIS) to solve multiobjective problems.
It introduces two multiobjective optimization algorithms using AIS, the Immune Dominance Clonal
Multi-objective Algorithm (IDCMA), and the Non-dominated Neighbour Immune Algorithm (NNIA).
IDCMA is unique in that its fitness values of current dominated individuals are assigned as the values
of a custom distance measure, termed as Ab-Ab affinity, between the dominated individuals and one
of the nondominated individuals found so far. Meanwhile, NNIA solves multiobjective optimization
problems by using a non-dominated neighbour-based selection technique, an immune inspired operator,
two heuristic search operators and elitism. The unique selection technique of NNIA only selects minority
isolated nondominated individuals in population. The selected individuals are then cloned proportionally
to their crowding-distance values before heuristic search. By using the nondominated neighbor-based
selection and proportional cloning, NNIA pays more attention to the less-crowded regions of the current
trade-off front.
Chapter VI
Lexicographic Goal Programming and Assessment Tools for a
Combinatorial Production Problem ................................................................................................... 148
Seamus M. McGovern, U.S. DOT National Transportation Systems Center, USA
Surendra M. Gupta, Northeastern University, USA
NP-complete combinatorial problems often necessitate the use of near-optimal solution techniques includ-
ing heuristics and metaheuristics. The addition of multiple optimization criteria can further complicate
comparison of these solution techniques due to the decision-maker’s weighting schema potentially mask-
ing search limitations. In addition, many contemporary problems lack quantitative assessment tools,
including benchmark data sets. This chapter proposes the use of lexicographic goal programming for use
in comparing combinatorial search techniques. These techniques are implemented here using a recently
formulated problem from the area of production analysis. The development of a benchmark data set and
other assessment tools is demonstrated, and these are then used to compare the performance of a genetic
algorithm and an H-K general-purpose heuristic as applied to the production-related application.
Chapter VII
Evolutionary Population Dynamics and Multi-Objective Optimisation Problems ............................ 185
Andrew Lewis, Griffith University, Australia
Sanaz Mostaghim, University of Karlsruhe, Germany
Marcus Randall, Bond University, Australia
Problems for which many objective functions are to be simultaneously optimised are widely encountered
in science and industry. These multiobjective problems have also been the subject of intensive investi-
gation and development recently for metaheuristic search algorithms such as ant colony optimisation,
particle swarm optimisation and extremal optimisation. In this chapter, a unifying framework called
evolutionary programming dynamics (EPD) is examined. Using underlying concepts of self organised
criticality and evolutionary programming, it can be applied to many optimisation algorithms as a control-
ling metaheuristic, to improve performance and results. We show this to be effective for both continuous
and combinatorial problems.
Section II
Applications
Chapter VIII
Multi-Objective Evolutionary Algorithms for Sensor Network Design ............................................ 208
Ramesh Rajagopalan, Syracuse University, USA
Chilukuri K. Mohan, Syracuse University, USA
Kishan G. Mehrotra, Syracuse University, USA
Pramod K. Varshney, Syracuse University, USA
Many sensor network design problems are characterized by the need to optimize multiple conflicting
objectives. However, existing approaches generally focus on a single objective (ignoring the others), or
combine multiple objectives into a single function to be optimized, to facilitate the application of clas-
sical optimization algorithms. This restricts their ability and constrains their usefulness to the network
designer. A much more appropriate and natural approach is to address multiple objectives simultane-
ously, applying recently developed multi-objective evolutionary algorithms (MOEAs) in solving sensor
network design problems. This chapter describes and illustrates this approach by modeling two sensor
network design problems (mobile agent routing and sensor placement), as multiobjective optimization
problems, developing the appropriate objective functions and discussing the tradeoffs between them.
Simulation results using two recently developed MOEAs, viz., EMOCA (Rajagopalan, Mohan, Mehrotra,
& Varshney, 2006) and NSGA-II (Deb, Pratap, Agarwal, & Meyarivan, 2000), show that these MOEAs
successfully discover multiple solutions characterizing the tradeoffs between the objectives.
Chapter IX
Evolutionary Multi-Objective Optimization for DNA Sequence Design .......................................... 239
Soo-Yong Shin, Seoul National University, Korea
In-Hee Lee, Seoul National University, Korea
Byoung-Tak Zhang, Seoul National University, Korea
Finding reliable and efficient DNA sequences is one of the most important tasks for successful DNA-
related experiments such as DNA computing, DNA nano-assembly, DNA microarrays and polymerase
chain reaction. Sequence design involves a number of heterogeneous and conflicting design criteria.
Also, it is proven as a class of NP problems. These suggest that multiobjective evolutionary algorithms
(MOEAs) are actually good candidates for DNA sequence optimization. In addition, the characteristics
of MOEAs including simple addition/deletion of objectives and easy incorporation of various existing
tools and human knowledge into the final decision process could increase the reliability of final DNA
sequence set. In this chapter, we review multiobjective evolutionary approaches to DNA sequence
design. In particular, we analyze the performance of ε-multiobjective evolutionary algorithms on three
DNA sequence design problems and validate the results by showing superior performance to previous
techniques.
Chapter X
Computational Intelligence to Speed-Up Multi-Objective Design Space
Exploration of Embedded Systems ..................................................................................................... 265
Giuseppe Ascia, Università degli Studi di Catania, Italy
Vincenzo Catania, Università degli Studi di Catania, Italy
Alessandro G. Di Nuovo, Università degli Studi di Catania, Italy
Maurizio Palesi, Università degli Studi di Catania, Italy
Davide Patti, Università degli Studi di Catania, Italy
Multi-Objective Evolutionary Algorithms (MOEAs) have received increasing interest in industry, be-
cause they have proved to be powerful optimizers. Despite the great success achieved, MOEAs have
also encountered many challenges in real-world applications. One of the main difficulties in applying
MOEAs is the large number of fitness evaluations (objective calculations) that are often needed before
a well acceptable solution can be found. In fact, there are several industrial situations in which both
fitness evaluations are computationally expensive and, meanwhile, time available is very low. In this
applications efficient strategies to approximate the fitness function have to be adopted, looking for a
trade-off between optimization performances and efficiency. This is the case of a complex embedded
system design, where it is needed to define an optimal architecture in relation to certain performance
indexes respecting strict time-to-market constraints. This activity, known as Design Space Exploration
(DSE), is still a great challenge for the EDA (Electronic Design Automation) community. One of the
most important bottlenecks in the overall design flow of an embedded system is due to the simulation.
Simulation occurs at every phase of the design flow and it is used to evaluate a system candidate to
be implemented. In this chapter we focus on system level design proposing an hybrid computational
intelligence approach based on fuzzy approximation to speed up the evaluation of a candidate system.
The methodology is applied to a real case study: optimization of the performance and power consump-
tion of an embedded architecture based on a Very Long Instruction Word (VLIW) microprocessor in a
mobile multimedia application domain. The results, carried out on a multimedia benchmark suite, are
compared, in terms of both performance and efficiency, with other MOGAs strategies to demonstrate
the scalability and the accuracy of the proposed approach.
Chapter XI
Walking with EMO: Multi-Objective Robotics for Evolving Two, Four,
and Six-Legged Locomotion............................................................................................................... 300
Jason Teo, Universiti Malaysia Sabah, Malaysia
Lynnie D. Neri, Universiti Malaysia Sabah, Malaysia
Minh H. Nguyen, University of New South Wales, Australia
Hussein A. Abbass, University of New South Wales, Australia
This chapter will demonstrate the various robotics applications that can be achieved using evolutionary
multiobjective optimization (EMO) techniques. The main objective of this chapter is to demonstrate
practical ways of generating simple legged locomotion for simulated robots with two, four and six legs
using EMO. The operational performance as well as complexities of the resulting evolved Pareto solu-
tions that act as controllers for these robots will then be analyzed. Additionally, the operational dynamics
of these evolved Pareto controllers in noisy and uncertain environments, limb dynamics and effects of
using a different underlying EMO algorithm will also be discussed.
Chapter XII
Evolutionary Multi-Objective Optimization in Energy Conversion Systems:
From Component Detail to System Configuration ............................................................................. 333
Andrea Toffolo, University of Padova, Italy
The research field on energy conversion systems presents a large variety of multiobjective optimization
problems that can be solved taking full advantage of the features of evolutionary algorithms. In fact, design
and operation of energy systems can be considered in several different perspectives (e.g., performance,
efficiency, costs, environmental aspects). This results in a number of objective functions that should be
simultaneously optimized, and the knowledge of the Pareto optimal set of solutions is of fundamental
importance to the decision maker. This chapter proposes a brief survey of typical applications at dif-
ferent levels, ranging from the design of component detail to the challenge about the synthesis of the
configuration of complex energy conversion systems. For sake of simplicity, the proposed examples are
grouped into three main categories: design of components/component details, design of overall energy
system and operation of energy systems. Each multiobjective optimization problem is presented with
a short background and some details about the formulation. Future research directions in the field of
energy systems are also discussed at the end of the chapter.
Chapter XIII
Evolutionary Multi-Objective Optimization for Assignment Problems ............................................ 364
Mark P. Kleeman, Air Force Institute of Technology, USA
Gary B. Lamont, Air Force Institute of Technology, USA
Assignment problems are used throughout many research disciplines. Most assignment problems in the
literature have focused on solving a single objective. This chapter focuses on assignment problems that
have multiple objectives that need to be satisfied. In particular, this chapter looks at how multiobjective
evolutionary algorithms have been used to solve some of these problems. Additionally, this chapter
examines many of the operators that have been utilized to solve assignment problems and discusses
some of the advantages and disadvantages of using specific operators.
Chapter XIV
Evolutionary Multi-Objective Optimization in Military Applications .............................................. 388
Mark P. Kleeman, Air Force Institute of Technology, USA
Gary B. Lamont, Air Force Institute of Technology, USA
This chapter attempts to provide a spectrum of military multiobjective optimization problems whose char-
acteristics imply that an MOEA approach is appropriate. The choice of selected operators indicates that
good results can be achieved for these problems. Selection and testing of other operators and associated
parameters may generate “better” solutions. It is not intended that these problems represent the totality
or even the complete spectrum of all military optimization problems. However, the examples discussed
are very complex with high-dimensionality and therefore reflect the many difficulties the military faces
in achieving their goals. MOEAs with local search are another method of attacking theslems that should
provide effective and efficient solutions.
Foreword
The topic of multiobjective optimization is of utmost importance to most practitioners who deal with a
variety of optimization tasks in real-world settings. The reason is that most real-world problems involve
more than one objective. It is quite unusual to optimize along one dimension, whether this would be
the cost of production, inventory levels or total profits. Rather, real-world problems involve multiple
conflicting objectives (e.g., minimizing the weight of a battery while maximizing its life). Because of
this, no one solution can be termed “the best”—and it is necessary to consider a set of trade-off optimal
solutions.
Many classic optimization methods have been proposed to address multiobjective optimization
problems. Most of these methods convert such problems into single objective formulations, which suffer
from a few disadvantages. These include the necessity of making a variety of adjustments to a method
and also the return of a single solution at the end of each run.
Hence, there is a huge interest in applications of computational intelligence methods for multiobjec-
tive optimization problems. Indeed, it is one of the hottest topics at present, so this book is coming out
at the right time. The first part of the book deals with issues of applicability of various techniques, like
particle swarm optimization, differential evolution, artificial immune systems, evolutionary algorithms,
and multiobjective optimization problems. The second part of the book concentrates on various applica-
tions (e.g., wireless sensor network design, DNA sequence design, assignment problems, and military
applications).
I am sure you will find this book quite useful and interesting, as it presents a variety of available
techniques and some areas of potential applications.
Enjoy.
Zbigniew Michalewicz
University of Adelaide
xv
Preface
Solving multiobjective optimization (MO) problems using computational intelligence (CI) techniques,
such as genetic algorithms, particle swam optimization, artificial immune systems, is a fast-developing
field of research. Similar to other optimization techniques, MO algorithms using CI techniques (or we
simply call CI-based MO algorithms) are employed to find feasible solutions for a particular problem.
In contrast to their single objective optimization counterparts, they are associated with multiobjective
fitness functions, which complicate the multi-dimensional fitness landscape. With CI-based MO algo-
rithms, there exists a set of trade-off optimal solutions. It thus gives decision makers more options to
choose the best solution according to post-analysis preference information. At the current state, CI-based
MO algorithms have developed to become competent with an increasingly large number of CI-based
MO applications in real life. Researchers have been investigating theoretically as well as empirically
the performance of CI-based MO algorithms on a wide range of optimization problems including com-
binatorial, real-valued to dynamic and noisy problems.
The application of MO as well as CI-based MO for real-world problems is obvious since real-world
problems are hardly single-objective. Because of tremendous practical demands, the research in CI-based
MO has developed quickly with diverse methods. As a result, there are massive numbers of research
papers published in the format of journals as well as conferences. However, most papers on CI-based
MO are scattered around in different journals and conference proceedings focussed on very special and
narrow topics. Although a few books exist on evolutionary MO, there is no publication to provide read-
ers an understanding through all these diverse CI-based MO techniques. Further, due to the practical
usefulness of CI-based MO, there is an increasing demand to have separate subject of CI-based MO in
the educational plan of universities worldwide for: undergraduate and postgraduate students to provide
them a broad knowledge on a wide range of CI-based MO techniques. It is therefore vital to have edi-
tions of chapters across areas of MO in order to summarize the most important CI-based MO techniques
as well as their specialized applications.
This edition is expected to meet the demand to have separate subject of CI-based MO in the educational
plan of universities. It consists of open-solicited and invited chapters written by leading researchers in
the field of computational intelligence. All papers went through a peer review process by at least two
experts in the field and one of the editors. Our goal is to provide lecture notes that representatively cover
the foundation as well as the practical side of the topic. This represents a responsibility from our end to
balance between technicality of specialists, and readability of a larger audience. The book is organized
in such a way that it is primarily used for teaching under graduate and post-graduate levels. Meanwhile,
it can be a reference of CI-based MO techniques for researchers and practitioners.
For the foundation part, the book includes a description of common concepts of MO, a survey of the
MO literature, and several work on hot topics such as extending genetic algorithms, differential evolu-
tion, particle swarm optimization, and artificial immune systems to the MO domain. Meanwhile, the
xvi
application part covers a quite wide range of work from DNA design, network installation to the defence
and security domain. Because of the space constraints, this book just contains a small collection of the
work in the field. However, they are representatives for most of current topics in the CI-based MO.
There are XIV chapters total. Chapter I is devoted to summarize common concepts related to MO.
A description of traditional as well as CI-based MO is given. Further, various aspects of performance
assessment for MO techniques are discussed. Finally, challenges facing MO techniques are addressed.
All of these descriptions and analysis give the readers basic knowledge for understanding the rest of
the book.
In Chapter II, a survey of particle swarm optimization (PSO) is given. PSO has attracted the interest
of researchers due to its simplicity, effectiveness and efficiency in solving numerous single-objective
optimization problems. Up-to-date, there is a significant number of multiobjective PSO approaches and
applications reported in the literature. This chapter aims at providing a review and discussion of the
most established results on this field, as well as exposing the most active research topics that can give
initiative for future research.
Chapter III discusses generalized differential evolution (GDE), which is a general-purpose optimizer.
It is based on a relatively recent Evolutionary Algorithm, Differential Evolution, which has been gaining
popularity because of its simplicity and good observed performance. GDE extends differential evolution
for problems with several objectives and constraints. The chapter concentrates on describing different
development phases and performance of GDE. The ability to solve multiobjective problems is mainly
discussed, but constraint handling and the effect of control parameters are also covered as well as other
relevant studies. It is found that the GDE versions, in particular the latest version, are effective and ef-
ficient for solving constrained multiobjective problems.
Chapter IV presents a hybrid between a PSO approach and scatter search. The main motivation for
developing this approach is to combine the high convergence rate of the PSO algorithm with a local
search approach based on scatter search, in order to have the main advantages of these two types of
techniques. It proposes a new leader selection scheme for PSO, which aims to accelerate convergence by
increasing the selection pressure. However, this higher selection pressure reduces diversity. To alleviate
that, scatter search is adopted after applying PSO, in order to spread the solutions previously obtained,
so that a better distribution along the Pareto front is achieved. The proposed approach can produce
reasonably good approximations of multiobjective problems of high dimensionality, performing only
a few thousnads of fitness function evaluations. Test problems taken from the specialized literature are
adopted to validate the proposed hybrid approach. Results are compared with respect to the NSGA-II,
which is an approach representative of the state-of-the-art in the area.
Chapter V focuses on extending artificial immune systems (AIS) to solve multiobjective problems.
It introduces two multiobjective optimization algorithms using AIS, the immune dominance clonal
multi-objective algorithm (IDCMA), and the non-dominated neighbour immune algorithm (NNIA).
IDCMA is unique in that its fitness values of current dominated individuals are assigned as the values
of a custom distance measure, termed as Ab-Ab affinity, between the dominated individuals and one
of the non-dominated individuals found so far. Meanwhile, NNIA solves multiobjective optimization
problems by using a nondominated neighbor-based selection technique, an immune inspired operator,
two heuristic search operators and elitism. The unique selection technique of NNIA only selects minority
isolated non-dominated individuals in population. The selected individuals are then cloned proportionally
to their crowding-distance values before heuristic search. By using the nondominated neighbor-based
selection and proportional cloning, NNIA pays more attention to the less-crowded regions of the current
trade-off front.
xvii
Chapter VI proposes the use of lexicographic goal programming for use in comparing combinatorial
search techniques. These techniques are implemented here using a recently formulated and multiobjec-
tive problem from the area of production analysis. The development of a benchmark data set and other
assessment tools is demonstrated, and these are then used to compare the performance of a genetic
algorithm and an H-K general-purpose heuristic as applied to the production-related application.
In Chapter VII, a unifying framework called evolutionary programming dynamics (EPD) is examined.
Using underlying concepts of self organised criticality and evolutionary programming, it can be applied
to many optimisation algorithms as a controlling meta-heuristic, to improve performance and results.
The chapter shows this to be effective for both continuous and combinatorial problems.
Chapter VIII describes and illustrates this approach by modeling two sensor network design problems
(mobile agent routing and sensor placement), as multiobjective optimization problems, developing the
appropriate objective functions and discussing the tradeoffs between them. Simulation results using two
recently developed multiobjective evolutionary algorithms (MOEAs) show that these MOEAs success-
fully discover multiple solutions characterizing the tradeoffs between the objectives.
Chapter IX presents a possibility to apply evolutionary multiobjective optimization in designing
DNA sequences. It performs a review on multiobjective evolutionary approaches to DNA sequence
design. In particular, it analyzes the performance of ε-multiobjective evolutionary algorithms on three
DNA sequence design problems and validates the results by showing superior performance to previous
techniques.
Chapter X describes an approach to speed up the evolutionary design of application- specific embed-
ded systems by means of fuzzy approximation. The methodology uses a MOEA for heuristic exploration
of the design space and a fuzzy system to evaluate the candidate system configurations to be visited. The
proposed methodology works in two phases: firstly all configurations are evaluated using computationally
expensive simulations and their results are used to train the fuzzy system until it becomes reliable; in the
second phase the accuracy of the fuzzy system is refined using results obtained by simulating promising
configurations. Although the methodology was applied to the design of an embedded architecture based
on a very long instruction word (VLIW) microprocessor in a mobile multimedia application domain, it
is of general applicability.
Chapter XI demonstrates the various robotics applications that can be achieved using MOEAs. The
main objective of this chapter is to demonstrate practical ways of generating simple legged locomotion
for simulated robots with two, four and six legs using MOEAs. The operational performance as well as
complexities of the resulting evolved Pareto solutions that act as controllers for these robots will then
be analyzed. Additionally, the operational dynamics of these evolved Pareto controllers in noisy and
uncertain environments, limb dynamics and effects of using a different underlying MOEA will also be
discussed.
Chapter XII proposes a brief survey of typical applications of MOEAs in the field of design energy
systems at different levels, ranging from the design of component detail to the challenge about the syn-
thesis of the configuration of complex energy conversion systems. For sake of simplicity, the proposed
examples are grouped into three main categories: design of components/component details, design of
overall energy system and operation of energy systems. Each multiobjective optimization problem is
presented with a short background and some details about the formulation. Future research directions
in the field of energy systems are also discussed at the end of the chapter.
Chapter XIII discusses assignment problems which are used throughout many research disciplines.
Most assignment problems in the literature have focused on solving a single objective. This chapter focuses
on assignment problems that have multiple objectives that need to be satisfied. In particular, this chapter
looks at how multiobjective evolutionary algorithms have been used to solve some of these problems.
xviii
Additionally, this chapter examines many of the operators that have been utilized to solve assignment
problems and discusses some of the advantages and disadvantages of using specific operators.
Chapter XIV attempts to provide a spectrum of military multiobjective optimization problems whose
characteristics imply that an MOEA approach is appropriate. The choice of selected operators indicates
that good results can be achieved for these problems. Selection and testing of other operators and as-
sociated parameters may generate “better” solutions. It is not intended that these problems represent
the totality or even the complete spectrum of all military optimization problems. However, the examples
discussed are very complex with high-dimensionality and therefore reflect the many difficulties the
military faces in achieving their goals. MOEAs with local search are another method of attacking these
complex problems that should provide effective and efficient solutions.
In summary, this book intends to promote the role of CI-based multiobjective optimization in solving
practical problems. It is also expected to provide students with enough knowledge to be able to identify
suitable techniques for their particular problems. Furthermore, it encourages deeper research into this
field and the practical implementation of the results derived from this field.
xix
Acknowledgment
The editors would like to acknowledge the help of all involved in the collation and review process of the
book, without whose support the project could not have been satisfactorily completed. Deep apprecia-
tion and gratitude is due to the School of ITEE, UNSW@ADFA, for ongoing sponsorship in terms of
generous allocation of Internet, hardware and software resources and other editorial support services
for coordination of this year-long project.
Most of the authors of chapters included in this book also served as referees for chapters written by
other authors. Thanks go to all those who provided constructive and comprehensive reviews. However,
some of the reviewers must be mentioned as their reviews set the benchmark. Reviewers who provided
the most comprehensive, critical and constructive comments include: Saku Kukkonen, Jason Teo, Minh
Ha Nguyen, Maoguo Gong, Soo-Yong Shin, Ramesh Rajagopalan, Konstantinos E. Parsopoulos, An-
drea Toffolo, Andrew Lewis, Carlos A. Coello Coello, Alessandro Di Nuovo, Mark Kleeman, Marcus
Randall, and Luis Martí.
Special thanks go to the publishing team at IGI Global, whose contributions throughout the whole
process from the inception of the initial idea to final publication have been invaluable. In particular, we
own a great deal for Deborah Yahnke, Kristin Roth, and Ross Miller, who continuously supported us
via e-mail for keeping the project on schedule.
Special thanks go to Professor Hussein Abbass for his helpful discussions on materializing this book
project. And last but not least, our families, for their unfailing support and encouragement during the
months it took to give birth to this book.
In closing, we wish to thank all of the authors for their insights and excellent contributions to this
book.
§ 5. Arms.
We shall not, of course, study Assyrian arms from the military
point of view. That question has been treated with all the care it
deserves by Rawlinson and Layard.[431] From the stone axes and
arrow-heads that have been found in the oldest Chaldæan tombs, to
the fine weapons and defensive armour in iron and bronze, used by
the soldiers of Nineveh in its greatest years, by the cavalry, the
infantry, and the chariot-men of Sargon and Sennacherib, the
progress is great and must have required many long centuries of
patient industry. In Assyria no trade can have occupied more hands
or given rise to more invention than that of the armourer. For two
centuries the Assyrian legions found no worthy rivals on the
battlefields of Asia; and, although their superiority was mainly due, of
course, to qualities of physical vigour and moral energy developed
by discipline, their unvarying success was in some degree the result
of their better arms. Without dwelling upon this point we may just
observe that when war is the chief occupation of a race, its arms are
sure to be carried to an extreme degree of luxury and perfection.
Some idea of their elaboration in the case of Assyria may be gained
from the reliefs and from the original fragments that have come down
to us.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookfinal.com