2012
DOI: 10.1016/j.cpc.2012.01.010
|View full text |Cite
|
Sign up to set email alerts
|

MEMPSODE: A global optimization software based on hybridization of population-based algorithms and local searches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0
1

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 33 publications
(10 citation statements)
references
References 36 publications
0
9
0
1
Order By: Relevance
“…The one above is easy to implement and resulted very good performance in [13] and in [14,30,31]. The general procedure of the hybrid algorithm discussed in our study is given in Algorithm 2.…”
Section: Hybrid Frameworkmentioning
confidence: 99%
See 1 more Smart Citation
“…The one above is easy to implement and resulted very good performance in [13] and in [14,30,31]. The general procedure of the hybrid algorithm discussed in our study is given in Algorithm 2.…”
Section: Hybrid Frameworkmentioning
confidence: 99%
“…The algorithm under study falls into the category of memetic algorithms and combines a Particle Swarm Optimization (PSO) variant [11] (global component) with Multidimensional Search (MDS) [12] (local component). The efficiency of this hybridization scheme was demonstrated in [13,14]. We decided to incorporate MDS since it is suitable for discontinuous functions and a perfect candidate for parallelization.…”
Section: Introductionmentioning
confidence: 99%
“…In this section we will present the adaptive modification to the original MEMPSODE algorithm [17,15]. The original algorithm is extended by having multiple local searches that are stochastically selected following an adaptive scheme.…”
Section: Adaptive Mempsode Algorithmmentioning
confidence: 99%
“…The present work extends MEMPSODE optimization software [17] by allowing adaptive selection of local searches. MEMSPODE software combines Unified Particle Swarm Optimization (UPSO) [14] algorithm with local search algorithms provided by the Merlin optimization environment [13].…”
Section: Introductionmentioning
confidence: 99%
“…Usually, two of the unknown variables are first optiBrought to you by | University of Calgary Authenticated Download Date | 5/27/15 6:24 AM mized, and then the remaining ones [4,13]. Various inversion algorithms are used, among them some based on neural networks (PSO [16]), while sampling algorithms (for instance the Monte-Carlo method [14]) are used to identify grid points or points in a continuous space which also minimize mismatch between observations and model predictions based on different norms. At a second step, it is investigated whether the selected solution is stable (i.e.…”
Section: Introductionmentioning
confidence: 99%