Extended ant colony optimization for non-convex mixed integer nonlinear programming

Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs). Furthermore, a hybrid implementation ( ACOmi) based on this extended ACO framework, specially developed for complex non-convex M...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 36; číslo 7; s. 2217 - 2229
Hlavní autoři: Schlüter, Martin, Egea, Jose A., Banga, Julio R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Kidlington Elsevier Ltd 01.07.2009
Elsevier
Pergamon Press Inc
Témata:
Ant colony optimization
Applied sciences
Benchmarks
Constrained optimization
Exact sciences and technology
Global optimization
Hybrid metaheuristics
Integer programming
Mathematical programming
MINLP
Operational research and scientific management
Operational research. Management science
Optimization
Oracle penalty method
Studies
Oracle penalty method
Ant colony optimization
MINLP
Hybrid metaheuristics
Global optimization
Constrained optimization
Non convex programming
Global optimum
Mixed integer programming
Convex programming
Penalty method
Integer programming
Heuristic method
Swarm intelligence
Oracle
Metamodel
Non convex analysis
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs). Furthermore, a hybrid implementation ( ACOmi) based on this extended ACO framework, specially developed for complex non-convex MINLPs, is presented together with numerical results. These extensions on the ACO framework have been developed to serve the needs of practitioners who face highly non-convex and computationally costly MINLPs. The performance of this new method is evaluated considering several non-convex MINLP benchmark problems and one real-world application. The results obtained by our implementation substantiate the success of this new approach.
AbstractList Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs). Furthermore, a hybrid implementation (ACOmi) based on this extended ACO framework, specially developed for complex non-convex MINLPs, is presented together with numerical results. These extensions on the ACO framework have been developed to serve the needs of practitioners who face highly non-convex and computationally costly MINLPs. The performance of this new method is evaluated considering several non-convex MINLP benchmark problems and one real-world application. The results obtained by our implementation substantiate the success of this new approach.
Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs). Furthermore, a hybrid implementation (ACOmi) based on this extended ACO framework, specially developed for complex non-convex MINLPs, is presented together with numerical results. These extensions on the ACO framework have been developed to serve the needs of practitioners who face highly non-convex and computationally costly MINLPs. The performance of this new method is evaluated considering several non-convex MINLP benchmark problems and one real-world application. The results obtained by our implementation substantiate the success of this new approach. [PUBLICATION ABSTRACT]
Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs). Furthermore, a hybrid implementation ( ACOmi) based on this extended ACO framework, specially developed for complex non-convex MINLPs, is presented together with numerical results. These extensions on the ACO framework have been developed to serve the needs of practitioners who face highly non-convex and computationally costly MINLPs. The performance of this new method is evaluated considering several non-convex MINLP benchmark problems and one real-world application. The results obtained by our implementation substantiate the success of this new approach.
Author Schlüter, Martin
Banga, Julio R.
Egea, Jose A.
Author_xml – sequence: 1
  givenname: Martin
  surname: Schlüter
  fullname: Schlüter, Martin
  email: martin.schlueter@uni-bayreuth.de
  organization: Department of Computer Science, University of Bayreuth, 95440 Bayreuth, Germany
– sequence: 2
  givenname: Jose A.
  surname: Egea
  fullname: Egea, Jose A.
  email: jegea@iim.csic.es
  organization: Process Engineering Group, Instituto de Investigaciones Marinas (IIM-CSIC), 36208 Vigo, Spain
