Particle swarm optimisation for dynamic optimisation problems: a review
Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Rezaee Jordehi, Ahmad [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Natural Computing Applications Forum 2014 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Neural computing & applications - Springer London, 1993, 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2014 ; number:7-8 ; day:24 ; month:07 ; pages:1507-1516 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00521-014-1661-6 |
|---|
| Katalog-ID: |
OLC2025595468 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2025595468 | ||
| 003 | DE-627 | ||
| 005 | 20230502114612.0 | ||
| 007 | tu | ||
| 008 | 200820s2014 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00521-014-1661-6 |2 doi | |
| 035 | |a (DE-627)OLC2025595468 | ||
| 035 | |a (DE-He213)s00521-014-1661-6-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Rezaee Jordehi, Ahmad |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Particle swarm optimisation for dynamic optimisation problems: a review |
| 264 | 1 | |c 2014 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Natural Computing Applications Forum 2014 | ||
| 520 | |a Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. | ||
| 650 | 4 | |a Particle swarm optimisation | |
| 650 | 4 | |a Optimisation | |
| 650 | 4 | |a Dynamic optimisation problem | |
| 773 | 0 | 8 | |i Enthalten in |t Neural computing & applications |d Springer London, 1993 |g 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 |w (DE-627)165669608 |w (DE-600)1136944-9 |w (DE-576)032873050 |x 0941-0643 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2014 |g number:7-8 |g day:24 |g month:07 |g pages:1507-1516 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00521-014-1661-6 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4046 | ||
| 912 | |a GBV_ILN_4277 | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2014 |e 7-8 |b 24 |c 07 |h 1507-1516 | ||
| author_variant |
j a r ja jar |
|---|---|
| matchkey_str |
article:09410643:2014----::atcewrotmstofryaiotmst |
| hierarchy_sort_str |
2014 |
| publishDate |
2014 |
| allfields |
10.1007/s00521-014-1661-6 doi (DE-627)OLC2025595468 (DE-He213)s00521-014-1661-6-p DE-627 ger DE-627 rakwb eng 004 VZ Rezaee Jordehi, Ahmad verfasserin aut Particle swarm optimisation for dynamic optimisation problems: a review 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Natural Computing Applications Forum 2014 Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. Particle swarm optimisation Optimisation Dynamic optimisation problem Enthalten in Neural computing & applications Springer London, 1993 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:25 year:2014 number:7-8 day:24 month:07 pages:1507-1516 https://doi.org/10.1007/s00521-014-1661-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4046 GBV_ILN_4277 AR 25 2014 7-8 24 07 1507-1516 |
| spelling |
10.1007/s00521-014-1661-6 doi (DE-627)OLC2025595468 (DE-He213)s00521-014-1661-6-p DE-627 ger DE-627 rakwb eng 004 VZ Rezaee Jordehi, Ahmad verfasserin aut Particle swarm optimisation for dynamic optimisation problems: a review 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Natural Computing Applications Forum 2014 Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. Particle swarm optimisation Optimisation Dynamic optimisation problem Enthalten in Neural computing & applications Springer London, 1993 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:25 year:2014 number:7-8 day:24 month:07 pages:1507-1516 https://doi.org/10.1007/s00521-014-1661-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4046 GBV_ILN_4277 AR 25 2014 7-8 24 07 1507-1516 |
| allfields_unstemmed |
10.1007/s00521-014-1661-6 doi (DE-627)OLC2025595468 (DE-He213)s00521-014-1661-6-p DE-627 ger DE-627 rakwb eng 004 VZ Rezaee Jordehi, Ahmad verfasserin aut Particle swarm optimisation for dynamic optimisation problems: a review 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Natural Computing Applications Forum 2014 Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. Particle swarm optimisation Optimisation Dynamic optimisation problem Enthalten in Neural computing & applications Springer London, 1993 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:25 year:2014 number:7-8 day:24 month:07 pages:1507-1516 https://doi.org/10.1007/s00521-014-1661-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4046 GBV_ILN_4277 AR 25 2014 7-8 24 07 1507-1516 |
| allfieldsGer |
10.1007/s00521-014-1661-6 doi (DE-627)OLC2025595468 (DE-He213)s00521-014-1661-6-p DE-627 ger DE-627 rakwb eng 004 VZ Rezaee Jordehi, Ahmad verfasserin aut Particle swarm optimisation for dynamic optimisation problems: a review 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Natural Computing Applications Forum 2014 Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. Particle swarm optimisation Optimisation Dynamic optimisation problem Enthalten in Neural computing & applications Springer London, 1993 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:25 year:2014 number:7-8 day:24 month:07 pages:1507-1516 https://doi.org/10.1007/s00521-014-1661-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4046 GBV_ILN_4277 AR 25 2014 7-8 24 07 1507-1516 |
| allfieldsSound |
10.1007/s00521-014-1661-6 doi (DE-627)OLC2025595468 (DE-He213)s00521-014-1661-6-p DE-627 ger DE-627 rakwb eng 004 VZ Rezaee Jordehi, Ahmad verfasserin aut Particle swarm optimisation for dynamic optimisation problems: a review 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Natural Computing Applications Forum 2014 Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. Particle swarm optimisation Optimisation Dynamic optimisation problem Enthalten in Neural computing & applications Springer London, 1993 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 (DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 0941-0643 nnns volume:25 year:2014 number:7-8 day:24 month:07 pages:1507-1516 https://doi.org/10.1007/s00521-014-1661-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4046 GBV_ILN_4277 AR 25 2014 7-8 24 07 1507-1516 |
| language |
English |
| source |
Enthalten in Neural computing & applications 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 volume:25 year:2014 number:7-8 day:24 month:07 pages:1507-1516 |
| sourceStr |
Enthalten in Neural computing & applications 25(2014), 7-8 vom: 24. Juli, Seite 1507-1516 volume:25 year:2014 number:7-8 day:24 month:07 pages:1507-1516 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Particle swarm optimisation Optimisation Dynamic optimisation problem |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Neural computing & applications |
| authorswithroles_txt_mv |
Rezaee Jordehi, Ahmad @@aut@@ |
| publishDateDaySort_date |
2014-07-24T00:00:00Z |
| hierarchy_top_id |
165669608 |
| dewey-sort |
14 |
| id |
OLC2025595468 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2025595468</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502114612.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00521-014-1661-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2025595468</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00521-014-1661-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rezaee Jordehi, Ahmad</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Particle swarm optimisation for dynamic optimisation problems: a review</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Natural Computing Applications Forum 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Particle swarm optimisation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimisation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic optimisation problem</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Neural computing & applications</subfield><subfield code="d">Springer London, 1993</subfield><subfield code="g">25(2014), 7-8 vom: 24. Juli, Seite 1507-1516</subfield><subfield code="w">(DE-627)165669608</subfield><subfield code="w">(DE-600)1136944-9</subfield><subfield code="w">(DE-576)032873050</subfield><subfield code="x">0941-0643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:7-8</subfield><subfield code="g">day:24</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:1507-1516</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00521-014-1661-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2014</subfield><subfield code="e">7-8</subfield><subfield code="b">24</subfield><subfield code="c">07</subfield><subfield code="h">1507-1516</subfield></datafield></record></collection>
|
| author |
Rezaee Jordehi, Ahmad |
| spellingShingle |
Rezaee Jordehi, Ahmad ddc 004 misc Particle swarm optimisation misc Optimisation misc Dynamic optimisation problem Particle swarm optimisation for dynamic optimisation problems: a review |
| authorStr |
Rezaee Jordehi, Ahmad |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)165669608 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0941-0643 |
| topic_title |
004 VZ Particle swarm optimisation for dynamic optimisation problems: a review Particle swarm optimisation Optimisation Dynamic optimisation problem |
| topic |
ddc 004 misc Particle swarm optimisation misc Optimisation misc Dynamic optimisation problem |
| topic_unstemmed |
ddc 004 misc Particle swarm optimisation misc Optimisation misc Dynamic optimisation problem |
| topic_browse |
ddc 004 misc Particle swarm optimisation misc Optimisation misc Dynamic optimisation problem |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Neural computing & applications |
| hierarchy_parent_id |
165669608 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Neural computing & applications |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)165669608 (DE-600)1136944-9 (DE-576)032873050 |
| title |
Particle swarm optimisation for dynamic optimisation problems: a review |
| ctrlnum |
(DE-627)OLC2025595468 (DE-He213)s00521-014-1661-6-p |
| title_full |
Particle swarm optimisation for dynamic optimisation problems: a review |
| author_sort |
Rezaee Jordehi, Ahmad |
| journal |
Neural computing & applications |
| journalStr |
Neural computing & applications |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
txt |
| container_start_page |
1507 |
| author_browse |
Rezaee Jordehi, Ahmad |
| container_volume |
25 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Rezaee Jordehi, Ahmad |
| doi_str_mv |
10.1007/s00521-014-1661-6 |
| dewey-full |
004 |
| title_sort |
particle swarm optimisation for dynamic optimisation problems: a review |
| title_auth |
Particle swarm optimisation for dynamic optimisation problems: a review |
| abstract |
Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. © The Natural Computing Applications Forum 2014 |
| abstractGer |
Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. © The Natural Computing Applications Forum 2014 |
| abstract_unstemmed |
Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems. © The Natural Computing Applications Forum 2014 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_2018 GBV_ILN_4046 GBV_ILN_4277 |
| container_issue |
7-8 |
| title_short |
Particle swarm optimisation for dynamic optimisation problems: a review |
| url |
https://doi.org/10.1007/s00521-014-1661-6 |
| remote_bool |
false |
| ppnlink |
165669608 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00521-014-1661-6 |
| up_date |
2024-07-04T01:39:02.934Z |
| _version_ |
1803610638710210560 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2025595468</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502114612.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00521-014-1661-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2025595468</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00521-014-1661-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rezaee Jordehi, Ahmad</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Particle swarm optimisation for dynamic optimisation problems: a review</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Natural Computing Applications Forum 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Particle swarm optimisation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimisation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic optimisation problem</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Neural computing & applications</subfield><subfield code="d">Springer London, 1993</subfield><subfield code="g">25(2014), 7-8 vom: 24. Juli, Seite 1507-1516</subfield><subfield code="w">(DE-627)165669608</subfield><subfield code="w">(DE-600)1136944-9</subfield><subfield code="w">(DE-576)032873050</subfield><subfield code="x">0941-0643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:7-8</subfield><subfield code="g">day:24</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:1507-1516</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00521-014-1661-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2014</subfield><subfield code="e">7-8</subfield><subfield code="b">24</subfield><subfield code="c">07</subfield><subfield code="h">1507-1516</subfield></datafield></record></collection>
|
| score |
7.3972845 |