A simulated annealing method based on a specialised evolutionary algorithm
[Display omitted] ► We propose a hybrid algorithm for binary combinatorial problems. ► It is an evolutionary algorithm performing like a simulated annealing model. ► We develop experiments on a representative set of problems. ► The model is competitive regarding similar hybrids and state-of-the-art...
Saved in:
| Published in | Applied soft computing Vol. 12; no. 2; pp. 573 - 588 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.02.2012
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1568-4946 1872-9681 |
| DOI | 10.1016/j.asoc.2011.11.007 |
Cover
| Abstract | [Display omitted]
► We propose a hybrid algorithm for binary combinatorial problems. ► It is an evolutionary algorithm performing like a simulated annealing model. ► We develop experiments on a representative set of problems. ► The model is competitive regarding similar hybrids and state-of-the-art methods.
The flexible architecture of evolutionary algorithms allows specialised models to be obtained with the aim of performing as other search methods do, but more satisfactorily. In fact, there exist several evolutionary proposals in the literature that play the role of local search methods. In this paper, we make a step forward presenting a specialised evolutionary approach that carries out a search process equivalent to the one of
simulated annealing. An empirical study comparing the new model with classic simulated annealing methods, hybrid algorithms and state-of-the-art optimisers concludes that the new alternative scheme for combining ideas from simulated annealing and evolutionary algorithms introduced by our proposal may outperform this kind of hybrid algorithms, and achieve competitive results with regard to proposals presented in the literature for binary-coded optimisation problems. |
|---|---|
| AbstractList | [Display omitted]
► We propose a hybrid algorithm for binary combinatorial problems. ► It is an evolutionary algorithm performing like a simulated annealing model. ► We develop experiments on a representative set of problems. ► The model is competitive regarding similar hybrids and state-of-the-art methods.
The flexible architecture of evolutionary algorithms allows specialised models to be obtained with the aim of performing as other search methods do, but more satisfactorily. In fact, there exist several evolutionary proposals in the literature that play the role of local search methods. In this paper, we make a step forward presenting a specialised evolutionary approach that carries out a search process equivalent to the one of
simulated annealing. An empirical study comparing the new model with classic simulated annealing methods, hybrid algorithms and state-of-the-art optimisers concludes that the new alternative scheme for combining ideas from simulated annealing and evolutionary algorithms introduced by our proposal may outperform this kind of hybrid algorithms, and achieve competitive results with regard to proposals presented in the literature for binary-coded optimisation problems. |
| Author | García-Martínez, C. Lozano, M. Rodríguez-Díaz, F.J. |
| Author_xml | – sequence: 1 givenname: C. surname: García-Martínez fullname: García-Martínez, C. email: cgarcia@uco.es organization: Department of Computing and Numerical Analysis, University of Córdoba, 14071, Spain – sequence: 2 givenname: M. surname: Lozano fullname: Lozano, M. organization: Department of Computer Science and Artificial Intelligence, CITIC-UGR (Research Center on Information and Communications Technology), University of Granada, 18071, Spain – sequence: 3 givenname: F.J. surname: Rodríguez-Díaz fullname: Rodríguez-Díaz, F.J. organization: Department of Computer Science and Artificial Intelligence, CITIC-UGR (Research Center on Information and Communications Technology), University of Granada, 18071, Spain |
| BookMark | eNp9kE1qwzAQhUVJoUnaC3TlC9iVFNmyoZsQ-kugm3YtxtI4UbClIDmB3r4y7aqLwMAMb_iGeW9BZs47JOSe0YJRVj0cCoheF5wyVqSiVF6ROaslz5uqZrM0l1Wdi0ZUN2QR44EmqOH1nLyvs2iHUw8jmgycQ-it22UDjntvshZikr3LIItH1DYtJwHPvj-N1jsI3xn0Ox_suB9uyXUHfcS7v74kX89Pn5vXfPvx8rZZb3O9onTMta464Fo0TIqyFVLoVlRGCm6wZG2lSw6yNAy0bpnAUpq6wwa05IxzMCtcLUn9e1cHH2PATmk7wvTOGMD2ilE1ZaIOaspETZmoVCmThPJ_6DHYIbm4DD3-QphMnS0GFbVFp9HYgHpUxttL-A-QmH69 |
| CitedBy_id | crossref_primary_10_1016_j_ins_2015_07_051 crossref_primary_10_1016_j_asoc_2012_09_026 crossref_primary_10_1007_s00500_012_0881_x crossref_primary_10_1162_evco_a_00292 crossref_primary_10_1016_j_vlsi_2016_06_003 crossref_primary_10_1080_20476965_2021_1966324 crossref_primary_10_1016_j_ins_2018_03_042 crossref_primary_10_1016_j_imu_2020_100408 crossref_primary_10_1016_j_ins_2013_09_021 crossref_primary_10_1016_j_cor_2016_09_005 crossref_primary_10_1088_1757_899X_377_1_012149 crossref_primary_10_1155_2014_539128 crossref_primary_10_1007_s10479_015_2032_0 crossref_primary_10_1016_j_matpr_2017_11_367 crossref_primary_10_4304_jnw_9_3_754_761 crossref_primary_10_3788_AOS231814 crossref_primary_10_1016_j_asoc_2013_07_019 |
| Cites_doi | 10.1162/106365600750078808 10.1109/TEVC.2005.843751 10.1109/TEVC.2008.2003010 10.1162/1063656041774983 10.1080/00207169108804011 10.2307/3001968 10.1126/science.220.4598.671 10.1016/0004-3702(95)00124-7 10.1109/TEVC.2009.2011992 10.1016/B978-0-08-094832-4.50013-1 10.1145/937503.937505 10.1137/1.9780898718300 10.1016/j.asoc.2008.09.008 10.1016/S0020-0190(03)00222-9 10.1007/s00500-007-0265-9 10.1109/TEVC.2008.924428 10.1007/0-306-48056-5_10 10.1109/4235.585893 10.1162/evco.2010.18.1.18102 10.1007/s00500-009-0506-1 10.1109/21.257766 10.1109/TEVC.2008.2011742 10.1016/j.asoc.2009.08.007 10.1007/BF02022562 10.1016/j.asoc.2009.08.033 10.1109/TEVC.2005.860765 10.1007/s00500-008-0392-y 10.1016/S0360-8352(99)00075-3 10.1016/j.asoc.2011.02.032 10.1016/0167-8191(94)00071-H 10.1109/TSMCB.2005.843972 10.1109/TEVC.2008.2003008 10.1007/s00500-004-0377-4 10.1007/BF01759050 10.1016/j.swevo.2011.02.002 10.1287/ijoc.1080.0276 10.1016/j.cor.2009.02.010 10.1016/j.asoc.2005.02.006 10.1214/aoms/1177730491 10.1109/TEVC.2007.895272 10.1007/s10732-008-9080-4 10.1016/j.ejor.2006.06.043 10.1023/A:1016540724870 10.1109/TPAMI.2009.14 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier B.V. |
| Copyright_xml | – notice: 2011 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2011.11.007 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| EndPage | 588 |
| ExternalDocumentID | 10_1016_j_asoc_2011_11_007 S1568494611004315 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 53G 5GY 5VS 6J9 7-5 71M 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSV SSZ T5K UHS UNMZH ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-cc6fa2c491745b474cb46d742de51b6c52a75d1accb14e57d8fe9ac72122ad3e3 |
| IEDL.DBID | .~1 |
| ISSN | 1568-4946 |
| IngestDate | Thu Apr 24 22:52:26 EDT 2025 Wed Oct 01 01:39:20 EDT 2025 Fri Feb 23 02:27:59 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Hybrid algorithms Combinatorial optimisation Simulated annealing Evolutionary computation |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c300t-cc6fa2c491745b474cb46d742de51b6c52a75d1accb14e57d8fe9ac72122ad3e3 |
| PageCount | 16 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_asoc_2011_11_007 crossref_primary_10_1016_j_asoc_2011_11_007 elsevier_sciencedirect_doi_10_1016_j_asoc_2011_11_007 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012-02-01 |
| PublicationDateYYYYMMDD | 2012-02-01 |
| PublicationDate_xml | – month: 02 year: 2012 text: 2012-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Garcia, Fernández, Luengo, Herrera (bib0255) 2009; 13 García-Martínez, Lozano (bib0145) 2009 Queirolo, Silva, Bellon, Segundo (bib0060) 2010; 32 P. Salamon, P. Sibani, R. Frost, Facts, conjectures and improvements for simulated annealing, Monographs on Mathematical Modeling and Computation, SIAM, 2002. O’Reilly, Oppacher (bib0190) 1995 Venkata Rao, Pawar (bib0070) 2010; 10 Lozano, García-Martínez (bib0085) 2010; 37 Vrugt, Robinson, Hyman (bib0310) 2009; 13 Thompson, Bilbro (bib0125) 2005; 35 Igel, Toussaint (bib0280) 2003; 86 Aarts, Korst (bib0040) 1989 Molina, Lozano, García-Martínez, Herrera (bib0300) 2010; 18 Zar (bib0420) 1999 Mahfoud (bib0220) 1992 García-Martínez, Lozano (bib0090) 2008 Raidl (bib0025) 2006 Chen, Low, Yang (bib0290) 2009; 13 Pelikan, Goldberg, Cantú-Paz (bib0380) 2000; 8 Li, Cha, Lu (bib0055) 2010; 10 Sheskin (bib0425) 2000 Fox (bib0330) 1993; 41 Lozano, Herrera, Krasnogor, Molina (bib0100) 2004; 12 Li, Jiang (bib0115) 2000 Fernandes, Rosa (bib0205) 2008; 12 (bib0010) 2008 Raghuwanshi, Kakde (bib0175) 2006; 10 Fernandes, Rosa (bib0200) 2001 P. Suganthan, N. Hansen, J. Liang, K. Deb, Y. Chen, A. Auger, S. Tiwari, Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization, Technical Report, Nanyang Technological University, 2005. Platel, Schliebs, Kasabov (bib0360) 2009; 13 Van Laarhoven, Aarts (bib0155) 1987 Eiben, Smith (bib0080) 2003 Derrac, García, Molina, Herrera (bib0250) 2011; 1 Whitley, Rana, Dzubera, Mathias (bib0345) 1996; 85 Merz (bib0245) 2001 Yao (bib0320) 1991; 40 (bib0005) 2003 Cano, Herrera, Lozano (bib0365) 2006; 6 García-Martínez, Lozano (bib0095) 2010; 14 Harik (bib0230) 1995 Lin, Kao, Hsu (bib0120) 1993; 23 Ventresca, Tizhoosh (bib0335) 2007 De Jong, Potter, Spears (bib0390) 1997 Cheng, Wang, Yang, Huang (bib0045) 2009; 9 D. Henderson, S.H. Jacobson, A.W. Jacobson, The theory and practice of simulated annealing, Handbook of Metaheuristics 57 (2003) 287–320. Alba, Dorronsoro (bib0285) 2005; 9 Whitley (bib0140) 1989 Eiben, Schut (bib0210) 2008 Watson, Pollack (bib0395) 1999 Kauffman (bib0385) 1989; 1 Liu (bib0325) 1999; 37 Koumousis, Katsaras (bib0350) 2006; 10 Karp (bib0415) 1972 Kirkpatrick, Gelatt, Vecchi (bib0035) 1983; 220 S.W. Mahfoud, Niching methods for genetic algorithms, Ph.D. Thesis, University of Illinois, Champaign, IL, USA, 1995. Talbi (bib0030) 2002; 8 Wolpert, Macready (bib0235) 1997; 1 Aarts, Korst (bib0150) 2002 Birattari, Balaprakash, Stützle, Dorigo (bib0240) 2008; 20 Sywerda (bib0135) 1989 Mann, Whitney (bib0340) 1947; 18 García-Martínez, Lozano, Molina (bib0195) 2006 Blum, Roli (bib0015) 2003; 35 Schumacher, Vose, Whitley (bib0275) 2001 Xavier-de-Souza, Suykens, Vandewalle, Bollé (bib0130) 2006 Eshelman, Schaffer (bib0215) 1991 Goldberg, Korb, Deb (bib0375) 1989; 3 Noman, Iba (bib0105) 2008; 12 Spears (bib0400) 2000 J. Beasley, Heuristic algorithms for the unconstrained binary quadratic programming problem, Technical Report, The Management School, Imperial College, 1998. Garcia, Molina, Lozano, Herrera (bib0260) 2009; 15 Blum, Puchinger, Raidl, Roli (bib0020) 2011; 11 Bäck, Fogel, Michalewicz (bib0075) 1997 Forrest, Mitchell (bib0370) 1993 Marshall, Hinton (bib0270) 2010 Jones (bib0185) 1995 F. Gortazar, A. Duarte, M. Laguna, R. Martí, Context-independent scatter search for binary problems, Technical Report, Colorado LEEDS School of Business, University of Colorado at Boulder, 2008. Smith, Hoos, Stützle (bib0405) 2003 Mahfoud, Goldberg (bib0110) 1995; 21 Thierens (bib0180) 2004 He, Wu, Saunders (bib0295) 2009; 13 Yuen, Chow (bib0315) 2009; 13 Wilcoxon (bib0265) 1945; 1 Deb (bib0165) 2005; 9 García-Martínez, Lozano, Herrera, Molina, Sánchez (bib0170) 2008; 185 P. Strenski, S. Kirkpatrick, Analysis of finite length annealing schedules, Algorithmica 6 (1991) 346–366. Platel (10.1016/j.asoc.2011.11.007_bib0360) 2009; 13 Blum (10.1016/j.asoc.2011.11.007_bib0020) 2011; 11 García-Martínez (10.1016/j.asoc.2011.11.007_bib0145) 2009 Lozano (10.1016/j.asoc.2011.11.007_bib0085) 2010; 37 Thompson (10.1016/j.asoc.2011.11.007_bib0125) 2005; 35 Fox (10.1016/j.asoc.2011.11.007_bib0330) 1993; 41 Aarts (10.1016/j.asoc.2011.11.007_bib0040) 1989 García-Martínez (10.1016/j.asoc.2011.11.007_bib0170) 2008; 185 De Jong (10.1016/j.asoc.2011.11.007_bib0390) 1997 García-Martínez (10.1016/j.asoc.2011.11.007_bib0090) 2008 Jones (10.1016/j.asoc.2011.11.007_bib0185) 1995 Goldberg (10.1016/j.asoc.2011.11.007_bib0375) 1989; 3 Cheng (10.1016/j.asoc.2011.11.007_bib0045) 2009; 9 Whitley (10.1016/j.asoc.2011.11.007_bib0140) 1989 García-Martínez (10.1016/j.asoc.2011.11.007_bib0195) 2006 Spears (10.1016/j.asoc.2011.11.007_bib0400) 2000 Venkata Rao (10.1016/j.asoc.2011.11.007_bib0070) 2010; 10 Mahfoud (10.1016/j.asoc.2011.11.007_bib0220) 1992 Molina (10.1016/j.asoc.2011.11.007_bib0300) 2010; 18 Raidl (10.1016/j.asoc.2011.11.007_bib0025) 2006 Talbi (10.1016/j.asoc.2011.11.007_bib0030) 2002; 8 10.1016/j.asoc.2011.11.007_bib0355 Lozano (10.1016/j.asoc.2011.11.007_bib0100) 2004; 12 Noman (10.1016/j.asoc.2011.11.007_bib0105) 2008; 12 Vrugt (10.1016/j.asoc.2011.11.007_bib0310) 2009; 13 Blum (10.1016/j.asoc.2011.11.007_bib0015) 2003; 35 Thierens (10.1016/j.asoc.2011.11.007_bib0180) 2004 Fernandes (10.1016/j.asoc.2011.11.007_bib0200) 2001 10.1016/j.asoc.2011.11.007_bib0160 (10.1016/j.asoc.2011.11.007_bib0005) 2003 Garcia (10.1016/j.asoc.2011.11.007_bib0260) 2009; 15 (10.1016/j.asoc.2011.11.007_bib0010) 2008 Li (10.1016/j.asoc.2011.11.007_bib0115) 2000 Zar (10.1016/j.asoc.2011.11.007_bib0420) 1999 Alba (10.1016/j.asoc.2011.11.007_bib0285) 2005; 9 Li (10.1016/j.asoc.2011.11.007_bib0055) 2010; 10 Eshelman (10.1016/j.asoc.2011.11.007_bib0215) 1991 Merz (10.1016/j.asoc.2011.11.007_bib0245) 2001 Derrac (10.1016/j.asoc.2011.11.007_bib0250) 2011; 1 Forrest (10.1016/j.asoc.2011.11.007_bib0370) 1993 Eiben (10.1016/j.asoc.2011.11.007_bib0210) 2008 Marshall (10.1016/j.asoc.2011.11.007_bib0270) 2010 Sheskin (10.1016/j.asoc.2011.11.007_bib0425) 2000 Cano (10.1016/j.asoc.2011.11.007_bib0365) 2006; 6 Queirolo (10.1016/j.asoc.2011.11.007_bib0060) 2010; 32 Sywerda (10.1016/j.asoc.2011.11.007_bib0135) 1989 Wolpert (10.1016/j.asoc.2011.11.007_bib0235) 1997; 1 10.1016/j.asoc.2011.11.007_bib0050 Koumousis (10.1016/j.asoc.2011.11.007_bib0350) 2006; 10 Deb (10.1016/j.asoc.2011.11.007_bib0165) 2005; 9 Liu (10.1016/j.asoc.2011.11.007_bib0325) 1999; 37 O’Reilly (10.1016/j.asoc.2011.11.007_bib0190) 1995 Aarts (10.1016/j.asoc.2011.11.007_bib0150) 2002 Schumacher (10.1016/j.asoc.2011.11.007_bib0275) 2001 Yao (10.1016/j.asoc.2011.11.007_bib0320) 1991; 40 Smith (10.1016/j.asoc.2011.11.007_bib0405) 2003 Birattari (10.1016/j.asoc.2011.11.007_bib0240) 2008; 20 Kirkpatrick (10.1016/j.asoc.2011.11.007_bib0035) 1983; 220 Wilcoxon (10.1016/j.asoc.2011.11.007_bib0265) 1945; 1 Lin (10.1016/j.asoc.2011.11.007_bib0120) 1993; 23 Bäck (10.1016/j.asoc.2011.11.007_bib0075) 1997 Igel (10.1016/j.asoc.2011.11.007_bib0280) 2003; 86 Whitley (10.1016/j.asoc.2011.11.007_bib0345) 1996; 85 He (10.1016/j.asoc.2011.11.007_bib0295) 2009; 13 10.1016/j.asoc.2011.11.007_bib0410 Mahfoud (10.1016/j.asoc.2011.11.007_bib0110) 1995; 21 10.1016/j.asoc.2011.11.007_bib0065 Watson (10.1016/j.asoc.2011.11.007_bib0395) 1999 Eiben (10.1016/j.asoc.2011.11.007_bib0080) 2003 Mann (10.1016/j.asoc.2011.11.007_bib0340) 1947; 18 Pelikan (10.1016/j.asoc.2011.11.007_bib0380) 2000; 8 García-Martínez (10.1016/j.asoc.2011.11.007_bib0095) 2010; 14 Karp (10.1016/j.asoc.2011.11.007_bib0415) 1972 Raghuwanshi (10.1016/j.asoc.2011.11.007_bib0175) 2006; 10 10.1016/j.asoc.2011.11.007_bib0305 Xavier-de-Souza (10.1016/j.asoc.2011.11.007_bib0130) 2006 Ventresca (10.1016/j.asoc.2011.11.007_bib0335) 2007 Harik (10.1016/j.asoc.2011.11.007_bib0230) 1995 Garcia (10.1016/j.asoc.2011.11.007_bib0255) 2009; 13 Chen (10.1016/j.asoc.2011.11.007_bib0290) 2009; 13 Yuen (10.1016/j.asoc.2011.11.007_bib0315) 2009; 13 Kauffman (10.1016/j.asoc.2011.11.007_bib0385) 1989; 1 Van Laarhoven (10.1016/j.asoc.2011.11.007_bib0155) 1987 Fernandes (10.1016/j.asoc.2011.11.007_bib0205) 2008; 12 10.1016/j.asoc.2011.11.007_bib0225 |
| References_xml | – year: 1997 ident: bib0075 article-title: Handbook of Evolutionary Computation – volume: 15 start-page: 617 year: 2009 end-page: 644 ident: bib0260 article-title: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization publication-title: J. Heuristics – volume: 41 start-page: 47 year: 1993 end-page: 67 ident: bib0330 article-title: Integrating and accelerating tabu search, simulated annealing, and genetic algorithms publication-title: Ann. Oper. Res. – volume: 13 start-page: 959 year: 2009 end-page: 977 ident: bib0255 article-title: A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability publication-title: Soft Comput. – volume: 220 start-page: 671 year: 1983 end-page: 680 ident: bib0035 article-title: Optimization by simulated annealing publication-title: Science – volume: 9 start-page: 236 year: 2005 end-page: 253 ident: bib0165 article-title: A population-based algorithm-generator for real-parameter optimization publication-title: Soft Comput. – volume: 9 start-page: 126 year: 2005 end-page: 142 ident: bib0285 article-title: The exploration/exploitation tradeoff in dynamic cellular algorithms publication-title: IEEE Trans. Evol. Comput. – year: 2000 ident: bib0400 article-title: Evolutionary Algorithms: The Role of Mutation and Recombination – start-page: 18 year: 2010 end-page: 23 ident: bib0270 article-title: Beyond no free lunch: realistic algorithms for arbitrary problem classes publication-title: IEEE Congress on Evolutionary Computation – reference: P. Suganthan, N. Hansen, J. Liang, K. Deb, Y. Chen, A. Auger, S. Tiwari, Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization, Technical Report, Nanyang Technological University, 2005. – volume: 37 start-page: 481 year: 2010 end-page: 497 ident: bib0085 article-title: Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report publication-title: Comput. Oper. Res. – volume: 37 start-page: 285 year: 1999 end-page: 288 ident: bib0325 article-title: The impact of neighbourhood size on the process of simulated annealing: computational experiments on the flowshop scheduling problem publication-title: Comput. Ind. Eng. – volume: 35 start-page: 268 year: 2003 end-page: 308 ident: bib0015 article-title: Metaheuristics in combinatorial optimization: overview and conceptual comparison publication-title: ACM Comput. Surv. – start-page: 116 year: 1989 end-page: 121 ident: bib0140 article-title: The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best publication-title: Proc. of the Int. Conf. on Genetic Algorithms – volume: 13 start-page: 661 year: 2009 end-page: 673 ident: bib0290 article-title: Preserving and exploiting genetic diversity in evolutionary programming algorithms publication-title: IEEE Trans. Evol. Comput. – reference: P. Strenski, S. Kirkpatrick, Analysis of finite length annealing schedules, Algorithmica 6 (1991) 346–366. – volume: 12 start-page: 955 year: 2008 end-page: 979 ident: bib0205 article-title: Self-adjusting the intensity of assortative mating in genetic algorithms publication-title: Soft Comput. – start-page: 109 year: 1993 end-page: 126 ident: bib0370 article-title: Relative building block fitness and the building block hypothesis publication-title: Foundations of Genetic Algorithms 2. – year: 1989 ident: bib0040 article-title: Simulated Annealing and Boltzmann Machines – year: 2008 ident: bib0010 publication-title: Advances in Metaheuristics for Hard Optimization. Natural Computing – year: 2006 ident: bib0130 article-title: Cooperative behavior in coupled simulated annealing processes with variance control publication-title: Symposium on Nonlinear Theory and Its Applications – year: 2002 ident: bib0150 article-title: Selected topics in simulated annealing publication-title: Essays and Surveys in Metaheuristics – volume: 3 start-page: 493 year: 1989 end-page: 530 ident: bib0375 article-title: Messy genetic algorithms: motivation, analysis, and first results publication-title: Complex Syst. – year: 2000 ident: bib0425 article-title: The Handbook of Parametric and Nonparametric Statistical Procedures – volume: 10 start-page: 445 year: 2010 end-page: 456 ident: bib0070 article-title: Parameter optimization of a multi-pass milling process using non-traditional optimization algorithms publication-title: Appl. Soft Comput. – volume: 14 start-page: 1117 year: 2010 end-page: 1139 ident: bib0095 article-title: Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics publication-title: Soft Comput. – volume: 12 start-page: 273 year: 2004 end-page: 302 ident: bib0100 article-title: Real-coded memetic algorithms with crossover hill-climbing publication-title: Evol. Comput. – volume: 13 start-page: 454 year: 2009 end-page: 472 ident: bib0315 article-title: A genetic algorithm that adaptively mutates and never revisits publication-title: IEEE Trans. Evol. Comput. – volume: 40 start-page: 169 year: 1991 end-page: 189 ident: bib0320 article-title: Simulated annealing with extended neighbourhood publication-title: Int. J. Comput. Math. – year: 2003 ident: bib0080 article-title: Introduction to Evolutionary Computing – volume: 1 start-page: 80 year: 1945 end-page: 83 ident: bib0265 article-title: Individual comparisons by ranking methods publication-title: Biometrics – volume: 86 start-page: 317 year: 2003 end-page: 321 ident: bib0280 article-title: On classes of functions for which no free lunch results hold publication-title: Information processing letters – start-page: 73 year: 1995 end-page: 80 ident: bib0185 article-title: Crossover, macromutation, and population-based search publication-title: Proc. of the Sixth Int. Conf. on Genetic Algorithms – volume: 8 start-page: 311 year: 2000 end-page: 340 ident: bib0380 article-title: Linkage problem, distribution estimation, and bayesian networks publication-title: Evol. Comput. – volume: 11 start-page: 4135 year: 2011 end-page: 4151 ident: bib0020 article-title: Hybridmetaheuristics in combinatorial optimization: a survey publication-title: Appl. Soft Comput. – start-page: 129 year: 2003 end-page: 144 ident: bib0405 article-title: Iterated robust tabu search for MAX-SAT publication-title: Proc. of the Canadian Society for Computational Studies of Intelligence Conf. – volume: 9 start-page: 677 year: 2009 end-page: 684 ident: bib0045 article-title: A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks publication-title: Appl. Soft Comput. – start-page: 85 year: 1972 end-page: 103 ident: bib0415 article-title: Reducibility among combinatorial problems publication-title: Complexity of Computer Computations – volume: 10 start-page: 592 year: 2010 end-page: 601 ident: bib0055 article-title: A parallel simulated annealing algorithm based on functional feature tree modeling for 3D engineering layout design publication-title: Appl. Soft Comput. – volume: 1 start-page: 67 year: 1997 end-page: 82 ident: bib0235 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. – volume: 35 start-page: 625 year: 2005 end-page: 632 ident: bib0125 article-title: Sample-sort simulated annealing publication-title: IEEE Trans. Syst. Man, Cybern. B – start-page: 27 year: 1992 end-page: 36 ident: bib0220 article-title: Crowding and preselection revised publication-title: Parallel Problem Solving from Nature – year: 1987 ident: bib0155 article-title: Simulated Annealing: Theory and Applications – volume: 18 start-page: 50 year: 1947 end-page: 60 ident: bib0340 article-title: On a test of whether one of two random variables is stochastically larger than the other publication-title: Ann. Math. Stat. – volume: 10 start-page: 19 year: 2006 end-page: 28 ident: bib0350 article-title: A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance publication-title: IEEE Trans. Evol. Comput. – reference: S.W. Mahfoud, Niching methods for genetic algorithms, Ph.D. Thesis, University of Illinois, Champaign, IL, USA, 1995. – start-page: 186 year: 2007 end-page: 192 ident: bib0335 article-title: Simulated annealing with opposite neighbors publication-title: Proc. of the IEEE Symposium on Foundations of Computational Intelligence – volume: 6 start-page: 323 year: 2006 end-page: 332 ident: bib0365 article-title: On the combination of evolutionary algorithms and stratified strategies for training set selection in data mining publication-title: Appl. Soft Comput. – start-page: 1413 year: 1999 ident: bib0395 article-title: Hierarchically consistent test problems for genetic algorithms publication-title: Proc. of the Congress on Evolutionary Computation – year: 2003 ident: bib0005 publication-title: Handbook of Metaheuristics – volume: 85 start-page: 245 year: 1996 end-page: 276 ident: bib0345 article-title: Evaluating evolutionary algorithms publication-title: Artif. Intell. – start-page: 2 year: 1989 end-page: 9 ident: bib0135 article-title: Uniform crossover in genetic algorithms publication-title: Proc. of the Int. Conf. on Genetic Algorithms – volume: 1 start-page: 527 year: 1989 end-page: 618 ident: bib0385 article-title: Adaptation on rugged fitness landscapes publication-title: Lec. Sci. Complex – volume: 21 start-page: 1 year: 1995 end-page: 28 ident: bib0110 article-title: Parallel recombinative simulated annealing: a genetic algorithm publication-title: Parallel Comput. – volume: 8 start-page: 541 year: 2002 end-page: 564 ident: bib0030 article-title: A taxonomy of hybrid metaheuristics publication-title: J. Heuristics – start-page: 573 year: 1995 end-page: 578 ident: bib0190 article-title: Hybridized crossover-based search techniques for program discovery publication-title: Proc. of the World Conf. on Evolutionary Computation – volume: 13 start-page: 973 year: 2009 end-page: 990 ident: bib0295 article-title: Group search optimizer: an optimization algorithm inspired by animal searching behavior publication-title: IEEE Trans. Evol. Comput. – volume: 13 start-page: 1218 year: 2009 end-page: 1232 ident: bib0360 article-title: Quantum-inspired evolutionary algorithm publication-title: IEEE Trans. Evol. Comput. – start-page: 565 year: 2001 end-page: 570 ident: bib0275 article-title: The no free lunch theorem and description length publication-title: Genetic and Evolutionary Computation Conference (GECCO) – volume: 185 start-page: 1088 year: 2008 end-page: 1113 ident: bib0170 article-title: Global and local real-coded genetic algorithms based on parent-centric crossover operators publication-title: Eur. J. Oper. Res. – start-page: 24 year: 1995 end-page: 31 ident: bib0230 article-title: Finding multimodal solutions using restricted tournament selection publication-title: Proc. of the Int. Conf. on Genetic Algorithms – volume: 18 start-page: 27 year: 2010 end-page: 63 ident: bib0300 article-title: Memetic algorithms for continuous optimization based on local search chains publication-title: Evol. Comput. – start-page: 60 year: 2001 end-page: 66 ident: bib0200 article-title: A study on non-random mating and varying population size in genetic algorithms using a royal road function publication-title: Proc. of the Congress on Evolutionary Computation – reference: J. Beasley, Heuristic algorithms for the unconstrained binary quadratic programming problem, Technical Report, The Management School, Imperial College, 1998. – reference: D. Henderson, S.H. Jacobson, A.W. Jacobson, The theory and practice of simulated annealing, Handbook of Metaheuristics 57 (2003) 287–320. – volume: 12 start-page: 107 year: 2008 end-page: 125 ident: bib0105 article-title: Accelerating differential evolution using an adaptive local search publication-title: IEEE Trans. Evol. Comput. – volume: 20 start-page: 644 year: 2008 end-page: 658 ident: bib0240 article-title: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem publication-title: INFORMS J. Comput. – reference: F. Gortazar, A. Duarte, M. Laguna, R. Martí, Context-independent scatter search for binary problems, Technical Report, Colorado LEEDS School of Business, University of Colorado at Boulder, 2008. – start-page: 168 year: 2001 end-page: 173 ident: bib0245 article-title: On the performance of memetic algorithms in combinatorial optimization publication-title: Second Workshop on Memetic Algorithms, Genetic and Evolutionary Computation Conference – volume: 23 start-page: 1752 year: 1993 end-page: 1767 ident: bib0120 article-title: Applying the genetic approach to simulated annealing in solving some np-hard problems publication-title: IEEE Trans. Syst. Man Cybern. – start-page: 115 year: 1991 end-page: 122 ident: bib0215 article-title: Preventing premature convergence in genetic algorithms by preventing incest publication-title: Int. Conf. on Genetic Algorithms – volume: 10 start-page: 247 year: 2006 end-page: 255 ident: bib0175 article-title: Probability distribution based recombination operator to solve unimodal and multimodal problems publication-title: Int. J. Knowl. Intell. Eng. Syst. – volume: 13 start-page: 243 year: 2009 end-page: 259 ident: bib0310 article-title: Self-adaptive multimethod search for global optimization in real-parameter spaces publication-title: IEEE Trans. Evol. Comput. – start-page: 192 year: 2006 end-page: 201 ident: bib0195 article-title: A local genetic algorithm for binary-coded problems publication-title: Proc. of the Int. Conf. on Parallel Problem Solving from Nature – volume: 1 start-page: 3 year: 2011 end-page: 18 ident: bib0250 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. – year: 1999 ident: bib0420 article-title: Biostatistical Analysis – reference: P. Salamon, P. Sibani, R. Frost, Facts, conjectures and improvements for simulated annealing, Monographs on Mathematical Modeling and Computation, SIAM, 2002. – start-page: 193 year: 2000 end-page: 198 ident: bib0115 article-title: A novel stochastic optimization algorithm. publication-title: IEEE Trans. Syst. Man Cybern. B – start-page: 153 year: 2008 end-page: 177 ident: bib0210 article-title: New ways to calibrate evolutionary algorithms publication-title: Advances in Metaheuristics for Hard Optimization – start-page: 2569 year: 2009 end-page: 2576 ident: bib0145 article-title: Simulated annealing based on local genetic search publication-title: Proc. of the IEEE Int. Conf. Evolutionary Computation – start-page: 234 year: 2004 end-page: 245 ident: bib0180 article-title: Population-based iterated local search: restricting neighborhood search by crossover publication-title: Proc. of the Genetic and Evolutionary Computation Conf. – volume: 32 start-page: 206 year: 2010 end-page: 219 ident: bib0060 article-title: 3d face recognition using simulated annealing and the surface interpenetration measure publication-title: IEEE Trans. Pattern Anal. Mach. Intell. – start-page: 1 year: 2006 end-page: 12 ident: bib0025 article-title: A unified view on hybrid metaheuristics publication-title: Hybrid Metaheuristics – start-page: 338 year: 1997 end-page: 345 ident: bib0390 article-title: Using problem generators to explore the effects of epistasis publication-title: Proc. of the Int. Conf. on Genetic Algorithms – start-page: 199 year: 2008 end-page: 221 ident: bib0090 article-title: Local search based on genetic algorithms publication-title: Advances in Metaheuristics for Hard Optimization. Natural Computing – volume: 8 start-page: 311 year: 2000 ident: 10.1016/j.asoc.2011.11.007_bib0380 article-title: Linkage problem, distribution estimation, and bayesian networks publication-title: Evol. Comput. doi: 10.1162/106365600750078808 – volume: 9 start-page: 126 year: 2005 ident: 10.1016/j.asoc.2011.11.007_bib0285 article-title: The exploration/exploitation tradeoff in dynamic cellular algorithms publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2005.843751 – volume: 13 start-page: 1218 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0360 article-title: Quantum-inspired evolutionary algorithm publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2008.2003010 – start-page: 199 year: 2008 ident: 10.1016/j.asoc.2011.11.007_bib0090 article-title: Local search based on genetic algorithms – volume: 12 start-page: 273 year: 2004 ident: 10.1016/j.asoc.2011.11.007_bib0100 article-title: Real-coded memetic algorithms with crossover hill-climbing publication-title: Evol. Comput. doi: 10.1162/1063656041774983 – volume: 10 start-page: 247 year: 2006 ident: 10.1016/j.asoc.2011.11.007_bib0175 article-title: Probability distribution based recombination operator to solve unimodal and multimodal problems publication-title: Int. J. Knowl. Intell. Eng. Syst. – volume: 40 start-page: 169 year: 1991 ident: 10.1016/j.asoc.2011.11.007_bib0320 article-title: Simulated annealing with extended neighbourhood publication-title: Int. J. Comput. Math. doi: 10.1080/00207169108804011 – volume: 1 start-page: 527 year: 1989 ident: 10.1016/j.asoc.2011.11.007_bib0385 article-title: Adaptation on rugged fitness landscapes publication-title: Lec. Sci. Complex – year: 2006 ident: 10.1016/j.asoc.2011.11.007_bib0130 article-title: Cooperative behavior in coupled simulated annealing processes with variance control – volume: 1 start-page: 80 year: 1945 ident: 10.1016/j.asoc.2011.11.007_bib0265 article-title: Individual comparisons by ranking methods publication-title: Biometrics doi: 10.2307/3001968 – volume: 220 start-page: 671 year: 1983 ident: 10.1016/j.asoc.2011.11.007_bib0035 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 85 start-page: 245 year: 1996 ident: 10.1016/j.asoc.2011.11.007_bib0345 article-title: Evaluating evolutionary algorithms publication-title: Artif. Intell. doi: 10.1016/0004-3702(95)00124-7 – volume: 13 start-page: 973 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0295 article-title: Group search optimizer: an optimization algorithm inspired by animal searching behavior publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2009.2011992 – start-page: 192 year: 2006 ident: 10.1016/j.asoc.2011.11.007_bib0195 article-title: A local genetic algorithm for binary-coded problems – start-page: 109 year: 1993 ident: 10.1016/j.asoc.2011.11.007_bib0370 article-title: Relative building block fitness and the building block hypothesis doi: 10.1016/B978-0-08-094832-4.50013-1 – volume: 35 start-page: 268 year: 2003 ident: 10.1016/j.asoc.2011.11.007_bib0015 article-title: Metaheuristics in combinatorial optimization: overview and conceptual comparison publication-title: ACM Comput. Surv. doi: 10.1145/937503.937505 – ident: 10.1016/j.asoc.2011.11.007_bib0065 doi: 10.1137/1.9780898718300 – volume: 9 start-page: 677 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0045 article-title: A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2008.09.008 – volume: 86 start-page: 317 year: 2003 ident: 10.1016/j.asoc.2011.11.007_bib0280 article-title: On classes of functions for which no free lunch results hold publication-title: Information processing letters doi: 10.1016/S0020-0190(03)00222-9 – start-page: 338 year: 1997 ident: 10.1016/j.asoc.2011.11.007_bib0390 article-title: Using problem generators to explore the effects of epistasis – volume: 12 start-page: 955 year: 2008 ident: 10.1016/j.asoc.2011.11.007_bib0205 article-title: Self-adjusting the intensity of assortative mating in genetic algorithms publication-title: Soft Comput. doi: 10.1007/s00500-007-0265-9 – ident: 10.1016/j.asoc.2011.11.007_bib0225 – start-page: 2569 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0145 article-title: Simulated annealing based on local genetic search – volume: 13 start-page: 243 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0310 article-title: Self-adaptive multimethod search for global optimization in real-parameter spaces publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2008.924428 – year: 1989 ident: 10.1016/j.asoc.2011.11.007_bib0040 – ident: 10.1016/j.asoc.2011.11.007_bib0050 doi: 10.1007/0-306-48056-5_10 – volume: 1 start-page: 67 year: 1997 ident: 10.1016/j.asoc.2011.11.007_bib0235 article-title: No free lunch theorems for optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.585893 – ident: 10.1016/j.asoc.2011.11.007_bib0355 – volume: 18 start-page: 27 year: 2010 ident: 10.1016/j.asoc.2011.11.007_bib0300 article-title: Memetic algorithms for continuous optimization based on local search chains publication-title: Evol. Comput. doi: 10.1162/evco.2010.18.1.18102 – volume: 14 start-page: 1117 year: 2010 ident: 10.1016/j.asoc.2011.11.007_bib0095 article-title: Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics publication-title: Soft Comput. doi: 10.1007/s00500-009-0506-1 – volume: 23 start-page: 1752 year: 1993 ident: 10.1016/j.asoc.2011.11.007_bib0120 article-title: Applying the genetic approach to simulated annealing in solving some np-hard problems publication-title: IEEE Trans. Syst. Man Cybern. doi: 10.1109/21.257766 – year: 1999 ident: 10.1016/j.asoc.2011.11.007_bib0420 – volume: 13 start-page: 661 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0290 article-title: Preserving and exploiting genetic diversity in evolutionary programming algorithms publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2008.2011742 – year: 2008 ident: 10.1016/j.asoc.2011.11.007_bib0010 – volume: 10 start-page: 445 year: 2010 ident: 10.1016/j.asoc.2011.11.007_bib0070 article-title: Parameter optimization of a multi-pass milling process using non-traditional optimization algorithms publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.08.007 – volume: 3 start-page: 493 year: 1989 ident: 10.1016/j.asoc.2011.11.007_bib0375 article-title: Messy genetic algorithms: motivation, analysis, and first results publication-title: Complex Syst. – year: 1987 ident: 10.1016/j.asoc.2011.11.007_bib0155 – volume: 41 start-page: 47 year: 1993 ident: 10.1016/j.asoc.2011.11.007_bib0330 article-title: Integrating and accelerating tabu search, simulated annealing, and genetic algorithms publication-title: Ann. Oper. Res. doi: 10.1007/BF02022562 – volume: 10 start-page: 592 year: 2010 ident: 10.1016/j.asoc.2011.11.007_bib0055 article-title: A parallel simulated annealing algorithm based on functional feature tree modeling for 3D engineering layout design publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.08.033 – volume: 10 start-page: 19 year: 2006 ident: 10.1016/j.asoc.2011.11.007_bib0350 article-title: A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2005.860765 – year: 2003 ident: 10.1016/j.asoc.2011.11.007_bib0005 – volume: 13 start-page: 959 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0255 article-title: A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability publication-title: Soft Comput. doi: 10.1007/s00500-008-0392-y – volume: 37 start-page: 285 year: 1999 ident: 10.1016/j.asoc.2011.11.007_bib0325 article-title: The impact of neighbourhood size on the process of simulated annealing: computational experiments on the flowshop scheduling problem publication-title: Comput. Ind. Eng. doi: 10.1016/S0360-8352(99)00075-3 – start-page: 18 year: 2010 ident: 10.1016/j.asoc.2011.11.007_bib0270 article-title: Beyond no free lunch: realistic algorithms for arbitrary problem classes – year: 1997 ident: 10.1016/j.asoc.2011.11.007_bib0075 – volume: 11 start-page: 4135 issue: 6 year: 2011 ident: 10.1016/j.asoc.2011.11.007_bib0020 article-title: Hybridmetaheuristics in combinatorial optimization: a survey publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2011.02.032 – volume: 21 start-page: 1 year: 1995 ident: 10.1016/j.asoc.2011.11.007_bib0110 article-title: Parallel recombinative simulated annealing: a genetic algorithm publication-title: Parallel Comput. doi: 10.1016/0167-8191(94)00071-H – start-page: 60 year: 2001 ident: 10.1016/j.asoc.2011.11.007_bib0200 article-title: A study on non-random mating and varying population size in genetic algorithms using a royal road function – volume: 35 start-page: 625 year: 2005 ident: 10.1016/j.asoc.2011.11.007_bib0125 article-title: Sample-sort simulated annealing publication-title: IEEE Trans. Syst. Man, Cybern. B doi: 10.1109/TSMCB.2005.843972 – start-page: 116 year: 1989 ident: 10.1016/j.asoc.2011.11.007_bib0140 article-title: The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best – start-page: 565 year: 2001 ident: 10.1016/j.asoc.2011.11.007_bib0275 article-title: The no free lunch theorem and description length – start-page: 129 year: 2003 ident: 10.1016/j.asoc.2011.11.007_bib0405 article-title: Iterated robust tabu search for MAX-SAT – start-page: 1 year: 2006 ident: 10.1016/j.asoc.2011.11.007_bib0025 article-title: A unified view on hybrid metaheuristics – start-page: 153 year: 2008 ident: 10.1016/j.asoc.2011.11.007_bib0210 article-title: New ways to calibrate evolutionary algorithms – start-page: 24 year: 1995 ident: 10.1016/j.asoc.2011.11.007_bib0230 article-title: Finding multimodal solutions using restricted tournament selection – start-page: 115 year: 1991 ident: 10.1016/j.asoc.2011.11.007_bib0215 article-title: Preventing premature convergence in genetic algorithms by preventing incest – volume: 13 start-page: 454 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0315 article-title: A genetic algorithm that adaptively mutates and never revisits publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2008.2003008 – year: 2000 ident: 10.1016/j.asoc.2011.11.007_bib0425 – volume: 9 start-page: 236 year: 2005 ident: 10.1016/j.asoc.2011.11.007_bib0165 article-title: A population-based algorithm-generator for real-parameter optimization publication-title: Soft Comput. doi: 10.1007/s00500-004-0377-4 – start-page: 168 year: 2001 ident: 10.1016/j.asoc.2011.11.007_bib0245 article-title: On the performance of memetic algorithms in combinatorial optimization – ident: 10.1016/j.asoc.2011.11.007_bib0160 doi: 10.1007/BF01759050 – start-page: 234 year: 2004 ident: 10.1016/j.asoc.2011.11.007_bib0180 article-title: Population-based iterated local search: restricting neighborhood search by crossover – volume: 1 start-page: 3 year: 2011 ident: 10.1016/j.asoc.2011.11.007_bib0250 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2011.02.002 – volume: 20 start-page: 644 year: 2008 ident: 10.1016/j.asoc.2011.11.007_bib0240 article-title: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1080.0276 – volume: 37 start-page: 481 year: 2010 ident: 10.1016/j.asoc.2011.11.007_bib0085 article-title: Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.02.010 – start-page: 186 year: 2007 ident: 10.1016/j.asoc.2011.11.007_bib0335 article-title: Simulated annealing with opposite neighbors – start-page: 85 year: 1972 ident: 10.1016/j.asoc.2011.11.007_bib0415 article-title: Reducibility among combinatorial problems – volume: 6 start-page: 323 year: 2006 ident: 10.1016/j.asoc.2011.11.007_bib0365 article-title: On the combination of evolutionary algorithms and stratified strategies for training set selection in data mining publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2005.02.006 – volume: 18 start-page: 50 year: 1947 ident: 10.1016/j.asoc.2011.11.007_bib0340 article-title: On a test of whether one of two random variables is stochastically larger than the other publication-title: Ann. Math. Stat. doi: 10.1214/aoms/1177730491 – start-page: 2 year: 1989 ident: 10.1016/j.asoc.2011.11.007_bib0135 article-title: Uniform crossover in genetic algorithms – ident: 10.1016/j.asoc.2011.11.007_bib0410 – year: 2000 ident: 10.1016/j.asoc.2011.11.007_bib0400 – ident: 10.1016/j.asoc.2011.11.007_bib0305 – volume: 12 start-page: 107 year: 2008 ident: 10.1016/j.asoc.2011.11.007_bib0105 article-title: Accelerating differential evolution using an adaptive local search publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2007.895272 – volume: 15 start-page: 617 year: 2009 ident: 10.1016/j.asoc.2011.11.007_bib0260 article-title: A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization publication-title: J. Heuristics doi: 10.1007/s10732-008-9080-4 – year: 2002 ident: 10.1016/j.asoc.2011.11.007_bib0150 article-title: Selected topics in simulated annealing – volume: 185 start-page: 1088 year: 2008 ident: 10.1016/j.asoc.2011.11.007_bib0170 article-title: Global and local real-coded genetic algorithms based on parent-centric crossover operators publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.06.043 – start-page: 73 year: 1995 ident: 10.1016/j.asoc.2011.11.007_bib0185 article-title: Crossover, macromutation, and population-based search – start-page: 1413 year: 1999 ident: 10.1016/j.asoc.2011.11.007_bib0395 article-title: Hierarchically consistent test problems for genetic algorithms – year: 2003 ident: 10.1016/j.asoc.2011.11.007_bib0080 – start-page: 573 year: 1995 ident: 10.1016/j.asoc.2011.11.007_bib0190 article-title: Hybridized crossover-based search techniques for program discovery – start-page: 193 year: 2000 ident: 10.1016/j.asoc.2011.11.007_bib0115 article-title: A novel stochastic optimization algorithm. publication-title: IEEE Trans. Syst. Man Cybern. B – volume: 8 start-page: 541 year: 2002 ident: 10.1016/j.asoc.2011.11.007_bib0030 article-title: A taxonomy of hybrid metaheuristics publication-title: J. Heuristics doi: 10.1023/A:1016540724870 – volume: 32 start-page: 206 year: 2010 ident: 10.1016/j.asoc.2011.11.007_bib0060 article-title: 3d face recognition using simulated annealing and the surface interpenetration measure publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/TPAMI.2009.14 – start-page: 27 year: 1992 ident: 10.1016/j.asoc.2011.11.007_bib0220 article-title: Crowding and preselection revised |
| SSID | ssj0016928 |
| Score | 2.1342342 |
| Snippet | [Display omitted]
► We propose a hybrid algorithm for binary combinatorial problems. ► It is an evolutionary algorithm performing like a simulated annealing... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 573 |
| SubjectTerms | Combinatorial optimisation Evolutionary computation Hybrid algorithms Simulated annealing |
| Title | A simulated annealing method based on a specialised evolutionary algorithm |
| URI | https://dx.doi.org/10.1016/j.asoc.2011.11.007 |
| Volume | 12 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier Science Direct Freedom Collection customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: ACRLP dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: AIKHN dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: .~1 dateStart: 20010601 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-9681 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0016928 issn: 1568-4946 databaseCode: AKRWK dateStart: 20010601 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5KvXjxLdZH2YM3ic1jd5McS7HUKkXUQm9hX9FIm5Y2Cl787e4km6IgPXgKWWYhfJnM7JCZ70PokugwkCmFvjCXOoS7kSNcKp0A6L6l0IFOS7bPERuMyXBCJw3Uq2dhoK3Sxv4qppfR2q50LJqdRZZ1nkzlEZGYsJL0LCgHzQkJQcXg-mvd5uGxuNRXBWMHrO3gTNXjxQ0CFY0nMHmCpOxfyelHwunvoR17UsTd6mH2UUPnB2i3VmHA9qM8RMMuXmUzUOHSCnMTNjlMmONKGhpDllJ4nmOOV5XUfAYL-sO6HF9-Yj59mS-z4nV2hMb9m-fewLEKCY4MXLdwpGQp9yUxNRehgoRECsKUqXaVpp5gkvo8pMrjUgqPaBqqKNUxl6bq832uAh0co2Y-z_UJwlFoXotnUiZLFWFRyGnM3VQQCT_SlPRbyKuhSaSlDwcVi2lS94m9JQBnAnCauiIxcLbQ1XrPoiLP2GhNa8STXy6QmOi-Yd_pP_edoW1z51ct2OeoWSzf9YU5YRSiXbpQG211e4_3D3C9vRuMvgH4ktJh |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELWqcoALO6KsPnBDoVnsLMeqoiql9EIr9RZ5CwR1UxuQuPDteGKnAgn1wNXxSNHLeMajzLyH0A1RUSAyCn1hLnUIc2OHu1Q4AdB9C64ClZVsn4OwOyK9MR3XULuahYG2Shv7TUwvo7VdaVo0m4s8bz7ryiMmCQlL0rMABs23CPUjqMDuvtZ9Hl6YlAKrsNuB7XZyxjR5MQ2B4fEEKk_QlP0rO_3IOJ19tGuvirhl3uYA1dTsEO1VMgzYnsoj1GvhVT4FGS4lMdNxk8GIOTba0BjSlMTzGWZ4ZbTmc1hQH9bn2PITs8nLfJkXr9NjNOrcD9tdx0okOCJw3cIRIsyYL4guugjlJCKCk1Dqclcq6vFQUJ9FVHpMCO4RRSMZZyphQpd9vs9koIITVJ_NZ-oU4TjS38XTOTPMJAnjiNGEuRknAv6kSeE3kFdBkwrLHw4yFpO0ahR7SwHOFODUhUWq4Wyg27XNwrBnbNxNK8TTXz6Q6vC-we7sn3bXaLs7fOqn_YfB4zna0U980499gerF8l1d6utGwa9Kd_oGbnTSYQ |
| 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=A+simulated+annealing+method+based+on+a+specialised+evolutionary+algorithm&rft.jtitle=Applied+soft+computing&rft.au=Garc%C3%ADa-Mart%C3%ADnez%2C+C.&rft.au=Lozano%2C+M.&rft.au=Rodr%C3%ADguez-D%C3%ADaz%2C+F.J.&rft.date=2012-02-01&rft.issn=1568-4946&rft.volume=12&rft.issue=2&rft.spage=573&rft.epage=588&rft_id=info:doi/10.1016%2Fj.asoc.2011.11.007&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_asoc_2011_11_007 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1568-4946&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1568-4946&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1568-4946&client=summon |