– sequence: 3
  givenname: Julio R.
  surname: Banga
  fullname: Banga, Julio R.
  email: julio@iim.csic.es
  organization: Process Engineering Group, Instituto de Investigaciones Marinas (IIM-CSIC), 36208 Vigo, Spain
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21231073$$DView record in Pascal Francis
BookMark eNp9kUFr3DAQhUVJoJukP6A3U0hv3o5kybLJqYQkLQRySAu9CWU8XrTY0lbShk1_fbTZ9JJDxMAc9L15w7wTduSDJ8Y-c1hy4O239RJDXAqAbrkvrj6wBe90U-tW_TliC2hA1aBk95GdpLSG8rTgC3Z_tcvkBxoq63OFYQr-qQqb7Gb3z2YXfDWGWBWzGoN_pF01u12Bnc-0opePyXmysdrEsIp2np1fnbHj0U6JPr32U_b7-urX5Y_69u7m5-X32xplJ3ItBkIpFFqA3moCiTiCgl6KQVneD9B0AyL1bVOaavUoQMsWtbL6QT0obE7Z18Pc4v13Symb2SWkabKewjaZRmkte9kX8MsbcB220ZfdDO9VJ9tiVaDzV8gmtNMYrUeXzCa62cYnI7hoOOimcPrAYQwpRRoNuvxyqhytmwwHs0_ErE1JxOwTMfviqij5G-X_4e9pLg4aKod8dBRNQkceaXCRMJshuHfUz6-Hppo
CODEN CMORAP
CitedBy_id crossref_primary_10_1179_1752270612Y_0000000010
crossref_primary_10_1155_2013_527965
crossref_primary_10_1371_journal_pone_0166867
crossref_primary_10_1016_j_cherd_2021_11_039
crossref_primary_10_1080_0305215X_2019_1577404
crossref_primary_10_5194_wes_10_1611_2025
crossref_primary_10_1016_j_actaastro_2024_02_040
crossref_primary_10_1016_j_scitotenv_2025_179695
crossref_primary_10_3390_electronics10040522
crossref_primary_10_1109_TSMC_2024_3404346
crossref_primary_10_3390_a11040047
crossref_primary_10_1016_j_energy_2022_123910
crossref_primary_10_1061__ASCE_CO_1943_7862_0002100
crossref_primary_10_3390_en16227567
crossref_primary_10_1016_j_applthermaleng_2022_118467
crossref_primary_10_1080_00207543_2015_1038369
crossref_primary_10_1016_j_actaastro_2022_07_032
crossref_primary_10_1016_j_asr_2012_11_006
crossref_primary_10_1134_S1995080221070040
crossref_primary_10_1007_s00158_011_0666_3
crossref_primary_10_1016_j_actaastro_2023_11_018
crossref_primary_10_1186_1471_2105_10_199
crossref_primary_10_3390_en15196884
crossref_primary_10_1109_TETCI_2019_2940978
crossref_primary_10_1109_TWC_2012_091812_120329
crossref_primary_10_1016_j_energy_2017_09_087
crossref_primary_10_1109_TWC_2013_062713_130302
crossref_primary_10_1155_2014_617905
crossref_primary_10_3390_math8091461
crossref_primary_10_1016_j_asr_2014_05_002
crossref_primary_10_1109_ACCESS_2020_3036131
crossref_primary_10_1109_ACCESS_2019_2903910
crossref_primary_10_1016_j_eswa_2015_09_011
crossref_primary_10_1016_j_engappai_2022_104727
crossref_primary_10_1177_09544070241254557
crossref_primary_10_1007_s10898_009_9477_0
crossref_primary_10_1016_j_neucom_2015_08_041
crossref_primary_10_1016_j_cherd_2017_05_015
crossref_primary_10_2514_1_C037541
crossref_primary_10_3390_en16104257
crossref_primary_10_1007_s13272_025_00851_0
crossref_primary_10_1016_j_plrev_2024_09_014
crossref_primary_10_1016_j_oceaneng_2021_109402
crossref_primary_10_1016_j_trb_2021_09_003
crossref_primary_10_1016_j_cor_2013_07_021
crossref_primary_10_1016_j_jpowsour_2019_226880
crossref_primary_10_1016_j_ces_2020_116416
crossref_primary_10_1371_journal_pone_0182186
crossref_primary_10_1016_j_apenergy_2018_06_052
crossref_primary_10_1016_j_mbs_2018_12_013
crossref_primary_10_1080_02331934_2012_668545
crossref_primary_10_1109_JSYST_2021_3100409
crossref_primary_10_1145_3696670
crossref_primary_10_3390_en11010244
crossref_primary_10_1016_j_asoc_2022_109981
crossref_primary_10_1016_j_seppur_2024_128636
crossref_primary_10_1109_TASE_2013_2265917
crossref_primary_10_1007_s00158_020_02725_x
crossref_primary_10_3390_aerospace11030180
crossref_primary_10_1007_s13042_015_0479_6
crossref_primary_10_1007_s00158_019_02366_9
crossref_primary_10_1109_TEVC_2013_2281531
crossref_primary_10_1016_j_ijepes_2021_106979
crossref_primary_10_1186_1752_0509_7_76
crossref_primary_10_3390_aerospace12090851
crossref_primary_10_1016_j_ces_2015_06_019
crossref_primary_10_1016_j_jhydrol_2024_132145
crossref_primary_10_1016_j_asoc_2015_03_032
crossref_primary_10_3390_aerospace8120398
crossref_primary_10_1016_j_actaastro_2023_06_029
crossref_primary_10_1007_s00158_023_03600_1
crossref_primary_10_1186_s12918_014_0113_3
crossref_primary_10_1155_2016_2601561
crossref_primary_10_1002_dac_2414
crossref_primary_10_1016_j_compchemeng_2020_106763
crossref_primary_10_1016_j_cor_2011_02_014
crossref_primary_10_1016_j_tws_2021_108521
crossref_primary_10_1016_j_cie_2019_106073
crossref_primary_10_1080_0305215X_2013_806918
crossref_primary_10_1016_j_energy_2022_123324
crossref_primary_10_1016_j_swevo_2018_03_004
crossref_primary_10_1016_j_jenvman_2024_122023
crossref_primary_10_1016_j_eswa_2018_01_020
crossref_primary_10_1016_j_jpowsour_2025_237671
crossref_primary_10_1177_14750902211069548
crossref_primary_10_1007_s10898_021_01085_0
crossref_primary_10_3390_electronics10141648
crossref_primary_10_1016_j_epsr_2022_108141
crossref_primary_10_1007_s42496_018_00004_z
crossref_primary_10_1109_LRA_2025_3530109
crossref_primary_10_1016_j_compstruct_2022_116268
crossref_primary_10_3390_math10183336
crossref_primary_10_1002_lpor_201900445
crossref_primary_10_1111_mice_13112
crossref_primary_10_1016_j_ejor_2016_12_023
crossref_primary_10_1002_int_22342
crossref_primary_10_1007_s00466_015_1245_z
crossref_primary_10_1016_j_sorms_2012_08_001
crossref_primary_10_3390_en16010213
crossref_primary_10_2514_1_A35880
crossref_primary_10_1007_s11750_011_0245_1
crossref_primary_10_1016_j_matpr_2019_05_195
crossref_primary_10_15407_emodel_47_04_073
crossref_primary_10_1016_j_cor_2013_12_004
crossref_primary_10_1016_j_eswa_2010_07_051
crossref_primary_10_3390_electricity6020031
crossref_primary_10_1016_j_compchemeng_2020_107193
crossref_primary_10_1061__ASCE_WR_1943_5452_0001199
crossref_primary_10_1016_j_jclepro_2018_08_040
crossref_primary_10_3390_a13010008
crossref_primary_10_1007_s00291_023_00730_2
crossref_primary_10_1109_TITS_2021_3106305
crossref_primary_10_1016_j_ifacol_2016_07_289
crossref_primary_10_1016_j_compchemeng_2020_106946
crossref_primary_10_1080_00194506_2025_2499834
crossref_primary_10_1016_j_swevo_2024_101642
Cites_doi 10.1016/j.amc.2005.12.051
10.1007/s10898-006-9075-3
10.1016/j.ejor.2006.06.046
10.1038/35017500
10.1016/S0098-1354(00)00592-5
10.1287/mnsc.31.12.1533
10.1023/A:1021039126272
10.1214/aoms/1177706645
10.1016/j.plrev.2005.10.001
10.1023/A:1021091110342
10.1016/S0097-8485(01)00081-X
10.3390/mca10010045
10.1016/S0377-2217(02)00401-0
10.1007/BF01584657
10.1007/BF02592064
10.1023/A:1011860702585
10.1016/j.ejor.2003.08.053
10.1021/ie010932r
10.1016/j.compchemeng.2005.05.020
10.1023/B:OPTE.0000033373.79886.54
10.1162/106454699568728
10.1016/j.compchemeng.2007.10.008
10.1007/s11590-006-0026-1
10.1007/s11465-007-0079-6
10.1016/S0045-7825(01)00323-1
ContentType Journal Article
Copyright 2008 Elsevier Ltd
2009 INIST-CNRS
Copyright Pergamon Press Inc. Jul 2009
Copyright_xml – notice: 2008 Elsevier Ltd
– notice: 2009 INIST-CNRS
– notice: Copyright Pergamon Press Inc. Jul 2009
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cor.2008.08.015
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
Applied Sciences
EISSN 1873-765X
0305-0548
EndPage 2229
ExternalDocumentID 1631489361
21231073
10_1016_j_cor_2008_08_015
S0305054808001524
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
186
1B1
1OL
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABMMH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEFWE
AEHXG
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
AOUOD
APLSM
ARUGR
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSO
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
UAO
UPT
VH1
WUQ
XFK
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c482t-2dec425ca009a7e04ccf050942d5a19d038dcce963dcc567f20746c75a7b5b5c3
ISICitedReferencesCount 190
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000262559800010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0305-0548
IngestDate Sun Sep 28 10:51:09 EDT 2025
Fri Jul 25 05:20:38 EDT 2025
Mon Jul 21 09:16:57 EDT 2025
Sat Nov 29 03:23:33 EST 2025
Tue Nov 18 22:34:36 EST 2025
Fri Feb 23 02:33:28 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 7
Keywords Oracle penalty method
Ant colony optimization
MINLP
Hybrid metaheuristics
Global optimization
Constrained optimization
Non convex programming
Global optimum
Mixed integer programming
Convex programming
Penalty method
Integer programming
Heuristic method
Swarm intelligence
Oracle
Metamodel
Non convex analysis
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c482t-2dec425ca009a7e04ccf050942d5a19d038dcce963dcc567f20746c75a7b5b5c3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 195846038
PQPubID 45870
PageCount 13
ParticipantIDs proquest_miscellaneous_35774949
proquest_journals_195846038
pascalfrancis_primary_21231073
crossref_citationtrail_10_1016_j_cor_2008_08_015
crossref_primary_10_1016_j_cor_2008_08_015
elsevier_sciencedirect_doi_10_1016_j_cor_2008_08_015
PublicationCentury 2000
PublicationDate 2009-07-01
PublicationDateYYYYMMDD 2009-07-01
PublicationDate_xml – month: 07
  year: 2009
  text: 2009-07-01
  day: 01
