A simple, non-generational genetic algorithm based on moving averages for multiobjective optimization

  • Authors:
  • Josí A. Ramírez-Ruíz;Luis M. Fernéndez-Carrasco;Manuel Valenzuela-Rendón;Eduardo Uresti-Charre

  • Affiliations:
  • Tecnológico de Monterrey, Center for Intelligent Computing and Robotics, Monterrey, México;Tecnológico de Monterrey, Center for Intelligent Computing and Robotics, Monterrey, México;Tecnológico de Monterrey, Center for Intelligent Computing and Robotics, Monterrey, México;Tecnológico de Monterrey, Center for Intelligent Computing and Robotics, Monterrey, México

  • Venue:
  • EC'09 Proceedings of the 10th WSEAS international conference on evolutionary computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a new non-generational genetic algorithm for multiobjective optimization. The novelty in this approach is the use of a moving average to evaluate two things: the number of dominated individuals and the sharing function. Moreover, the proposed solution does less number of comparisons when compared with similar techniques and approaches. This solution has been evaluated on three different problems that are found in the literature and compared to other approaches to tackle them. The results that one sees point to the idea that the proposed algorithm is a feasible and simpler way to deal with multiobjective problems.