Algorithmic issues in computational intelligence optimization : from design to implementation, from implementation to design
The vertiginous technological growth of the last decades has generated a variety
of powerful and complex systems. By embedding within modern hardware devices sophisticated software, they allow the solution of complicated tasks. As side effect, the availability of these heterogeneous technologies results into new
difficult optimization problems to be faced by researchers in the field. In order to overcome the most common algorithmic issues, occurring in such a variety of possible scenarios, this research has gone through cherry-picked case-studies.
A first research study moved from implementation to design considerations.
Implementation limitations, such as memory constraints and real-time requirements, inevitably plague the algorithmic design. Such limitations are typical of embedded systems. In this light, a fast and memory-saving “compact” algorithm was designed to be used within microcontrollers. Three robotic applications were subsequently addressed by means of selected single-solution approaches and the proposed compact algorithm. A new memetic computing approach using a micro-population was also designed to tackle large scale problems.
In a second moment, the opposite approach, from design to implementation,
was employed. As the benefit of metaheuristic optimization is the capability of
tackling black-box systems, 6 novel general-purpose optimizers were designed
according to different working principles. Their validity was thoroughly tested
by means of popular benchmark suites.
Finally, a theoretical study concludes this piece of research. The dynamic
behaviour of population-based optimization algorithms, such as Genetic Algorithm
and Particle Swarm Optimization, was observed. Their general-purpose nature questioned. The presence of an intrinsic structural bias was graphically
displayed and rigorously formalized. It was shown that the bias prevent them
from equally exploring all the areas of the search space, with a particularly deleterious strength in presence of a large population size.
...
Julkaisija
University of JyväskyläISBN
978-951-39-6742-0ISSN Hae Julkaisufoorumista
1456-5390Asiasanat
Metadata
Näytä kaikki kuvailutiedotKokoelmat
- Väitöskirjat [3574]
Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Evolutionary Algorithms and Metaheuristics : Applications in Engineering Design and Optimization
Greiner, David; Periaux, Jacques; Quagliarella, Domenico; Magalhaes-Mendes, Jorge; Galván, Blas (Hindawi Publishing Corporation, 2018) -
Parallel global optimization : structuring populations in differential evolution
Weber, Matthieu (University of Jyväskylä, 2010) -
Simple memetic computing structures for global optimization
Poikolainen, Ilpo (University of Jyväskylä, 2014) -
Handling expensive multiobjective optimization problems with evolutionary algorithms
Chugh, Tinkle (University of Jyväskylä, 2017)Multiobjective optimization problems (MOPs) with a large number of conflicting objectives are often encountered in industry. Moreover, these problem typically involve expensive evaluations (e.g. time consuming simulations ... -
Memory-saving optimization algorithms for systems with limited hardware
Iacca, Giovanni (University of Jyväskylä, 2011)
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.