PublicationDecade 2000
PublicationPlace Kidlington
PublicationPlace_xml – name: Kidlington
– name: New York
PublicationTitle Computers & operations research
PublicationYear 2009
Publisher Elsevier Ltd
Elsevier
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Elsevier
– name: Pergamon Press Inc
References Coello (bib25) 2002; 191
Yu, Liu, Li (bib8) 2007; 2
Blum (bib5) 2005; 2
Abramson MA. Nomadm optimization software
Socha (bib15) 2004
Stuetzle, Dorigo (bib3) 1999
Abramson (bib17) 2004; 5
Grossmann (bib22) 2002; 3
Asaadi (bib31) 1973; 4
Blum C. The metaheuristics network web site: ant colony optimization; 2008
Exler, Schittkowksi (bib27) 2007; 3
Hock W (bib32) 1981; 187
Dorigo M. Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italy; 1992.
Chunfeng, Xin (bib13) 2002; 41
Zhang, Chen, Zhao (bib14) 2005; 29
2007.
Jayaraman, Kulkarni, Karale, Shelokar (bib11) 2000; 24
Rajesh, Gupta, Kusumakar, Jayaraman, Kulkarni (bib12) 2001; 25
Gupta, Ravindran (bib34) 1985; 31
Socha, Dorigo (bib7) 2008; 185
Bonabeau, Dorigo, Theraulaz (bib4) 2000; 406
Serban, Sandou (bib16) 2007
Chelouah, Siarry (bib20) 2005; 161
Box, Müller (bib24) 1958; 29
2000.
Dreo, Siarry (bib9) 2006; 181
Egea, Rodriguez-Fernandez, Banga, Marti (bib19) 2007; 37
Kong, Tian (bib10) 2006
.
Yeniay (bib26) 2005; 10
Floudas, Pardalos, Adjiman, Esposito, Z.H., Harding, Klepeis, Meyer, Schweiger (bib36) 1999
Dorigo, Di Caro, Gambardella (bib2) 1999; 5
Glover, Kochenberger (bib18) 2003
Duran, Grossmann (bib35) 1986; 36
Exler O, Antelo LT, Egea JA, Alonso AA, Banga JR. A tabu search-based algorithm for mixed-integer nonlinear problems and its application to integrated process and control system design. Computers & Chemical Engineering 2008;32(8):1877–91.
Dorigo, Stuetzle (bib6) 2004
Kokkolaras M., Audet (bib30) 2000; 2
Leyffer S. Macminlp, ampl collection of mixed integer nonlinear programs
Chelouah, Siarry (bib21) 2003; 148
Westerlund, Pörn (bib33) 2002; 3
Westerlund (10.1016/j.cor.2008.08.015_bib33) 2002; 3
Exler (10.1016/j.cor.2008.08.015_bib27) 2007; 3
Socha (10.1016/j.cor.2008.08.015_bib7) 2008; 185
Grossmann (10.1016/j.cor.2008.08.015_bib22) 2002; 3
10.1016/j.cor.2008.08.015_bib29
10.1016/j.cor.2008.08.015_bib28
Blum (10.1016/j.cor.2008.08.015_bib5) 2005; 2
Hock W (10.1016/j.cor.2008.08.015_bib32) 1981; 187
10.1016/j.cor.2008.08.015_bib23
Jayaraman (10.1016/j.cor.2008.08.015_bib11) 2000; 24
Glover (10.1016/j.cor.2008.08.015_bib18) 2003
Asaadi (10.1016/j.cor.2008.08.015_bib31) 1973; 4
Box (10.1016/j.cor.2008.08.015_bib24) 1958; 29
Zhang (10.1016/j.cor.2008.08.015_bib14) 2005; 29
Duran (10.1016/j.cor.2008.08.015_bib35) 1986; 36
Dorigo (10.1016/j.cor.2008.08.015_bib2) 1999; 5
Serban (10.1016/j.cor.2008.08.015_bib16) 2007
Chelouah (10.1016/j.cor.2008.08.015_bib21) 2003; 148
Kokkolaras M. (10.1016/j.cor.2008.08.015_bib30) 2000; 2
Gupta (10.1016/j.cor.2008.08.015_bib34) 1985; 31
Chelouah (10.1016/j.cor.2008.08.015_bib20) 2005; 161
10.1016/j.cor.2008.08.015_bib1
Kong (10.1016/j.cor.2008.08.015_bib10) 2006
Rajesh (10.1016/j.cor.2008.08.015_bib12) 2001; 25
Chunfeng (10.1016/j.cor.2008.08.015_bib13) 2002; 41
Stuetzle (10.1016/j.cor.2008.08.015_bib3) 1999
Dorigo (10.1016/j.cor.2008.08.015_bib6) 2004
Coello (10.1016/j.cor.2008.08.015_bib25) 2002; 191
Bonabeau (10.1016/j.cor.2008.08.015_bib4) 2000; 406
Egea (10.1016/j.cor.2008.08.015_bib19) 2007; 37
Floudas (10.1016/j.cor.2008.08.015_bib36) 1999
10.1016/j.cor.2008.08.015_bib37
Abramson (10.1016/j.cor.2008.08.015_bib17) 2004; 5
Dreo (10.1016/j.cor.2008.08.015_bib9) 2006; 181
Yu (10.1016/j.cor.2008.08.015_bib8) 2007; 2
Yeniay (10.1016/j.cor.2008.08.015_bib26) 2005; 10
Socha (10.1016/j.cor.2008.08.015_bib15) 2004
References_xml – year: 2007
  ident: bib16
  article-title: Mixed ant colony optimization for the unit commitment problem. Adaptive and natural computing algorithms
