scispace - formally typeset
Search or ask a question
Topic

Multi-swarm optimization

About: Multi-swarm optimization is a research topic. Over the lifetime, 19162 publications have been published within this topic receiving 549725 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is argued that cardinal rather than cardinal optimization, i.e., concentrating on finding good, better, or best designs rather than on estimating accurately the performance value of these designs, offers a new, efficient, and complementary approach to the performance optimization of systems.
Abstract: In this paper we argue thatordinal rather thancardinal optimization, i.e., concentrating on finding good, better, or best designs rather than on estimating accurately the performance value of these designs, offers a new, efficient, and complementary approach to the performance optimization of systems. Some experimental and analytical evidence is offered to substantiate this claim. The main purpose of the paper is to call attention to a novel and promising approach to system optimization.

412 citations

Journal ArticleDOI
TL;DR: This paper presents Linear/Nonlinear Programming (LP/NLP) formulations of these problems followed by two proposed algorithms for the same based on particle swarm optimization (PSO) followed by results compared with the existing algorithms to demonstrate their superiority.

411 citations

Journal ArticleDOI
TL;DR: A procedure is proposed for simultaneously handling the problem of optimal heat integration while performing the optimization of process flow sheets so as to insure that the minimum utility target for heat recovery networks is featured.
Abstract: A procedure is proposed for simultaneously handling the problem of optimal heat integration while performing the optimization of process flow sheets. The method is based on including a set of constraints into the nonlinear process optimization problem so as to insure that the minimum utility target for heat recovery networks is featured. These heat integration constraints, which do not require temperature intervals for their definition, are based on a proposed representation for locating pinch points that can vary according to every set of process stream conditions (flow rates and temperatures) selected in the optimization path. The underlying mathematical formulations correspond to nondifferentiable optimization problems, and an efficient smooth approximation method is proposed for their solution. An example problem on a chemical process is presented to illustrate the economic savings that can be obtained with the proposed simultaneous approach. The method reduces to simple models for the case of fixed flow rates and temperatures.

409 citations

Book ChapterDOI
04 Oct 2009
TL;DR: The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks and some suggestions for extending the simple scheme of the technique under consideration are presented.
Abstract: The paper provides an insight into the improved novel metaheuristics of the Firefly Algorithm for constrained continuous optimization tasks. The presented technique is inspired by social behavior of fireflies and the phenomenon of bioluminescent communication. The first part of the paper is devoted to the detailed description of the existing algorithm. Then some suggestions for extending the simple scheme of the technique under consideration are presented. Subsequent sections concentrate on the performed experimental parameter studies and a comparison with existing Particle Swarm Optimization strategy based on existing benchmark instances. Finally some concluding remarks on possible algorithm extensions are given, as well as some properties of the presented approach and comments on its performance in the constrained continuous optimization tasks.

407 citations

Journal ArticleDOI
01 Mar 2010
TL;DR: It is found that not only the PSO method and its simplified variant have comparable performance for optimizing a number of Artificial Neural Network problems, but also the simplified variant appears to offer a small improvement in some cases.
Abstract: The general purpose optimization method known as Particle Swarm Optimization (PSO) has received much attention in past years, with many attempts to find the variant that performs best on a wide variety of optimization problems. The focus of past research has been with making the PSO method more complex, as this is frequently believed to increase its adaptability to other optimization problems. This study takes the opposite approach and simplifies the PSO method. To compare the efficacy of the original PSO and the simplified variant here, an easy technique is presented for efficiently tuning their behavioural parameters. The technique works by employing an overlaid meta-optimizer, which is capable of simultaneously tuning parameters with regard to multiple optimization problems, whereas previous approaches to meta-optimization have tuned behavioural parameters to work well on just a single optimization problem. It is then found that not only the PSO method and its simplified variant have comparable performance for optimizing a number of Artificial Neural Network problems, but also the simplified variant appears to offer a small improvement in some cases.

406 citations


Network Information
Related Topics (5)
Fuzzy logic
151.2K papers, 2.3M citations
88% related
Optimization problem
96.4K papers, 2.1M citations
87% related
Support vector machine
73.6K papers, 1.7M citations
86% related
Artificial neural network
207K papers, 4.5M citations
85% related
Robustness (computer science)
94.7K papers, 1.6M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023183
2022471
202110
20207
201926
2018171