multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...

Abstract Single-objective continuous optimization can be challenging, especially when dealing with multimodal problems. This work sheds light on the effects that multi-objective may have in single-objective space. For this purpose, we examine inner mechanisms of recently developed sophisticated local search procedure SOMOGSA. method solves problems based first expanding problem an additional ob...