– reference: Blum C. The metaheuristics network web site: ant colony optimization; 2008
– reference: Exler O, Antelo LT, Egea JA, Alonso AA, Banga JR. A tabu search-based algorithm for mixed-integer nonlinear problems and its application to integrated process and control system design. Computers & Chemical Engineering 2008;32(8):1877–91.
– volume: 41
  start-page: 6678
  year: 2002
  end-page: 6686
  ident: bib13
  article-title: Ants foraging mechanism in the design of multiproduct batch chemical process
  publication-title: Industrial & Engineering Chemistry Research
– volume: 24
  start-page: 1901
  year: 2000
  end-page: 1912
  ident: bib11
  article-title: Ant colony framework for optimal design and scheduling of batch plants
  publication-title: Computers & Chemical Engineering
– year: 2006
  ident: bib10
  article-title: Application of ACO in continuous domain. Advances in natural computation
– year: 2003
  ident: bib18
  article-title: Handbook of metaheuristics
– volume: 2
  start-page: 459
  year: 2007
  end-page: 462
  ident: bib8
  article-title: Ant colony optimization in continuous problem
  publication-title: Frontiers of Mechanical Engineering in China
– volume: 406
  start-page: 39
  year: 2000
  end-page: 42
  ident: bib4
  article-title: Inspiration for optimization from social insect behaviour
  publication-title: Nature
