Chairperson: Carlos Cotta Porras. Co-chair: Antonio J. Fernández Leiva

Combinatorial optimization is ubiquitous and comprises an enormous range of practical applications. Problems arising in this area are typically hard to solve: the associated search spaces are huge, and there usually exist strong complexity barriers for finding provably good solutions. The use of metaheuristics, in particular evolutionary algorithms (EAs), is commonly in order in this domain. The deployment of EAs on this kind of problems is not trivial though, since these can be highly constrained, exhibit dynamical features, feature multiple partially conflicting objectives, etc.

This session is aimed to bring together researchers in the field of evolutionary algorithms, and tries to provide an updated perspective on solving complex combinatorial problems, both from theoretical and practical standpoints.