Multiobjective Search Algorithm with Subdivision Technique

  • Authors:
  • Johannes Jahn

  • Affiliations:
  • Angewandte Mathematik II, Universität Erlangen-Nürnberg, Erlangen, Germany D-91058

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a multiobjective search algorithm with subdivision technique (MOSAST) for the global solution of multiobjective constrained optimization problems with possibly noncontinuous objective or constraint functions. This method is based on a random search method and a new version of the Graef-Younes algorithm and it uses a subdivision technique. Numerical results are given for bicriterial test problems.