– volume: 2
  start-page: 353
  year: 2005
  end-page: 373
  ident: bib5
  article-title: Ant colony optimization: introduction and recent trends
  publication-title: Physics of Life Reviews
– volume: 185
  start-page: 1155
  year: 2008
  end-page: 1173
  ident: bib7
  article-title: Ant colony optimization for continuous domains
  publication-title: European Journal of Operational Research
– volume: 36
  start-page: 307
  year: 1986
  end-page: 339
  ident: bib35
  article-title: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
  publication-title: Math Program
– volume: 5
  start-page: 137
  year: 1999
  end-page: 172
  ident: bib2
  article-title: Ant algorithms for discrete optimization
  publication-title: Artificial Life
– year: 1999
  ident: bib36
  article-title: Handbook of test problems in local and global optimization
– volume: 25
  start-page: 583
  year: 2001
  end-page: 595
  ident: bib12
  article-title: Dynamic optimization of chemical processes using ant colony framework
  publication-title: Computers & Chemistry
– volume: 29
  start-page: 610
  year: 1958
  end-page: 611
  ident: bib24
  article-title: A note on the generation of random normal deviates
  publication-title: Annals of Mathematical Statistics
– volume: 31
  start-page: 1533
  year: 1985
  end-page: 1546
  ident: bib34
  article-title: Branch and bound experiments in convex non-linear integer programming
  publication-title: Manage Sci
– reference: , 2000.
– volume: 148
  start-page: 335
  year: 2003
  end-page: 348
  ident: bib21
  article-title: Genetic and nelder-mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions
  publication-title: European Journal of Operational Research
– volume: 5
  start-page: 157
  year: 2004
  end-page: 177
  ident: bib17
  article-title: Mixed variable optimization and of a load-bearing thermal insulation system using a filter pattern search algorithm
  publication-title: Optimization and Engineering
