Application of ant colony algorithm for continuous space optimization

Aim to the disadvantages that ant colony optimization is not applied to continuous optimization problems and easy to get into local optimum, a fast global ant colony algorithm is proposed. In this algorithm the searching way that searches near the best solution and makes the best solution as the ini...

Full description

Saved in:
Bibliographic Details
Published in2009 Chinese Control and Decision Conference pp. 1993 - 1996
Main Authors Gao Hong, Hou Li-gang, Su Cheng-li
Format Conference Proceeding
LanguageChinese
English
Published IEEE 01.06.2009
Subjects
Ant colony algorithm
Ant colony optimization
Continuous optimization
Control engineering
Global optimization
Local optimum
Testing
Online AccessGet full text

Cover

Abstract Aim to the disadvantages that ant colony optimization is not applied to continuous optimization problems and easy to get into local optimum, a fast global ant colony algorithm is proposed. In this algorithm the searching way that searches near the best solution and makes the best solution as the initial solution is adopted in order to widen searching scope to avoid getting into local optimum, and then it is applied to test some typical functions. The result that compares with other optimizations on testing these functions showed that the improved algorithm is not only applied to continuous optimization problems, but also has fast global optimization, fast searching rate and high optimizing precision.
AbstractList Aim to the disadvantages that ant colony optimization is not applied to continuous optimization problems and easy to get into local optimum, a fast global ant colony algorithm is proposed. In this algorithm the searching way that searches near the best solution and makes the best solution as the initial solution is adopted in order to widen searching scope to avoid getting into local optimum, and then it is applied to test some typical functions. The result that compares with other optimizations on testing these functions showed that the improved algorithm is not only applied to continuous optimization problems, but also has fast global optimization, fast searching rate and high optimizing precision.
Author Gao Hong
Su Cheng-li
Hou Li-gang
Author_xml – sequence: 1
  surname: Gao Hong
  fullname: Gao Hong
  organization: Sch. of Inf. & Control Eng., Liaoning Shihua Univ., Fushun, China
– sequence: 2
  surname: Hou Li-gang
  fullname: Hou Li-gang
  organization: Sch. of Inf. & Control Eng., Liaoning Shihua Univ., Fushun, China
– sequence: 3
  surname: Su Cheng-li
  fullname: Su Cheng-li
  organization: Sch. of Inf. & Control Eng., Liaoning Shihua Univ., Fushun, China
BookMark eNpVkE1OwzAUhA20Em3JARAbXyDBz3YSv2UVyo9UiQ2sKyexwSi1o8RdlNMTlQqJ2Yw0n2YWsyQzH7wh5BZYBsDwvqoeqowzhlkOCErgBUmwVCC5lLzkAi_JAlCqFKUsr_4xzmd_TOCcLKcZhaxgUFyTZBy_2CSZi1zAgmzWfd-5RkcXPA2Wah9pE7rgj1R3H2Fw8XNPbRim0EfnD-Ew0rHXjaGhj27vvk_NGzK3uhtNcvYVeX_cvFXP6fb16aVab1MHZR7TRhdQt4WwiFYw5BagZczqBnOLJVeoapSmhrJobSFqZVQrDWptlYJ8qokVufvddcaYXT-4vR6Ou_ND4gfah1WF
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CCDC.2009.5191839
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781424427239
1424427231
EISSN 1948-9447
EndPage 1996
ExternalDocumentID 5191839
Genre orig-research
GroupedDBID 29B
6IE
6IF
6IK
6IL
6IN
AAJGR
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
JC5
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-ca61bd63f99f3092f11d00fac95f972898b94eb176df63b8e8d4e9aaf881563f3
IEDL.DBID RIE
ISBN 9781424427222
1424427223
ISSN 1948-9439
IngestDate Wed Jun 26 19:19:21 EDT 2024
IsPeerReviewed false
IsScholarly false
LCCN 2008906016
Language Chinese
English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-ca61bd63f99f3092f11d00fac95f972898b94eb176df63b8e8d4e9aaf881563f3
PageCount 4
ParticipantIDs ieee_primary_5191839
PublicationCentury 2000
PublicationDate 2009-June
PublicationDateYYYYMMDD 2009-06-01
PublicationDate_xml – month: 06
  year: 2009
  text: 2009-June
