About: Unconventional initialization methods for differential evolution

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Unconventional initialization methods for differential evolution Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The crucial role played by the initial population in a population-based heuristic optimization cannot be neglected. It not only affects the search for several iterations but often also has an influence on the final solution. If the initial population itself has some knowledge about the potential regions of the search domain then it is quite likely to accelerate the rate of convergence of the optimization algorithm. In the present study we propose two schemes for generating the initial population of differential evolution (DE) algorithm. These schemes are based on quadratic interpolation (QI) and nonlinear simplex method (NSM) in conjugation with computer generated random numbers. The idea is to construct a population that is biased towards the optimum solution right from the very beginning of the algorithm. The corresponding algorithms named as QIDE (using quadratic interpolation) and NSDE (using non linear simplex method), are tested on a set of 20 traditional benchmark problems with box constraints and 7 shifted (non-traditional) functions taken from literature. Comparison of numerical results with traditional DE and opposition based DE (ODE) show that the proposed schemes considered by us for generating the random numbers significantly improves the performance of DE in terms of convergence rate and average CPU time. 2012 Elsevier Inc. All rights reserved. The crucial role played by the initial population in a population-based heuristic optimization cannot be neglected. It not only affects the search for several iterations but often also has an influence on the final solution. If the initial population itself has some knowledge about the potential regions of the search domain then it is quite likely to accelerate the rate of convergence of the optimization algorithm. In the present study we propose two schemes for generating the initial population of differential evolution (DE) algorithm. These schemes are based on quadratic interpolation (QI) and nonlinear simplex method (NSM) in conjugation with computer generated random numbers. The idea is to construct a population that is biased towards the optimum solution right from the very beginning of the algorithm. The corresponding algorithms named as QIDE (using quadratic interpolation) and NSDE (using non linear simplex method), are tested on a set of 20 traditional benchmark problems with box constraints and 7 shifted (non-traditional) functions taken from literature. Comparison of numerical results with traditional DE and opposition based DE (ODE) show that the proposed schemes considered by us for generating the random numbers significantly improves the performance of DE in terms of convergence rate and average CPU time. 2012 Elsevier Inc. All rights reserved. (en)
Title	Unconventional initialization methods for differential evolution Unconventional initialization methods for differential evolution (en)
skos:prefLabel	Unconventional initialization methods for differential evolution Unconventional initialization methods for differential evolution (en)
skos:notation	RIV/61989100:27240/13:86092931!RIV15-MSM-27240___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...iv/cisloPeriodika	9
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Abraham Padath, Ajith
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	112559
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/13:86092931
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Stochastic optimization; Random numbers; Quadratic interpolation; Nonlinear simplex method; Initial population; Differential evolution (en)
http://linked.open.../riv/klicoveSlovo	Differential evolution Stochastic optimization Initial population Nonlinear simplex method Quadratic interpolation Random numbers
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[9437C449BC33]
http://linked.open...i/riv/nazevZdroje	APPLIED MATHEMATICS AND COMPUTATION
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	219
http://linked.open...iv/tvurceVysledku	Abraham Padath, Ajith Pant, M. Ali, M.
http://linked.open...ain/vavai/riv/wos	000312366700030
issn	0096-3003
number of pages	21 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.amc.2012.10.053
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software