– volume: 181
  start-page: 457
  year: 2006
  end-page: 467
  ident: bib9
  article-title: An ant colony algorithm aimed at dynamic continuous optimization
  publication-title: Applied Mathematics and Computation
– volume: 3
  start-page: 269
  year: 2007
  end-page: 280
  ident: bib27
  article-title: A trust region sqp algorithm for mixed-integer nonlinear programming
  publication-title: Optimization Letters
– volume: 29
  start-page: 2078
  year: 2005
  end-page: 2086
  ident: bib14
  article-title: Iterative ant-colony algorithm and its application to dynamic optimization of chemical process
  publication-title: Computers & Chemical Engineering
– volume: 10
  start-page: 45
  year: 2005
  end-page: 56
  ident: bib26
  article-title: Penalty function methods for constrained optimization with genetic algorithms
  publication-title: Mathematical and Computational Applications
– volume: 3
  start-page: 227
  year: 2002
  end-page: 252
  ident: bib22
  article-title: Review of nonlinear mixed-integer and disjunctive programming techniques
  publication-title: Optimization and Engineering
– reference: , 2007.
– year: 2004
  ident: bib15
  article-title: ACO for continuous and mixed-variable optimization. Ant colony, optimization and swarm intelligence
– volume: 161
  start-page: 636
  year: 2005
  end-page: 654
  ident: bib20
  article-title: A hybrid method combining continuous tabu search and nelder-mead simplex algorithms for the global optimization of multiminima functions
  publication-title: European Journal of Operational Research
– volume: 4
  start-page: 144
  year: 1973
  end-page: 154
  ident: bib31
  article-title: A computational comparison of some non-linear programs
  publication-title: Math Program
– volume: 187
  start-page: 127
  year: 1981
  end-page: 129
  ident: bib32
  article-title: Test examples for nonlinear programming codes
  publication-title: Lect Notes Econ Math
– volume: 191
  start-page: 1245
  year: 2002
  end-page: 1287
  ident: bib25
  article-title: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art
  publication-title: Computer Methods in Applied Mechanics
– year: 1999
  ident: bib3
  article-title: ACO algorithms for the travelling salesman problem. Evolutionary algorithms in engineering and computer science
– volume: 37
  start-page: 481
  year: 2007
  end-page: 503
  ident: bib19
  article-title: Scatter search for chemical and bio-process optimization
  publication-title: Journal of Global Optimization
– volume: 3
  start-page: 253
  year: 2002
  end-page: 280
  ident: bib33
  article-title: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
  publication-title: Optimization and Engineering
– volume: 2
  start-page: 5
  year: 2000
  end-page: 29
  ident: bib30
  article-title: Mixed variable optimization of the number and composition of heat intercepts in a thermal insulation system
  publication-title: Optimization and Engineering
– reference: Abramson MA. Nomadm optimization software
– reference: Leyffer S. Macminlp, ampl collection of mixed integer nonlinear programs
– year: 2004
  ident: bib6
  article-title: Ant colony optimization
– reference: Dorigo M. Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italy; 1992.
– reference: .
– volume: 181
  start-page: 457
  issue: 1
  year: 2006
  ident: 10.1016/j.cor.2008.08.015_bib9
  article-title: An ant colony algorithm aimed at dynamic continuous optimization
  publication-title: Applied Mathematics and Computation
  doi: 10.1016/j.amc.2005.12.051
– year: 2007
  ident: 10.1016/j.cor.2008.08.015_bib16
– volume: 37
  start-page: 481
  issue: 3
  year: 2007
  ident: 10.1016/j.cor.2008.08.015_bib19
  article-title: Scatter search for chemical and bio-process optimization
  publication-title: Journal of Global Optimization
  doi: 10.1007/s10898-006-9075-3
– volume: 187
  start-page: 127
  year: 1981
  ident: 10.1016/j.cor.2008.08.015_bib32
  article-title: Test examples for nonlinear programming codes
  publication-title: Lect Notes Econ Math
– volume: 185
  start-page: 1155
  year: 2008
  ident: 10.1016/j.cor.2008.08.015_bib7
  article-title: Ant colony optimization for continuous domains
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2006.06.046
– ident: 10.1016/j.cor.2008.08.015_bib37
– volume: 406
  start-page: 39
  year: 2000
  ident: 10.1016/j.cor.2008.08.015_bib4
  article-title: Inspiration for optimization from social insect behaviour
  publication-title: Nature
  doi: 10.1038/35017500
– volume: 24
  start-page: 1901
  issue: 8
  year: 2000
  ident: 10.1016/j.cor.2008.08.015_bib11
  article-title: Ant colony framework for optimal design and scheduling of batch plants
  publication-title: Computers & Chemical Engineering
  doi: 10.1016/S0098-1354(00)00592-5
