Parameter-less algorithm for evolutionary-based optimization
The development of a simple, adaptive, parameter-less search algorithm was initiated by the need for an algorithm that is able to find optimal solutions relatively quick, and without the need for a control-parameter-setting specialist. Its control parameters are calculated during the optimization process, according to the progress of the search. The algorithm is intended for continuous and combinatorial problems. The efficiency of the proposed parameter-less algorithm was evaluated using one theoretical and three real-world industrial optimization problems. A comparison with other evolutionary approaches shows that the presented adaptive parameter-less algorithm has a competitive convergence with regards to the comparable algorithms. Also, it proves algorithm’s ability to finding the optimal solutions without the need for predefined control parameters. Copyright Springer Science+Business Media New York 2013
Year of publication: |
2013
|
---|---|
Authors: | Papa, Gregor |
Published in: |
Computational Optimization and Applications. - Springer. - Vol. 56.2013, 1, p. 209-229
|
Publisher: |
Springer |
Subject: | Optimization | Evolutionary | Adaptive | Parameter-less | Continuous | Combinatorial |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Introduction of Electronic Combinatorial Auction to a Food Manufacturer
Harris, Keith D., (2014)
-
A survey of adaptive large neighborhood search algorithms and applications
Windras Mara, Setyo Tri, (2022)
-
Simple Daily Dynamic Adaptive Operation Rules for WaterResources Optimization
Şen, Zekai, (2000)
- More ...