Professional Documents
Culture Documents
Textbook Numerical and Evolutionary Optimization Neo 2017 Leonardo Trujillo Ebook All Chapter PDF
Textbook Numerical and Evolutionary Optimization Neo 2017 Leonardo Trujillo Ebook All Chapter PDF
https://textbookfull.com/product/neo-2015-results-of-the-
numerical-and-evolutionary-optimization-workshop-neo-2015-held-
at-september-23-25-2015-in-tijuana-mexico-1st-edition-oliver-
schutze/
https://textbookfull.com/product/numerical-methods-and-
optimization-in-finance-manfred-gilli/
https://textbookfull.com/product/evolutionary-computation-in-
combinatorial-optimization-arnaud-liefooghe/
https://textbookfull.com/product/optimization-using-evolutionary-
algorithms-and-metaheuristics-applications-in-engineering-1st-
edition-kaushik-kumar/
https://textbookfull.com/product/controller-tuning-with-
evolutionary-multiobjective-optimization-a-holistic-
multiobjective-optimization-design-procedure-1st-edition-
gilberto-reynoso-meza/
https://textbookfull.com/product/artificial-life-and-
evolutionary-computation-12th-italian-workshop-
wivace-2017-marcello-pelillo/
https://textbookfull.com/product/advances-in-evolutionary-and-
deterministic-methods-for-design-optimization-and-control-in-
engineering-and-sciences-edmondo-minisci/
https://textbookfull.com/product/advances-in-evolutionary-and-
deterministic-methods-for-design-optimization-and-control-in-
engineering-and-sciences-antonio-gaspar-cunha/
Studies in Computational Intelligence 785
Numerical and
Evolutionary
Optimization –
NEO 2017
Studies in Computational Intelligence
Volume 785
Series editor
Janusz Kacprzyk, Polish Academy of Sciences, Warsaw, Poland
e-mail: kacprzyk@ibspan.waw.pl
The series “Studies in Computational Intelligence” (SCI) publishes new develop-
ments 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 sciences, 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. Of particular value to both the contributors and the
readership are the short publication timeframe and the world-wide distribution,
which enable both wide and rapid dissemination of research output.
Editors
123
Editors
Leonardo Trujillo Yazmin Maldonado
Posgrado en Ciencias de la Ingeniería Posgrado en Ciencias de la Ingeniería
Tecnológico Nacional de México - Instituto Tecnológico Nacional de México - Instituto
Tecnológico de Tijuana Tecnológico de Tijuana
Tijuana, Baja California Tijuana, Baja California
Mexico Mexico
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
v
vi Preface
speakers, Efren Mezura, Miguel Moreles and Esteban Tlelo, contributed with
invited chapters.
The present volume contains sixteen chapters that are organized into four parts:
Constraint Handling Techniques (Part I), Evolutionary and Genetic Computation
(Part II), Optimal Control (Part III) and Real-World Applications (Part IV).
In Part I, three chapters are presented related to constraint handling techniques.
The first chapter is an invited work from the laboratory of Efren Mezura that
provides an extensive comparison of parameter control methods for differential
evolution. The second chapter presents a descent method for efficient search in
constrained multi-objective problems. The third and final chapter presents a con-
strained real-world application of a gradient descent method using the hypervolume
indicator.
Part II contains two chapters on evolutionary and genetic computation. The first
one deals with a problem in evolutionary computer vision, fitting multiple ellipses
with multi-objective evolutionary search. The second chapter crosses over to the
study of human interaction with evolutionary art by means of a kinect system.
Part III contains five chapters on optimal control. The first chapter applies
control techniques to optimize supply chains. The NSGA-II algorithm is used to
tune the parameters of a predictive controller in the second chapter. Similarly,
controller tuning is also studied in the following chapter, in this case with the
steepest descent method. The fourth chapter in this part deals with a self-tuning
fuzzy controller, while the final chapter presents work on the optimal design of a
sliding mode controller using differential evolution and the interior point method.
Part IV presents the final six chapters of this volume, dealing with real-world
applications. The first chapter presents work on parameter estimation of a biological
system with important biomedical applications, the second invited chapter of this
volume written by Miguel Moreles. The next work is the invited chapter from
Esteban Tlelo, where authors apply NSGA-II for the optimal sizing of voltage
regulators. The third chapter presents a genetically optimized fuzzy system for
classifying the quality of treated water. The fourth chapter deals with the optimal
stabilization of civil structures that are exposed to external forces, such as earth-
quakes. The comparison of two methods for I/Q imbalance compensation in RF
power amplifiers is presented in the fifth chapter. The final chapter of this part, and
of the NEO 2017 volume, deals with the use of a linear programming approach to
assess the impact of social networks in the hotel industry, an important financial
activity in Mexico.
We express our gratitude to all invited speakers and attendees of the NEO 2017,
you are the driving force behind this workshop and this post-proceeding volume.
Thanks are also extended to all the authors and reviewers of contributed chapters,
your hard work will make this volume a reference for future research.
To all of the researchers, authors and reviewers of the great work presented at NEO
2017 and this post-proceeding volume, without you there is no NEO! Special
thanks are given to the invited speakers of NEO 2017, Dr. Efrén Mezura-Montes,
Dr. Miguel Ángel Moreles, Dr. Michael Emmerich, Dr. Gustavo Olague,
Dr. Esteban Tlelo Cuautle, Dr. Marcial Gonzalez and Ing. Leobardo Morales.
To the funding provided by CONACyT Fronteras de la Ciencia project
FC-2015-2:944 “Aprendizaje evolutivo a gran escala”, the CONACyT Basic
Science project 285599 “Toma de decisiones multiobjetivo para sistemas altamente
complejos”, the CONACyT-DAAD project 207493 “Memetic strategies for indi-
cator based multi-objective evolutionary algorithms”, the TecNM project 6350.17-P
“Planificación inteligente de recursos en sistemas reconfigurables”, the TecNM
project 6575.18-P “Ingeniería aplicada mediante el modelizado matemático para
comprender la evolución del cáncer, la respuesta inmunológica y el efecto de
algunos tratamientos” and the two industrial sponsors, IBM and TechData.
Finally, thanks are extended to the student organizers of the event,
M.C. Perla Juárez and Ing. Rogelio Valdez for their invaluable participation, also
M.C. Guadalupe Aĺarez, M.C. Darian Reyes, M.C. Carlos Goribar, Ing. Noelia Torres,
M.C. Luis Muñoz, M.C. Itzel Gaytán, M.C. Jorge Alonso, Ing. César Bernal,
Ing. Ernesto Aĺvarez, M.C. Victor López, M.C. Uriel Lopez and Ing. Carlos Dibene.
vii
Contents
Optimal Control
Applying Control Theory to Optimize the Inventory Holding
Costs in Supply Chains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
Pablo M. Ayllon-Lorenzo, Selene L. Cardenas-Maciel,
and Nohe R. Cazarez-Castro
ix
x Contents
Real-World Applications
Biot’s Parameters Estimation in Ultrasound Propagation Through
Cancellous Bone . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203
Miguel Angel Moreles, Joaquin Peña, and Jose Angel Neria
Optimal Sizing of Low-DropOut Voltage Regulators by NSGA-II
and PVT Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
Jesus Lopez-Arredondo, Esteban Tlelo-Cuautle, Luis Gerardo de la Fraga,
Victor Hugo Carbajal-Gomez, and Miguel Aurelio Duarte-Villaseñor
Genetic Optimization of Fuzzy Systems for the Classification
of Treated Water Quality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248
Itzel G. Gaytan-Reyes, Nohe R. Cazarez-Castro,
Selene L. Cardenas-Maciel, David A. Lara-Ochoa,
and Armando Martinez-Graciliano
Stabilization Based on Fuzzy System for Structures Affected
by External Disturbances . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 261
Marco A. Alcaraz-Rodriguez, Nohe R. Cazarez-Castro,
Selene L. Cardenas-Maciel, Luis N. Coria,
and Sergio Contreras-Hernandez
Comparison of Two Methods for I/Q Imbalance Compensation
Applied in RF Power Amplifiers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275
S. A. Juárez-Cázares, E. Allende-Chávez, Y. Sandoval-Ibarra,
J. R. Cárdenas-Valdez, E. Tlelo-Cuautle, and J. C. Nuñez-Pérez
An Application of Data Envelopment Analysis to the Performance
Assessment of Online Social Networks Usage in Mazatlán Hotel
Organizations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
Manuel Cázares and Oliver Schütze
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311
List of Contributors
xi
xii List of Contributors
1 Introduction
evolution process to evolve parameter values at the same time that solutions to the
optimization problems are evolved [9].
Nowadays, one of the most popular EAs is Differential Evolution (DE), which was
introduced in [10]. Since its emergence, this algorithm was so-well received, mainly
because it is considered an easy yet straightforward search strategy. However, as well
as other EAs, the parameter setting is considered as the key element in its success.
Three main parameters are required by DE, (1) the population size NP, (2) the scaling
factor of the mutation operator F, and (3) the crossover rate CR. Originally, DE was
designed to solve unconstrained numerical optimization problems (UNOPs). The
specialized literature indeed reports efforts to add PC to DE, e.g., the self-adaptive
Differential Evolution algorithm (SaDE) [11] and jDE [12], both for unconstrained
search spaces.
To deal with a constrained search space, EAs require the addition of a constraint-
handling technique (CHT) [13]. According to the specialized literature, the selection of
a suitable CHT is closely related to the performance reached by an EA for Constrained
Numerical Optimization Problems (CNOPs) [14]. Penalty functions are very popular
CHTs [15, 16], where a CNOP is transformed into an unconstrained one by incorpo-
rating a certain value to the objective function based on the amount of constraints
violation in a given solution. Other popular CHTs are the feasibility rules introduced in
[15] and the e-constrained method presented in [16].
DE has been successfully adopted to solve CNOPs [13]. Among those DE-based
EAs for CNOPs, the Differential Evolution with Combined Variants (DECV) was
proposed in [17]. This EA is based on two well-known DE-variants (DE/rand/1/bin and
DE/best/1/bin), where a switch between variants is based on an expected percentage of
feasible solutions in the current population. An extension of SaDE proposed in [11]
was presented in [18] to solve CNOPs. The authors modified the replacement criterion,
such as feasible and infeasible individuals are differentiated using the set of feasibility
rules above mentioned. In the same way, the jDE adaptive algorithm introduced in [12]
was improved incorporating a CHT based on a penalty function.
On the other hand, the Diversity Differential Evolution (DDE) algorithm was
proposed in [19]. Besides NP, CR and F, two additional parameters were used: (1) NO,
which determines how many descendants can be generated by a target vector (potential
solution of the problem to be solved); and (2) Sr, which is responsible to control the
way vectors are selected. Thus, in that study, the use of a deterministic and a self-
adaptive parameter control schemes were proposed. Thereby, F, CR and NO are self-
adapted; while Sr, is controlled by a deterministic approach.
Another important adaptive algorithm is the Generalized Differential Evolution
(GDE) with Exponential Weighting Moving Average (EWMA), proposed in [20].
EWMA is a PCS that performs parameter control adaptation by updating weighted
average history of successful control parameter values. This algorithm has shown being
suitable for single- and multi-objective optimization with or without constraints.
In [21], the authors presented a Memetic Differential Evolution for CNOPs, where
DE was enhanced with a mathematical programming method called Powell´s conjugate
direction as a local search operator and the e-constrained method as a CHT. Such
algorithm was able to quickly reach the feasible region of the search space and it also
provided competitive feasible solutions.
6 O. Ramos-Figueroa et al.
2 Problem Statement
A CNOP, known also as the non-linear programming problem [13–23], without loss of
generality, can be defined as to:
Find x which minimizes:
f ðxÞ ð1Þ
Deterministic Parameter Control in Differential Evolution 7
hk ðxÞ ¼ 0; j ¼ 1; . . .; p ð3Þ
xLi xi xU
i ; i ¼ 1; . . .; n ð4Þ
3 Proposed Study
Fig. 1. DE mutation and crossover operators applied to trial vector i at generation G. xi;G is the
target vector. xr1;G 6¼ xr2;G 6¼ xr3;G 6¼ xi;G are three different vectors, randomly selected and
different to the target vector. vi;G is the mutant vector. Finally, ui;G is the trial vector.
From the above, the fine-tuning of parameters F and CR helps to provide a good
trade-off between exploration and exploitation, and it may lead to a success search. It is
important to emphasize that the two parameters (F and CR) are somehow related.
Hence, if one parameter is misconfigured, the performance of the other parameter may
be affected.
where xi is the solution evaluated, and the inequality and equality constraints are
expressed with gj and hk, respectively. Below the two CHT studied in this work are
described in detail.
10 O. Ramos-Figueroa et al.
The set of feasibility rules [15] is one of the most popular CHT. It is based on the
sum of constraint violation described in Eq. (6). This CHT is widely used, mainly
because is simple and easy to implement and no parameters are required. Solutions are
compared considering the following three criteria:
1. When comparing two feasible solutions, the one with the best objective function is
chosen.
2. When comparing a feasible solution and an infeasible solution, the feasible one is
chosen.
3. When comparing two infeasible solutions, the one with the lowest sum of constraint
violation (computed as in Eq. (6)) is chosen.
The e-constrained method is another popular CHT [16]. In this technique, an e-
level comparison is defined as an order relation on a pair of objective function values
and sums of constraints violation ðf ðxi Þ; uðxi ÞÞ, as it can be seen in Eq. 7.
8
< f ðx1 Þ\f ðx2 Þ; if uðx1 Þ; uðx2 Þ e;
½f ðx1 Þ; uðx1 Þ\ef ðx2 Þ; uðx2 ÞÞ () f ðx Þ\f ðx2 Þ; if uðx1 Þ; uðx2 Þ ¼ e; ð7Þ
: 1
uðx1 Þ\uðx2 Þ; otherwise
where t is the current iteration, Tc is the maximum number of iterations using the e-
level comparison, xh is the top h-th solution, h ¼ 0:2 n, and the e tolerance reduction
speed is controlled by cp.
variant change is carried out. Originally, the feasibility rules are used as CHT in
DECV. Such rules are used when the best vector between the target and its trial must be
chosen. The steps comprised by the DECV algorithm are shown in Algorithm 2.
Other DECV versions have been proposed [17], i.e., the DECV version where the
DE variants order is swapped. Thus, the algorithm starts with DE/best/1/bin, and
changes to DE/rand/1/bin after the percentage of feasible solutions surpasses the PCV
value [17].
The two DECV versions mentioned above are studied in this research. To identify
them, they will be referred as follows: (1) DECV (rand-best) is the algorithm which
starts with DE/rand/1/bin and changes to DE/best/1/bin with PCV = 90%; and
(2) DECV (best-rand) is the algorithm that starts with DE/best/1/bin and changes to
DE/rand/1/bin with PCV = 10%.
12 O. Ramos-Figueroa et al.
Table 1. Deterministic PCS based on a sinusoidal function taken from [24]. freq: Frequency; G:
current generation and MaxGen: maximum number of generations.
(continued)
Deterministic Parameter Control in Differential Evolution 13
Table 1. (continued)
0.5; as the search process progresses, the sinusoidal function is employed to increase
and decrease the parameter-values, oscillating between 0 and 1. That is to say, an
increasing oscillatory behavior is presented.
On the other hand, there are other configurations where the parameters are ini-
tialized with values close to 0.5. After that, as the search advances, the parameter
values present a remarked oscillation between 0 and 1; such oscillation decreases once
the end of the search approaches and the values reach 0.5 again, i.e., a decreasing
oscillatory behavior is presented.
The different deterministic PCS studied in this work, e.g., Conf1, Conf2, …, Conf6,
are shown in Table 1. It can be observed that in some schemes, e.g., Conf1, Conf4,
Conf5 and Conf6, only one parameter is adapted and the other remains with a fixed
value. In contrast, in the remaining two schemes, e.g., Conf2 and Conf3, both
parameters are controlled by the sinusoidal behavior. Besides, Table 1 also contains the
expected behavior of the six DPCSs, where those values F and CR can take at
14 O. Ramos-Figueroa et al.
The experiments were performed based on the following four variants: (1) DECV
(rand-best) with the feasibility rules, (2) DECV (best-rand) with the feasibility rules,
(3) DECV (rand-best) with the e-constrained method, and (4) DECV (best-rand) with
the e-constrained method. Each one of the six different deterministic PCS (Conf1, …,
Conf6) were added to each one of the four algorithm variants. Therefore, a total of 24
algorithm variants were assessed. Table 2 contains a detailed description of the 24
variants designed.
Table 3. Details of 36 test problems [25], 18 with 10D and 18 with 30D. D is the number of
decision variables, q is the estimated ratio between the feasible region and the search space, I is
the number of inequality constraints, E is the number of equality constraints.
Problem/search Type of Number of constraints q
range objective E I 10D 30D
C01 [0, 10]D Non 0 2 Non separable 0.997689 1.000000
separable
C02 [−5.12, separable 1 separable 2 separable 0.000000 0.000000
5.12]D
C03 [−1000, Non 1 Non separable 0 0.000000 0.000000
1000]D separable
D
C04 [−50, 50] Separable 2 Non separable, 2 0 0.000000 0.000000
separable
C05 [−600, Separable 2 separable 0 0.000000 0.000000
600]D
C06 [−600, Separable 2 rotated 0 0.000000 0.000000
600]D
C07 [−140, Non 0 1 separable 0.505123 0.503725
140]D separable
C08 [−140, Non 0 1 rotated 0.379512 0.375278
140]D separable
C09 [−500, Non 1 separable 0 0.000000 0.000000
500]D separable
C10 [−500, Non 1 rotated 0 0.000000 0.000000
500]D separable
C11 [−100, Rotated 1 Non separable 0 0.000000 0.000000
100]D
C12 [−1000, Separable 1 Non separable 1 separable 0.000000 0.000000
1000]D
C13 [−500, Separable 0 2 separable, 1 non 0.000000 0.000000
500]D separable
C14 [−1000, Non 0 3 separable 0.003112 0.006123
1000]D separable
C15 [−1000, Non 0 3 rotated 0.003210 0.006023
1000]D separable
C16 [−10, 10]D Non 2 separable 1 separable, 1 non 0.000000 0.000000
separable separable
C17 [−10, 10]D Non 1 separable 2 non separable 0.000000 0.000000
separable
C18 [−50, 50]D Non 1 separable 1 separable 0.000010 0.000000
separable
16 O. Ramos-Figueroa et al.
Those parameters which are not part of this study were tuned according to the
suggested values in the specialized literature [10]. Those parameters values for fr-
DECV and e-DECV variants are shown in Tables 4 and 5, respectively.
Table 4. Parameter values used in fr-DECV (rand-best) Conf1, …, Conf6 and fr-DECV (best-
rand) Conf1, …, Conf6 algorithms, “PCV” means percentage to change DE variant, “NP” is the
population size, “MaxEval” is the maximum number of evaluations, “freq” is the oscillation
frequency of sinusoidal functions.
Variant PCV Dimension NP MaxEval freq
rand-best 90% 10D 90 200000 0.5
30D 90 600000 0.5
best-rand 10% 10D 90 200000 0.5
30D 90 600000 0.5
Table 5. Parameter values used in e-DECV (rand-best) Conf1, …, Conf6 and e-DECV (best-
rand) Conf1, …, Conf6 algorithms. “PCV” means percentage to change DE variant, “NP” is the
population size, “MaxEval” is the maximum number of evaluations, “freq” is the oscillation
frequency of sinusoidal functions, “cp” is the descent speed of e tolerance, and “Tc” is the
percentage of iterations considering e.
Variant PCV Dimension NP MaxEval freq cp Tc
rand-best 90% 10D 90 200000 0.5 5 0.2
30D 90 600000 0.5 5 0.2
best-rand 10% 10D 90 200000 0.5 5 0.2
30D 90 600000 0.5 5 0.2
{567}
"Congress alone has the power to coin and issue money, and
President Jackson declared that this power could not be
delegated to corporations or individuals. We therefore demand
that the power to issue notes to circulate as money be taken
from the National banks, and that all paper money shall be
issued directly by the Treasury Department, be redeemable in
coin, and receivable for all debts, public and private.
"We hold that the tariff duties should be levied for purposes
of revenue, such duties to be so adjusted as to operate
equally throughout the country and not discriminate between
class or section, and that taxation should be limited by the
needs of the Government honestly and economically
administered.
"We hold that the most efficient way to protect American labor
is to prevent the importation of foreign pauper labor to
compete with it in the home market, and that the value of the
home market to our American farmers and artisans is greatly
reduced by a vicious monetary system, which depresses the
prices of their products below the cost of production, and
thus deprives them of the means of purchasing the products of
our home manufacture.
"We denounce the profligate waste of the money wrung from the
people by oppressive taxation and the lavish appropriations of
recent Republican Congresses, which have kept taxes high,
while the labor that pays them is unemployed, and the products
of the people's toil are depressed in price till they no
longer repay the cost of production. We demand a return to
that simplicity and economy which best befit a Democratic
Government and a reduction in the number of useless offices,
the salaries of which drain the substance of the people.
{568}
"In the effort to maintain the gold standard the country has,
within the last two years, in a time of profound peace and
plenty, been loaded down with $262,000,000 of additional
interest-bearing debt, under such circumstances as to allow a
syndicate of native and foreign bankers to realize a net
profit of millions on a single deal.
"It stands confessed that the gold standard can only be upheld
by so depleting our paper currency as to force the prices of
our product below the European and even below the Asiatic
level to enable us to sell in foreign markets, thus
aggravating the very evils our people so bitterly complain of,
degrading American labor, and striking at the foundations of
our civilization itself.
{569}
"We denounce the sale of bonds and the increase of the public
interest-bearing bond debt made by the present administration
as unnecessary and without authority of law, and we demand
that no more bonds be issued except by specific act of
Congress.
{570}
"We condemn the frauds by which the land grant to the Pacific
Railroad Companies have, through the connivance of the
Interior Department, robbed multitudes of bona fide settlers
of their homes and miners of their claims, and we demand
legislation by Congress which will enforce the exemption of
mineral land from such grants after as well as before patent.