– year: 2004
  ident: 10.1016/j.cor.2008.08.015_bib6
– volume: 31
  start-page: 1533
  year: 1985
  ident: 10.1016/j.cor.2008.08.015_bib34
  article-title: Branch and bound experiments in convex non-linear integer programming
  publication-title: Manage Sci
  doi: 10.1287/mnsc.31.12.1533
– year: 1999
  ident: 10.1016/j.cor.2008.08.015_bib3
– volume: 3
  start-page: 227
  issue: 3
  year: 2002
  ident: 10.1016/j.cor.2008.08.015_bib22
  article-title: Review of nonlinear mixed-integer and disjunctive programming techniques
  publication-title: Optimization and Engineering
  doi: 10.1023/A:1021039126272
– volume: 29
  start-page: 610
  issue: 2
  year: 1958
  ident: 10.1016/j.cor.2008.08.015_bib24
  article-title: A note on the generation of random normal deviates
  publication-title: Annals of Mathematical Statistics
  doi: 10.1214/aoms/1177706645
– volume: 2
  start-page: 353
  issue: 4
  year: 2005
  ident: 10.1016/j.cor.2008.08.015_bib5
  article-title: Ant colony optimization: introduction and recent trends
  publication-title: Physics of Life Reviews
  doi: 10.1016/j.plrev.2005.10.001
– volume: 3
  start-page: 253
  year: 2002
  ident: 10.1016/j.cor.2008.08.015_bib33
  article-title: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
  publication-title: Optimization and Engineering
  doi: 10.1023/A:1021091110342
– volume: 25
  start-page: 583
  issue: 6
  year: 2001
  ident: 10.1016/j.cor.2008.08.015_bib12
  article-title: Dynamic optimization of chemical processes using ant colony framework
  publication-title: Computers & Chemistry
  doi: 10.1016/S0097-8485(01)00081-X
– volume: 10
  start-page: 45
  year: 2005
  ident: 10.1016/j.cor.2008.08.015_bib26
  article-title: Penalty function methods for constrained optimization with genetic algorithms
  publication-title: Mathematical and Computational Applications
  doi: 10.3390/mca10010045
– volume: 148
  start-page: 335
  issue: 2
  year: 2003
  ident: 10.1016/j.cor.2008.08.015_bib21
  article-title: Genetic and nelder-mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(02)00401-0
– volume: 4
  start-page: 144
  year: 1973
  ident: 10.1016/j.cor.2008.08.015_bib31
  article-title: A computational comparison of some non-linear programs
  publication-title: Math Program
  doi: 10.1007/BF01584657
– year: 2004
  ident: 10.1016/j.cor.2008.08.015_bib15
– volume: 36
  start-page: 307
  year: 1986
  ident: 10.1016/j.cor.2008.08.015_bib35
  article-title: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
  publication-title: Math Program
  doi: 10.1007/BF02592064
– volume: 2
  start-page: 5
  issue: 1
  year: 2000
  ident: 10.1016/j.cor.2008.08.015_bib30
  article-title: Mixed variable optimization of the number and composition of heat intercepts in a thermal insulation system
  publication-title: Optimization and Engineering
  doi: 10.1023/A:1011860702585
– volume: 161
  start-page: 636
  issue: 3
  year: 2005
  ident: 10.1016/j.cor.2008.08.015_bib20
  article-title: A hybrid method combining continuous tabu search and nelder-mead simplex algorithms for the global optimization of multiminima functions
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2003.08.053
– volume: 41
  start-page: 6678
  issue: 26
  year: 2002
  ident: 10.1016/j.cor.2008.08.015_bib13
  article-title: Ants foraging mechanism in the design of multiproduct batch chemical process
  publication-title: Industrial & Engineering Chemistry Research
  doi: 10.1021/ie010932r
– volume: 29
  start-page: 2078
  issue: 10
  year: 2005
  ident: 10.1016/j.cor.2008.08.015_bib14
  article-title: Iterative ant-colony algorithm and its application to dynamic optimization of chemical process
  publication-title: Computers & Chemical Engineering
  doi: 10.1016/j.compchemeng.2005.05.020
– ident: 10.1016/j.cor.2008.08.015_bib1
– volume: 5
  start-page: 157
  issue: 2
  year: 2004
  ident: 10.1016/j.cor.2008.08.015_bib17
  article-title: Mixed variable optimization and of a load-bearing thermal insulation system using a filter pattern search algorithm
  publication-title: Optimization and Engineering
  doi: 10.1023/B:OPTE.0000033373.79886.54
