This thesis investigates two distinct but related optimization problems: bilevel and minmax problems, in the context of evolutionary algorithms (EAs). Bilevel optimization involves hierarchical decision-making, where decisions at the upper level are subject to constraints defined by the solutions of an optimization problem at the lower level. These problems are …
Despite the large volume of recently published papers in the field of constrained multiobjective optimization, the understanding and characterization of constrained multiobjective optimization problems (CMOPs) for benchmarking multiobjective evolutionary algorithms (MOEAs) and the related constraint handling techniques (CHTs) remain unsatisfactory. Therefore, selecting appropriate CMOPs for benchmarking is challenging and lacks …
In optimization, it is well known that algorithm performance is dependent on the problem being solved. As a consequence of this, achieving good optimization results requires correctly matching an optimization problem to a specific optimization algorithm that performs well on that problem. For this to be possible, knowledge of both …
Solving real-life optimization problems numerically is often very time demanding, because of high complexity of the simulations that are usually involved. Solving such problems becomes highly impractical for this reason and can even lead to use of less complex and also less accurate models. Fortunately, evolutionary algorithms, often used in …
Developing metaheuristics to solve optimization problems is a rapidly growing field of research. This is due to the importance of optimization problems in the scientific as well as the industrial world. The methods developed in this dissertation are based on stigmergy: a method of communication in emergent systems, where the …