scispace - formally typeset
S

Sanaz Mostaghim

Researcher at Otto-von-Guericke University Magdeburg

Publications -  195
Citations -  3718

Sanaz Mostaghim is an academic researcher from Otto-von-Guericke University Magdeburg. The author has contributed to research in topics: Evolutionary algorithm & Multi-objective optimization. The author has an hindex of 27, co-authored 168 publications receiving 3113 citations. Previous affiliations of Sanaz Mostaghim include University of Paderborn & Queen Mary University of London.

Papers
More filters
Proceedings ArticleDOI

Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO)

TL;DR: The Sigma method is introduced as a new method for finding best local guides for each particle of the population from a set of Pareto-optimal solutions and the results are compared with the results of a multi-objective evolutionary algorithm (MOEA).
Journal ArticleDOI

A Framework for Large-Scale Multiobjective Optimization Based on Problem Transformation

TL;DR: The proposed method called weighted optimization framework is intended to serve as a generic method that can be used with any population-based metaheuristic algorithm and can significantly outperform most existing methods in terms of solution quality as well as convergence rate.
Book ChapterDOI

Heatmap visualization of population based multi objective algorithms

TL;DR: This work proposes a new method, based on heatmaps, for the simultaneous visualization of objective and parameter spaces, and demonstrates its application on a simple 3D test function and applies heatmaps to the analysis of real-world optimization problems.
Book

Computational Intelligence: A Methodological Introduction

TL;DR: This clearly-structured, classroom-tested textbook/reference presents a methodical introduction to the field of CI, providing an authoritative insight into all that is necessary for the successful application of CI methods.
Journal ArticleDOI

Experimental Analysis of Bound Handling Techniques in Particle Swarm Optimization

TL;DR: This paper proposes and compares a wide variety of bound handling techniques for particle swarm optimization and demonstrates that the bound handling technique can have a major impact on the algorithm performance, and that the method recently proposed as the standard does not, in general, perform well.