– ident: 10.1016/j.cor.2008.08.015_bib29
– volume: 5
  start-page: 137
  issue: 2
  year: 1999
  ident: 10.1016/j.cor.2008.08.015_bib2
  article-title: Ant algorithms for discrete optimization
  publication-title: Artificial Life
  doi: 10.1162/106454699568728
– year: 2003
  ident: 10.1016/j.cor.2008.08.015_bib18
– year: 1999
  ident: 10.1016/j.cor.2008.08.015_bib36
– ident: 10.1016/j.cor.2008.08.015_bib28
  doi: 10.1016/j.compchemeng.2007.10.008
– ident: 10.1016/j.cor.2008.08.015_bib23
– volume: 3
  start-page: 269
  issue: 1
  year: 2007
  ident: 10.1016/j.cor.2008.08.015_bib27
  article-title: A trust region sqp algorithm for mixed-integer nonlinear programming
  publication-title: Optimization Letters
  doi: 10.1007/s11590-006-0026-1
– volume: 2
  start-page: 459
  issue: 4
  year: 2007
  ident: 10.1016/j.cor.2008.08.015_bib8
  article-title: Ant colony optimization in continuous problem
  publication-title: Frontiers of Mechanical Engineering in China
  doi: 10.1007/s11465-007-0079-6
– volume: 191
  start-page: 1245
  issue: 11
  year: 2002
  ident: 10.1016/j.cor.2008.08.015_bib25
  article-title: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art
  publication-title: Computer Methods in Applied Mechanics
  doi: 10.1016/S0045-7825(01)00323-1
– year: 2006
  ident: 10.1016/j.cor.2008.08.015_bib10
SSID ssj0000721
Score 2.3944485
Snippet Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 2217
SubjectTerms Ant colony optimization
Applied sciences
Benchmarks
Constrained optimization
Exact sciences and technology
Global optimization
Hybrid metaheuristics
Integer programming
Mathematical programming
MINLP
Operational research and scientific management
Operational research. Management science
Optimization
Oracle penalty method
Studies
Title Extended ant colony optimization for non-convex mixed integer nonlinear programming
URI https://dx.doi.org/10.1016/j.cor.2008.08.015
https://www.proquest.com/docview/195846038
https://www.proquest.com/docview/35774949
Volume 36
WOSCitedRecordID wos000262559800010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLagQwiEuBQQZTD8wF6oIqVJXMePE7QCNBWkdVLfLNdxYNOahqZF5d9zfG3GZcADUpRWSdyo-b4cH9vnfAehlySJRZkSHYcjWJQJeBXntGCRzIuUCZmwocpNsQk6meSzGfvowooaU06AVlW-3bL6v0INxwBsnTr7D3CHH4UD8B1Ahz3ADvu_An7kprX78Mz6WpO6-tZfgmFYuIxLE1gIg_7IBJxv-4uzrSqsbIQyJ7TjqQWwbeTWwvdtXs7AlYFoDGmWtVq5YDonGxSml0_k54uNK_thxQqC9_5JCb_60J5Lrewkr07ZXrpARj8fwULsasjD0uGAxOpnehtrRU4cl2jbYCY2ddN1vrq6-C8Nu51jOAdcVi4AFjabCHpZRHvygY9Pj4_5dDSbHqbj-kukK4zplfjD9I1F-zraSyhheQftHb0bzd7vem5q8vTCP_Cr4CYe8Ic7_86PuVOLBt6u0pZF-amHN27L9D6668Yb-Mjy5AG6pqouuunTHbronscTOyvfRbdbGpUP0YnnEwY-Ycsn3OYTBj7hHZ-w4RN2fMKBT7jFp0fodDyavn4buUockczyZB0lhZJg3KUAvAVVcSZlqYWDsqQgYsCKOM0LKRUYc_ggQ1omuoyNpETQOZkTmT5GHbifeoJwnIMpKIbZHHxFXe08Z0lSZqkiA1rQoSA9FPvnyqWTqdfVUi64j0c85wCFK58K2wCavApNaqvRctXFmQeLOyfTOo8cqHZVs4NLwIYbaddvAP1kD-17pLmzBg3XSk7ZEJ5OD70IZ8F-60U5UanlpuEpgQEYy9jTP16xj27t3rdnqLNebdRzdEN-XZ81qwPH5e84qr2D
linkProvider Elsevier
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%3Ajournal&rft.genre=article&rft.atitle=Extended+ant+colony+optimization+for+non-convex+mixed+integer+nonlinear+programming&rft.jtitle=Computers+%26+operations+research&rft.au=Schluter%2C+Martin&rft.au=Egea%2C+Jose+A&rft.au=Banga%2C+Julio+R&rft.date=2009-07-01&rft.issn=0305-0548&rft.volume=36&rft.issue=7&rft.spage=2217&rft.epage=2229&rft_id=info:doi/10.1016%2Fj.cor.2008.08.015&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon