— We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon’s aspect ratio is supposed to be near
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
Abstract— In this paper we investigate a Self-Adaptive Differential Evolution algorithm (jDE) where F and CR control parameters are self-adapted and a multi-population method wit...
Janez Brest, Ales Zamuda, Borko Boskovic, Mirjam S...
— This paper presents Differential Evolution with Self-adaptation and Local Search for Constrained Multiobjective Optimization algorithm (DECMOSA-SQP), which uses the self-adapta...
Ales Zamuda, Janez Brest, Borko Boskovic, Viljem Z...