Self organizing migrating algorithm with quadratic interpolation for solving large scale global optimization problems

Dipti Singh

doi:10.1016/j.asoc.2015.09.033

Return

Self organizing migrating algorithm with quadratic interpolation for solving large scale global optimization problems

2016-01-01

PRE

Dipti Singh

Seema Agrawal *

DOI：10.1016/j.asoc.2015.09.033

Original

Original request for help

Save

Abstract

En 中文

Generally the complexity of the large scale optimization problem is considered to increase as the size or dimension of the problem increases and to solve these problems; more efficient and robust algorithms are needed. Several experiments have shown that an increment in dimensions of the problem not only requires an increment in population size but increases the computational cost also. In this paper a Self Organizing Migrating Algorithm with Quadratic Interpolation (SOMAQI) has been extended to solve large scale global optimization problems for dimensions ranging from 100 to 3000 with a constant population size of 10 only. It produces high quality optimal solution with very low computational cost and converges very fast to optimal solution. (C) 2015 Elsevier B.V. All rights reserved.

Keywords:

Self organizing migrating algorithm

Quadratic interpolation

Large scale global optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.