Professional Documents
Culture Documents
Textbook Applications of Evolutionary Computation 21St International Conference Evoapplications 2018 Parma Italy April 4 6 2018 Proceedings 1St Edition Kevin Sim Ebook All Chapter PDF
Textbook Applications of Evolutionary Computation 21St International Conference Evoapplications 2018 Parma Italy April 4 6 2018 Proceedings 1St Edition Kevin Sim Ebook All Chapter PDF
https://textbookfull.com/product/artificial-life-and-
evolutionary-computation-13th-italian-workshop-wivace-2018-parma-
italy-september-10-12-2018-revised-selected-papers-stefano-
cagnoni/
https://textbookfull.com/product/big-data-cloud-and-applications-
third-international-conference-bdca-2018-kenitra-morocco-
april-4-5-2018-revised-selected-papers-youness-tabii/
https://textbookfull.com/product/reversible-computation-10th-
international-conference-rc-2018-leicester-uk-
september-12-14-2018-proceedings-jarkko-kari/
Dependable Software Engineering Theories Tools and
Applications 4th International Symposium SETTA 2018
Beijing China September 4 6 2018 Proceedings Xinyu Feng
https://textbookfull.com/product/dependable-software-engineering-
theories-tools-and-applications-4th-international-symposium-
setta-2018-beijing-china-september-4-6-2018-proceedings-xinyu-
feng/
https://textbookfull.com/product/swarm-intelligence-11th-
international-conference-ants-2018-rome-italy-
october-29-31-2018-proceedings-marco-dorigo/
https://textbookfull.com/product/product-lifecycle-management-to-
support-industry-4-0-15th-ifip-wg-5-1-international-conference-
plm-2018-turin-italy-july-2-4-2018-proceedings-paolo-chiabert/
https://textbookfull.com/product/discovery-science-21st-
international-conference-ds-2018-limassol-cyprus-
october-29-31-2018-proceedings-larisa-soldatova/
https://textbookfull.com/product/database-and-expert-systems-
applications-29th-international-conference-dexa-2018-regensburg-
germany-september-3-6-2018-proceedings-part-ii-sven-hartmann/
Kevin Sim
Paul Kaufmann et al. (Eds.)
LNCS 10784
Applications of
Evolutionary Computation
21st International Conference, EvoApplications 2018
Parma, Italy, April 4–6, 2018
Proceedings
123
Lecture Notes in Computer Science 10784
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zurich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology Madras, Chennai, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7407
Kevin Sim Paul Kaufmann et al. (Eds.)
•
Applications of
Evolutionary Computation
21st International Conference, EvoApplications 2018
Parma, Italy, April 4–6, 2018
Proceedings
123
Editors
This Springer imprint is published by the registered company Springer International Publishing AG
part of Springer Nature
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Volume Editors
We are grateful to the support provided by SPECIES, the Society for the Promotion
of Evolutionary Computation in Europe and Its Surroundings, and its individual
members (Marc Schoenauer, President; Anna I. Esparcia-Alcázar, Secretary and
Vice-President; Wolfgang Banzhaf, Treasurer) for the coordination and financial
administration.
And last but not least, we express our continued appreciation to Jennifer Willies for
her ongoing support and expertise as one of the founding organizers of Evo* and also
to Anna I Esparcia-Alcázar, from Universitat Politècnica de València, Spain, whose
considerable efforts in managing and coordinating Evo* helped to build our unique,
vibrant, and friendly atmosphere.
EvoApplications Coordinator
Kevin Sim Edinburgh Napier University, UK
Local Chairs
Stefano Cagnoni University of Parma, Italy
Monica Mordonini University of Parma, Italy
Publicity Chair
Pablo García Sánchez University of Cádiz, Spain
EvoBAFIN Chairs
Michael Kampouridis University of Kent, UK
Fernando Otero University of Kent, UK
EvoBIO Chairs
Federico Divina Universidad Pablo de Olavide, Seville, Spain
Jaume Bacardit Newcastle University, UK
EvoCOMNET Chairs
Fabio D’Andreagiovanni CNRS, UTC - Sorbonne University, France
Giovanni Iacca RWTH Aachen University, Germany
EvoCOMPLEX Chairs
Carlos Cotta Universidad de Málaga, Spain
Robert Schaefer AGH University of Science and Technology, Poland
EvoENERGY Chairs
Paul Kaufmann Mainz University, Germany
Oliver Kramer University of Oldenburg, Germany
X Organization
EvoGAMES Chairs
Antonio M. Mora García Universidad Internacional de La Rioja, Spain
Alberto Tonda INRA, France
EvoIASP Chairs
Stefano Cagnoni University of Parma, Italy
Mengjie Zhang Victoria University of Wellington, New Zealand
EvoINDUSTRY Chairs
Kevin Sim Edinburgh Napier University, UK
Neil Urquhart Edinburgh Napier University, UK
EvoKNOW Chairs
Giovanni Iacca RWTH Aachen University, Germany
Gerd Ascheid RWTH Aachen University, Germany
EvoNUM Chair
Anna I. Esparcia-Alcázar Universitat Politècnica de València, Spain
EvoPAR Chairs
Francisco Fernández University of Extremadura, Spain
de Vega
J. Ignacio Hidalgo Universidad Complutense de Madrid, Spain
EvoROBOT Chairs
Kyrre Glette University of Oslo, Norway
Julien Hubert Vrije Universiteit Amsterdam, The Netherlands
EvoSET Chairs
Anna I. Esparcia-Alcázar Universitat Politècnica de València, Spain
Sara Silva Faculdade de Ciências, Universidade de Lisboa,
Portugal
Organization XI
EvoSTOC Chairs
Michalis Mavrovouniotis Nottingham Trent University, UK
Trung Thanh Nguyen Liverpool John Moores University, UK
Program Committees
Bahriye Basturk Akay Erciyes University, Turkey [EvoINDUSTRY]
Jhon Amaya UNET, Venezuela [EvoCOMPLEX]
Jacopo Aleotti University of Parma, Italy [EvoIASP]
Michele Amoretti University of Parma, Italy [EvoIASP]
Anca Andreica Universitatea Babeş-Bolyai, Romania
[EvoCOMPLEX]
Jarosław Arabas Warsaw University of Technology, Poland
[EvoKNOW]
Antonio Fernández Ares Universidad de Granada, Spain [EvoGAMES]
Ignacio Arnaldo PatternEx, USA [EvoPAR]
María Arsuaga-Ríos CERN [EvoINDUSTRY]
Jason Atkin University of Nottingham, UK [EvoINDUSTRY]
Joshua Auerbach Champlain College, USA [EvoROBOT]
Lucia Ballerini University of Edinburgh, UK [EvoIASP]
Tiago Baptista Universidade de Coimbra, Portugal [EvoCOMPLEX]
Thomas Bauschert Technical University Chemnitz, Germany
[EvoCOMNET]
Vitoantonio Bevilacqua Politecnico di Bari, Italy [EvoIASP]
Hans-Georg Beyer Vorarlberg University of Applied Sciences, Austria
[EvoNUM]
Leonardo Bocchi University of Florence, Italy [EvoIASP]
János Botzheim Tokyo Metropolitan University, Japan [EvoKNOW]
Juergen Branke University of Warwick, UK [EvoSTOC]
Nicolas Bredeche Institut des Systèmes Intelligents et de Robotique,
France [EvoROBOT]
Jörg Bremer University of Oldenburg, Germany [EvoENERGY]
Cédric Buche ENIB, France [EvoGAMES]
Doina Bucur University of Twente, The Netherlands [EvoCOMNET,
EvoKNOW]
Aleksander Byrski AGH University of Science and Technology, Poland
[EvoCOMPLEX]
Raúl Lara Cabrera Universidad Autónoma de Madrid, Spain
[EvoGAMES]
David Camacho Universidad Autónoma de Madrid, Spain
[EvoGAMES]
Fabio Caraffini De Montfort University, UK [EvoKNOW]
Hui Cheng Liverpool John Moores University, UK [EvoSTOC]
Luca Chiaraviglio University of Rome Tor Vergata, Italy [EvoCOMNET]
Francisco Chicano Universidad de Málaga, Spain [EvoSET]
XII Organization
EvoBAFIN
EvoBIO
EvoCOMNET
EvoCOMPLEX
EvoENERGY
EvoGAMES
EvoIASP
Can the Relevance Index be Used to Evolve Relevant Feature Sets? . . . . . . . 472
Laura Sani, Riccardo Pecori, Emilio Vicari, Michele Amoretti,
Monica Mordonini, and Stefano Cagnoni
EvoINDUSTRY
EvoKNOW
EvoNUM
EvoPAR
EvoROBOT
EvoSET
EvoSTOC
General
1 Introduction
problem size up to 2196 variables. Lastly, its performance was benchmarked with that
of the SPEA-II [10] and MOPSO [11].
This paper is organized as follows. The detailed developments of the MOCCA with
dynamic species-size strategy are described in Sect. 2. Section 3 discusses and for-
mulates the portfolio optimization problem. The experimented results are reported in
Sect. 4 and conclusion is given in Sect. 5.
Although the prominent ability of CCA to divide the problem into smaller search space
and to increase the influences of the evolutionary operators on these smaller subcom-
ponents is widely recognized, CCA with static decomposition strategy is inapplicable
for solving a non-separable problem. With the presence of interrelation between vari-
ables, the use of dynamic decomposition strategy that allows CCA to adjust species-size
and species member during the algorithm runs could be the efficient way to handle this
type of problem [8]. Li and Yao [9] demonstrated that by changing species-size fre-
quently (the so-called “grouping size” in their work), the probability that two interacting
variables will be placed into the same subcomponent significantly increases.
In the literature, two dynamic problem decomposition schemes based upon
dynamic species-size strategy were proposed. Firstly, in Yang et al. [7], a set of
potential species-size is subjectively identified. Then, at the beginning of generation,
species-size is randomly selected from this potential set based upon probabilities. The
higher probability will be rewarded to a species-size having better past performance.
Thus, species-size that works well is more likely to be used in the next generation.
Secondly, Li and Yao [9] adjusted species-size by comparing the fitness values before
and after each generation run. If the fitness value is greater than the previous run, the
next generation run will be executed using the same species-size. In contrast, if fitness
value turns worse, species-size will be changed by randomly choosing a new
specie-size from pre-determined set of species-size. The common idea of these two
schemes is to allow species-size that performs well to be used for the next generation
run. The criterion for changing species-size is straightforward since the term “better” or
“worse” can be objectively compared by scalar value. In the other words, the existing
dynamic problem decomposition strategies were designed for solving SOOP.
first species until it is fully filled. Then, allocation process moves on to the second
species and so forth. It should be noted that number of variables assigned to the last
species may not equal to that of other previous species if fraction from the division of
N=SS exists. The managing rule for this case is that if the remainder is equal or greater
than half of species-size; all residual variables will be allocated to the next species,
otherwise they will be combined with the previous species.
For example, a set of number of species (NS) for a problem having 100 variables is
defined as NS = 100 {1, 2, 4, 8, 16, 32, 64} = {100, 50, 25, 13, 6, 3, 1}. Considering
the case that the chosen SS is 8, thus NS is 12.5. By allocating 8 variables to each of the
first 12 species, the remaining variables are 4 which equal to half of species-size.
Therefore, algorithm assigns them to the 13th species. In contrast, if the selected SS is 16,
the computed NS is 6.25. By appointing 16 variables to each of the first 6 species, the
remainder is 4 which is smaller than half of species-size. Therefore, algorithm combines
them with the 6th species. The aim of the proposed procedure described above is to
provide the diversity of species-size ranging from largest to smallest size. Although a set
of SS is still needed to be supplied, it is identified based on simple rule and does not
require sophisticated setting from user. It can be thought of that CCA that adopts the
largest species-size from SS is analogous to the traditional multi-objective optimization
algorithms whose solutions are represented by only one species containing all decision
variables. Whereas, the classical CCA adopts the smallest species-size, i.e. SS = 1.
where CðAi ; Ai1 Þ is coverage ratio of solution set Ai over solution set Ai1 while
C ðAi1 ; Ai Þ is the reverse value of C ðAi ; Ai1 Þ. The solution coverage, C, which is
used for comparing any two sets of solutions, is mathematically expressed as:
where ai ai1 means that solution ai covers, i.e. dominates solution ai1 and
C ðAi ; Ai1 Þ 2 ½0; 1. In the case that C ðAi ; Ai1 Þ ¼ 1, all solutions in set Ai1 are
dominated by solutions in set Ai . In contrast, C ðAi ; Ai1 Þ ¼ 0 represents the situation
that none of solutions in set Ai1 are covered by those of set Ai . From this sense,
C ðAi ; Ai1 Þ [ C ðAi1 ; Ai Þ implies that solutions set of the current iteration is better
than that of the previous iteration. Whereas, CðAi ; Ai1 Þ C ðAi1 ; Ai Þ indicates
solutions convergence condition that activates algorithm to change species-size.
…
…
…
…
x1,P x2,P x3,P x4,P Collaborators x1,P x2,P x3,P x4,P x1,AP x2,AP x3,AP x4,AP
Evaluated Evaluated
…
…
(a) Collaborator selection method for (b) New collaborator selection scheme for
single-objective optimization problem multi-objective optimization problem
— »Niin, mutta lapseni», sanoi hän, »et saa alati miettiä tuota yhtä
ja samaa.»
*****
Kun Samuel Stern ei enää jatkanut, kysyi Thora: — Eikö ollut vielä
muutakin?
*****
— »Äiti, olen niin iloinen, kun saan kuulla äänesi on niin tyhjää,
kun et enää ole täällä — on niin tyhjää, kun en tiedä palaatko sinä
pian jälleen!» Sitten oli kuin olisin käynyt hänen haudallansa, ja hän
saattoi minua kotiin. »Älä sure», sanoi hän. »Etkö tunne, että minä
olen luonasi?» — — —
*****
— Äiti sanoi aina: »Ei saa väsyä!» Hän ei väsynyt koskaan. Sillä
hän vei meidät harhaan, meidät ajattelemattomat ja heikot olennot —
siinä määrin, että me luulimme hänen olevan jotain hyvää, joka ei
koskaan loppuisi. Niin, hän petti minut siinä määrin, että minä
sydämeni sanomattomassa yksinkertaisuudessa luulin, että hän oli
kuolematon… Kuuluu uskomattomalta, mutta kun muut vanhat
ihmiset kuolivat, niin minusta se oli paikallaan — mutta äitiin ei
kuoleman ollut kajoominen, se ei saanut lähestyä häntä.— — —
*****
*****
20.
Hänen täytyi melkein nauraa. Vasta nyt hän näet eräänä päivänä
huomasi, ettei Sjurilla ollut juuri mitään vaatteita.
Nyt ei hänellä enää ollut aikaa pitkiin kävelyretkiin. Hän alkoi kutoa
sukkia ja neuloa paitoja. Hän huomasi että sekin oli hyödyksi hänelle
itsellensä.
Eräänä päivänä, kun Thora istui ulkona töineen, tuli Samuel Stern
hänen luoksensa.
Ensi kerralla tuntui Thorasta tosin hiukan oudolta että joku muu oli
mukana. Mutta pian hän tottui siihen. Heistä molemmista alkoi se jo
tuntua aivan luonnolliselta.
Nyt oli kai Samuel Stern täydelleen antanut hänelle anteeksi. Hän
turvautui lohdullisena tuohon ajatukseen. Lady Hammondkin muiden
muassa oli huomannut että lordi Stern, kuten hän häntä nimitti, oli
käynyt suopeammaksi muille eikä ollut enää niin ärtyisä kuin ennen.
Mutta sitä ei Marit Hennerud voinut huomata. Hän piti hänestä niin
hellää huolta, kuin olisi ollut hänen äitinsä, ja juhlallisemmin ei liesi
ollut loimunnut vielä koskaan.
Sitten hän lisäsi hiljaa: Luulen että opin hiukan joka päivä —
teidän äidistänne!
*****
Hän meni nummelle sille paikalle missä Samuel Stern oli istunut
äitinsä kanssa.
Mieluummin hän kuunteli joen ääntä! Sillä oli luja tahtonsa, mutta
se ei ollut enää niin kiihkeä. Mitä se keväällä oli sanonut
hillittömyydessään, sen oli se jo unohtanut — — —
21.
Sitten hän jatkoi: — Halusin sanoa teille jotain. Nyt luulen voivani
tehdä sen. Mehän olemme ystävät — eikö niin?
— Oli aika, jolloin olisin tahtonut vihata sinua. Nyt olen ehtinyt
edemmäksi — olen onnellinen siitä, että rakkauteni on niin suuri. En
sano: »Jää luokseni, sillä päivä ehtii ehtooseen, jää luokseni,
valokseni, kun suuri pimeys tulee.» Ei, minä sanon: »Mene! Mene
luotani! Tahdon rukoilla että jotain hyvää tulee osaksesi!»
Hänen äänensä sointi oli käynyt lempeäksi. Thorasta oli, kuin olisi
vuolas virta hellyyttä tulvehtinut häntä vastaan.
Thora oli istunut pää alas painuneena. Nyt loi hän katseensa ylös,
ja se kuvasti tuskaa, hänen puhuessaan värähtelevin äänin: