no code implementations • 18 Mar 2021 • Dogan Corus, Andrei Lissovoi, Pietro S. Oliveto, Carsten Witt
On the other hand, we prove that selecting the worst individual as parent leads to efficient global optimisation with overwhelming probability for reasonable population sizes.
no code implementations • 27 Mar 2019 • Dogan Corus, Pietro S. Oliveto, Donya Yazdani
In this paper we prove that considerable speed-ups in the exploitation phase may be achieved with dynamic inversely proportional mutation potentials (IPM) and argue that the potential should decrease inversely to the distance to the optimum rather than to the difference in fitness.
no code implementations • 26 Mar 2019 • Dogan Corus, Pietro S. Oliveto
It is generally accepted that populations are useful for the global exploration of multi-modal optimisation problems.
no code implementations • 1 Jun 2018 • Dogan Corus, Pietro S. Oliveto, Donya Yazdani
Various studies have shown that characteristic Artificial Immune System (AIS) operators such as hypermutations and ageing can be very efficient at escaping local optima of multimodal optimisation problems.
no code implementations • 1 Jun 2018 • Dogan Corus, Pietro S. Oliveto, Donya Yazdani
In this paper we perform an analysis for the standard NP-hard \partition problem from combinatorial optimisation and rigorously show that hypermutations and ageing allow AISs to efficiently escape from local optima where standard EAs require exponential time.
no code implementations • 4 Apr 2018 • Dogan Corus, Pietro S. Oliveto, Donya Yazdani
Unless the stop at first constructive mutation (FCM) mechanism is applied, we show that hypermutations require exponential expected runtime to optimise any function with a polynomial number of optima.
no code implementations • 4 Aug 2017 • Dogan Corus, Pietro S. Oliveto
We present a lower bound for a greedy (2+1) GA that matches the upper bound for populations larger than 2, rigorously proving that 2 individuals cannot outperform larger population sizes under greedy selection and greedy crossover up to lower order terms.
no code implementations • 29 Jul 2014 • Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre
Finally, we prove that the theorem is nearly optimal for the processes considered.
no code implementations • 9 Jan 2014 • Dogan Corus, Per Kristian Lehre, Frank Neumann, Mojgan Pourhassan
For the generalised minimum spanning tree problem, we analyse the two approaches presented by Hu and Raidl (2012) with respect to the number of clusters that distinguish each other by the chosen representation of possible solutions.