PublicationDecade 2000
PublicationTitle 2009 Chinese Control and Decision Conference
PublicationTitleAbbrev CCDC
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000453531
ssj0066300
Score 1.4462682
Snippet Aim to the disadvantages that ant colony optimization is not applied to continuous optimization problems and easy to get into local optimum, a fast global ant...
SourceID ieee
SourceType Publisher
StartPage 1993
SubjectTerms Ant colony algorithm
Ant colony optimization
Continuous optimization
Control engineering
Global optimization
Local optimum
Testing
Title Application of ant colony algorithm for continuous space optimization
URI https://ieeexplore.ieee.org/document/5191839
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELbaTrDwaBFveWAkbd7xjSi0qpCKGKjUrbJjGypogkoywK_nnFcBMbAlGRLHju6-3HffZ0KumDR0kgqsiJlqFa6DJXigLV9H3GEKErCNOHl2H07n_t0iWHTIdauFUUqVzWdqaA5LLl9mSWFKZSNEGyahd0k3Aqi0Wm09BaGJF3hte0dorKRKRhmHAJh1G1GXG2FCbLye6nO3pjsdG0ZxfBtXNpb1035su1JmnckemTXjrZpNXoZFLobJ5y8rx_--0D4ZbPV99KHNXAeko9JDsvvNmrBPxjdbZptmmuICUGNwnX5Q_vqUbVb585oi4KWm132VFlnxTjE44Y0zDELrWt05IPPJ-DGeWvWWC9YKcURuJTx0hAw9DaA9G1ztONK2NU8g0BDhzxkT4GN4j0KpQ08wxaSvgHPNjOuMp70j0kuzVB0TGriK2ZC4UeAmvuQ240Kq0mxGAAfGT0jfTMjyrXLVWNZzcfr35TOyU_E4pv5xTnr5plAXCAdycVl-B1-Kqa2m
link.rule.ids 310,311,783,787,792,793,799,27938,55087
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwED2VMgALHy3iGw-MpM137BGFVgXaiqGVulV2YkMFTVBJBvj1nJO0BcTAlmRIHDu6e7l37xngisaaTpKeEVBdrcJ1MAT3lOGqgFtUsoiZWpw8GPq9sXs_8SY1uF5pYaSURfOZbOnDgsuP0yjXpbI2og2d0DdgE3E1DUq11qqiguDE8ZxVg4evzaQKThkHwTDvLmVddoApcen2VJ3bFeFpmawdhrdhaWRZPe_HxitF3unuwmA54rLd5KWVZ6IVff4yc_zvK-1Bc63wI4-r3LUPNZkcwM43c8IGdG7W3DZJFcElINriOvkg_PUpXcyy5zlByEt0t_ssydP8nWB4whunGIbmlb6zCeNuZxT2jGrTBWOGSCIzIu5bIvYdxZhyTGYry4pNU_GIeYoF-HtGBXMxwAd-rHxHUEljVzLOFdW-M45yDqGepIk8AuLZkpossgPPjtyYm5SLWBZ2M4JxRvkxNPSETN9KX41pNRcnf1--hK3eaNCf9u-GD6ewXbI6uhpyBvVskctzBAeZuCi-iS_WwLDy
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+Chinese+Control+and+Decision+Conference&rft.atitle=Application+of+ant+colony+algorithm+for+continuous+space+optimization&rft.au=Gao+Hong&rft.au=Hou+Li-gang&rft.au=Su+Cheng-li&rft.date=2009-06-01&rft.pub=IEEE&rft.isbn=9781424427222&rft.issn=1948-9439&rft.eissn=1948-9447&rft.spage=1993&rft.epage=1996&rft_id=info:doi/10.1109%2FCCDC.2009.5191839&rft.externalDocID=5191839
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1948-9439&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1948-9439&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1948-9439&client=summon