Using evolutionary algorithms when solving multi-objective optimization problems (MOPs) has shown remarkable results during the last decade. As a con solidated research area it counts with a number of guidelines and processes; even though, their efficiency is still a big issue which lets room for improvements. In this chapter we explore the use of gradient-based information to increase efficiency on evolutionary methods, when dealing with smooth real-valued MOPs. We show the main aspects to be considered when building local search operators using the objec tive function gradients, and when coupling them with evolutionary algorithms. We present an overview of our current methods with discussion about their convenience for particular kinds of problems.
展开▼
