The 14 revised full papers presented were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics to their accurate design and application to both single- and multi-objective combinatorial optimization problems. Fundamental and methodological aspects deal with runtime analysis, the structural properties of fitness landscapes, the study of metaheuristics core components, the clever design of their search principles, and their careful selection and configuration. Applications cover domains such as scheduling, routing, partitioning and general graph problems. weiterlesen