Multiobjective Search Algorithm with Subdivision Technique |
| |
| Authors: | Johannes Jahn |
| |
| Institution: | 1. Angewandte Mathematik II, Universit?t Erlangen-Nürnberg, Martensstr. 3, D-91058, Erlangen, Germany
|
| |
| 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. |
| |
| Keywords: | global optimization vector optimization random search |
| 本文献已被 SpringerLink 等数据库收录！ |
