Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems
Parallel memetic algorithms (PMAs) are a class of modern parallel meta-heuristics that combine evolutionary algorithms, local search, parallel and distributed computing technologies for global optimization. Recent studies on PMAs for large-scale complex combinatorial optimization problems have shown...
Saved in:
| Published in: | Soft computing (Berlin, Germany) Vol. 11; no. 9; pp. 873 - 888 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Heidelberg
Springer Nature B.V
01.07.2007
|
| Subjects: | |
| ISSN: | 1432-7643, 1433-7479 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Parallel memetic algorithms (PMAs) are a class of modern parallel meta-heuristics that combine evolutionary algorithms, local search, parallel and distributed computing technologies for global optimization. Recent studies on PMAs for large-scale complex combinatorial optimization problems have shown that they converge to high quality solutions significantly faster than canonical GAs and MAs. However, the use of local learning for every individual throughout the PMA search can be a very computationally intensive and inefficient process. This paper presents a study on two diversity-adaptive strategies, i.e., (1) diversity-based static adaptive strategy (PMA-SLS) and (2) diversity-based dynamic adaptive strategy (PMA-DLS) for controlling the local search frequency in the PMA search. Empirical study on a class of NP-hard combinatorial optimization problem, particularly large-scale quadratic assignment problems (QAPs) shows that the diversity-adaptive PMA converges to competitive solutions at significantly lower computational cost when compared to the canonical MA and PMA. Furthermore, it is found that the diversity-based dynamic adaptation strategy displays better robustness in terms of solution quality across the class of QAP problems considered. Static adaptation strategy on the other hand requires extra effort in selecting suitable parameters to suit the problems in hand. |
|---|---|
| AbstractList | Parallel memetic algorithms (PMAs) are a class of modern parallel meta-heuristics that combine evolutionary algorithms, local search, parallel and distributed computing technologies for global optimization. Recent studies on PMAs for large-scale complex combinatorial optimization problems have shown that they converge to high quality solutions significantly faster than canonical GAs and MAs. However, the use of local learning for every individual throughout the PMA search can be a very computationally intensive and inefficient process. This paper presents a study on two diversity-adaptive strategies, i.e., (1) diversity-based static adaptive strategy (PMA-SLS) and (2) diversity-based dynamic adaptive strategy (PMA-DLS) for controlling the local search frequency in the PMA search. Empirical study on a class of NP-hard combinatorial optimization problem, particularly large-scale quadratic assignment problems (QAPs) shows that the diversity-adaptive PMA converges to competitive solutions at significantly lower computational cost when compared to the canonical MA and PMA. Furthermore, it is found that the diversity-based dynamic adaptation strategy displays better robustness in terms of solution quality across the class of QAP problems considered. Static adaptation strategy on the other hand requires extra effort in selecting suitable parameters to suit the problems in hand. |
| Author | Ong, Yew Soon Lim, Meng Hiot Tang, Jing |
| Author_xml | – sequence: 1 givenname: Jing surname: Tang fullname: Tang, Jing – sequence: 2 givenname: Meng Hiot surname: Lim fullname: Lim, Meng Hiot – sequence: 3 givenname: Yew Soon surname: Ong fullname: Ong, Yew Soon |
| BookMark | eNp9kE9LAzEQxYMoaKsfwFvAc3SySZPdo_gfBC96DrO72ZqS3dQkFfTTm7aePHiaGfi994Y3I4dTmCwh5xwuOYC-SgALAAagGHDRMHVATrgUgmmpm8PdXjGtpDgms5RWABXXC3FC3K37tDG5_MWwx3UuF11jRO-tp6MdbXYdRb8M0eX3kQ4h0hT8p5uW1GNcWpo69JZ2YWzdhLlg6GkoPqP7xuzCRNcxtN6O6ZQcDeiTPfudc_J2f_d688ieXx6ebq6fWVdpkRnnoh9aaGUtZaPsYKXt6762jRYtVzXIQUMv1CAQFm2vFqjqTmiOtuO6AazEnFzsfUvwx8ambFZhE6cSaaqmMEpJXRdK76kuhpSiHUzn8u7hHNF5w8FsezX7Xk3p1Wx7Naoo-R_lOroR49c_mh_KAn7p |
| CitedBy_id | crossref_primary_10_1109_TSMCC_2011_2176486 crossref_primary_10_1007_s11432_015_5495_3 crossref_primary_10_1109_TEVC_2021_3130838 crossref_primary_10_1109_MCI_2010_936305 crossref_primary_10_1007_s00500_013_1028_4 crossref_primary_10_1007_s00500_014_1508_1 crossref_primary_10_1016_j_cja_2013_12_002 crossref_primary_10_1016_j_cor_2009_02_010 crossref_primary_10_1109_MCI_2010_936309 crossref_primary_10_1109_MCI_2010_936307 crossref_primary_10_1155_2015_963562 crossref_primary_10_1109_MCI_2010_936306 crossref_primary_10_1007_s10586_013_0321_4 crossref_primary_10_1007_s11432_015_5372_0 crossref_primary_10_1155_2015_302615 crossref_primary_10_1007_s00500_015_1971_3 crossref_primary_10_1016_j_cor_2023_106173 crossref_primary_10_1109_TEVC_2008_2009460 crossref_primary_10_1007_s00500_008_0347_3 crossref_primary_10_1007_s00500_009_0538_6 crossref_primary_10_1111_j_1467_8640_2010_00367_x crossref_primary_10_1155_2014_906028 crossref_primary_10_1016_j_neucom_2013_01_027 crossref_primary_10_1007_s12293_015_0153_2 crossref_primary_10_1109_TSMCC_2011_2174356 crossref_primary_10_1007_s12293_009_0011_1 crossref_primary_10_1007_s40747_024_01465_5 crossref_primary_10_1016_j_asoc_2018_11_044 crossref_primary_10_1109_TEVC_2011_2150754 crossref_primary_10_1007_s00500_013_1158_8 crossref_primary_10_1007_s10479_013_1500_7 crossref_primary_10_1007_s00500_008_0351_7 crossref_primary_10_1007_s00500_008_0355_3 crossref_primary_10_1016_j_engappai_2012_01_021 crossref_primary_10_1109_TASE_2012_2219860 crossref_primary_10_1016_j_asoc_2015_04_019 crossref_primary_10_3139_120_111378 crossref_primary_10_1007_s00500_018_3049_5 crossref_primary_10_1111_exsy_12666 crossref_primary_10_1016_j_asoc_2015_06_026 crossref_primary_10_3390_math7050423 crossref_primary_10_1016_j_cja_2015_01_012 crossref_primary_10_1177_0959651814530276 crossref_primary_10_1016_j_asoc_2013_03_019 crossref_primary_10_1007_s12293_012_0076_0 crossref_primary_10_1007_s12293_011_0059_6 crossref_primary_10_1177_0142331214522287 crossref_primary_10_1007_s00500_013_1183_7 crossref_primary_10_1109_JAS_2024_124320 crossref_primary_10_1016_j_ejor_2007_07_034 crossref_primary_10_1007_s00500_013_1160_1 crossref_primary_10_1109_TEVC_2011_2132725 crossref_primary_10_1109_TEVC_2014_2362558 crossref_primary_10_1155_2013_292575 crossref_primary_10_1162_evco_2010_18_1_18102 crossref_primary_10_1007_s12293_012_0083_1 crossref_primary_10_1109_TFUZZ_2011_2159799 crossref_primary_10_1007_s00521_009_0273_z crossref_primary_10_1007_s00500_008_0350_8 crossref_primary_10_1007_s00500_008_0354_4 crossref_primary_10_1007_s00500_008_0356_2 crossref_primary_10_1080_10494820_2023_2188398 crossref_primary_10_1162_evco_2009_17_2_231 crossref_primary_10_1007_s00500_010_0680_1 crossref_primary_10_1109_TNB_2015_2392782 crossref_primary_10_1109_TSMCC_2012_2188832 |
| Cites_doi | 10.1109/TEVC.2004.823471 10.1023/A:1019972523847 10.1090/dimacs/016/12 10.1016/0966-8349(95)00008-6 10.1080/07408178708975376 10.1016/j.amc.2003.08.115 10.1109/4235.974840 10.1023/A:1008293323270 10.1109/21.370197 10.1287/ijoc.2.1.33 10.1007/3-540-36605-9_3 10.1109/TSMCB.2005.856143 10.2307/1907742 10.1016/S0167-8191(05)80147-4 10.1109/CEC.1999.785529 10.1023/A:1008743718053 10.1109/4235.887234 10.1109/TEVC.2003.810752 10.1109/TEVC.2003.819944 10.1109/4235.843493 10.1109/4235.771166 10.1016/S0377-2217(03)00248-0 10.1109/CEC.2003.1299905 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag 2006. |
| Copyright_xml | – notice: Springer-Verlag 2006. |
| DBID | AAYXX CITATION 8FE 8FG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI |
| DOI | 10.1007/s00500-006-0139-6 |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials AUTh Library subscriptions: ProQuest Central Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | CrossRef Advanced Technologies & Aerospace Collection Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central Advanced Technologies & Aerospace Database ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | Advanced Technologies & Aerospace Collection |
| Database_xml | – sequence: 1 dbid: P5Z name: Advanced Technologies & Aerospace Database url: https://search.proquest.com/hightechjournals sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1433-7479 |
| EndPage | 888 |
| ExternalDocumentID | 10_1007_s00500_006_0139_6 |
| GroupedDBID | -Y2 -~C .86 .VR 06D 0R~ 0VY 1N0 1SB 203 29~ 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACSTC ACZOJ ADHHG ADHIR ADHKG ADKFA ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFFHD AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K7- KDC KOV LAS LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9P PF0 PHGZM PHGZT PQGLB PT4 PT5 QOS R89 R9I RNI ROL RPX RSV RZK S16 S1Z S27 S3B SAP SDH SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR 8FE 8FG AESKC AZQEC DWQXO GNUQQ JQ2 P62 PKEHL PQEST PQQKQ PQUKI |
| ID | FETCH-LOGICAL-c273t-113dfb0b484496efe4ed8d8e973b16804f70d36f3a05bd65a68c371aec1790a23 |
| IEDL.DBID | P5Z |
| ISICitedReferencesCount | 108 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000245852900007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1432-7643 |
| IngestDate | Wed Nov 05 03:14:33 EST 2025 Tue Nov 18 22:14:17 EST 2025 Sat Nov 29 03:19:41 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c273t-113dfb0b484496efe4ed8d8e973b16804f70d36f3a05bd65a68c371aec1790a23 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2917966478 |
| PQPubID | 2043697 |
| PageCount | 16 |
| ParticipantIDs | proquest_journals_2917966478 crossref_citationtrail_10_1007_s00500_006_0139_6 crossref_primary_10_1007_s00500_006_0139_6 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-07-00 20070701 |
| PublicationDateYYYYMMDD | 2007-07-01 |
| PublicationDate_xml | – month: 07 year: 2007 text: 2007-07-00 |
| PublicationDecade | 2000 |
| PublicationPlace | Heidelberg |
| PublicationPlace_xml | – name: Heidelberg |
| PublicationTitle | Soft computing (Berlin, Germany) |
| PublicationYear | 2007 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| References | 139_CR21 YS Ong (139_CR25) 2004; 8 H Ishibuchi (139_CR12) 2003; 7 139_CR27 YS Ong (139_CR26) 2006; 36 KC Tan (139_CR33) 2001; 5 139_CR23 NK Bambha (139_CR1) 2004; 8 J Knowles (139_CR13) 2004 P Merz (139_CR24) 2000; 4 MR Wilhelm (139_CR37) 1987; 19 P Merz (139_CR22) 1999 TC Koopmans (139_CR14) 1957; 25 MH Lim (139_CR20) 2002; 23 J. Suzuki (139_CR30) 1995; 25 Taillard (139_CR31) 1991; 17 139_CR4 139_CR3 139_CR2 MH Lim (139_CR19) 2000; 15 JH. Holland (139_CR11) 1975 139_CR10 139_CR9 KWC Ku (139_CR16) 2000; 4 M Solimanpur (139_CR29) 2004; 157 139_CR18 DE. Goldberg (139_CR8) 1989 139_CR17 R. Dawkins (139_CR5) 1976 139_CR36 139_CR15 J. Skorin-Kapov (139_CR28) 1990; 2 Taillard (139_CR32) 1995; 3 139_CR34 139_CR35 AE Eiben (139_CR7) 1999; 3 JG Digalakis (139_CR6) 2004; 158 |
| References_xml | – ident: 139_CR35 – ident: 139_CR10 – volume: 8 start-page: 137 issue: 2 year: 2004 ident: 139_CR1 publication-title: IEEE Trans Evoluti Comput. doi: 10.1109/TEVC.2004.823471 – ident: 139_CR2 – volume: 23 start-page: 47 year: 2002 ident: 139_CR20 publication-title: Comput Optim Appl. doi: 10.1023/A:1019972523847 – ident: 139_CR18 doi: 10.1090/dimacs/016/12 – volume-title: The selfish gene year: 1976 ident: 139_CR5 – volume: 3 start-page: 87 year: 1995 ident: 139_CR32 publication-title: Locat Sci. doi: 10.1016/0966-8349(95)00008-6 – volume: 19 start-page: 107 issue: 1 year: 1987 ident: 139_CR37 publication-title: IIE Trans. doi: 10.1080/07408178708975376 – start-page: 245 volume-title: New ideas in optimization. year: 1999 ident: 139_CR22 – volume: 158 start-page: 237 issue: 25 year: 2004 ident: 139_CR6 publication-title: J Appl Math Comput. doi: 10.1016/j.amc.2003.08.115 – start-page: 313 volume-title: Recent advances in memetic algorithms. year: 2004 ident: 139_CR13 – volume: 5 start-page: 565 issue: 6 year: 2001 ident: 139_CR33 publication-title: IEEE Trans Evolut Comput. doi: 10.1109/4235.974840 – ident: 139_CR21 – ident: 139_CR3 doi: 10.1023/A:1008293323270 – volume-title: Genetic algorithms in search, optimization and machine learning year: 1989 ident: 139_CR8 – ident: 139_CR27 – volume: 25 start-page: 655 issue: 4 year: 1995 ident: 139_CR30 publication-title: IEEE Trans Syst Man Cybernet. doi: 10.1109/21.370197 – volume: 2 start-page: 33 issue: 1 year: 1990 ident: 139_CR28 publication-title: ORSA J Comput. doi: 10.1287/ijoc.2.1.33 – ident: 139_CR4 doi: 10.1007/3-540-36605-9_3 – volume: 36 start-page: 141 issue: 1 year: 2006 ident: 139_CR26 publication-title: IEEE Trans Syst, Man Cybernet. doi: 10.1109/TSMCB.2005.856143 – volume: 25 start-page: 53 year: 1957 ident: 139_CR14 publication-title: Econometrica doi: 10.2307/1907742 – ident: 139_CR36 – volume: 17 start-page: 443 year: 1991 ident: 139_CR31 publication-title: Parallel Comput. doi: 10.1016/S0167-8191(05)80147-4 – ident: 139_CR9 – ident: 139_CR23 doi: 10.1109/CEC.1999.785529 – ident: 139_CR17 – volume: 15 start-page: 249 year: 2000 ident: 139_CR19 publication-title: Comput Optim Appl. doi: 10.1023/A:1008743718053 – ident: 139_CR15 – volume: 4 start-page: 337 issue: 4 year: 2000 ident: 139_CR24 publication-title: IEEE Trans Evolut Comput. doi: 10.1109/4235.887234 – volume: 7 start-page: 204 issue: 2 year: 2003 ident: 139_CR12 publication-title: IEEE Trans Evolut Comput. doi: 10.1109/TEVC.2003.810752 – volume-title: Adaptation in natural and artificial systems year: 1975 ident: 139_CR11 – volume: 8 start-page: 99 issue: 2 year: 2004 ident: 139_CR25 publication-title: IEEE Trans on Evolut Comput. doi: 10.1109/TEVC.2003.819944 – volume: 4 start-page: 31 issue: 1 year: 2000 ident: 139_CR16 publication-title: IEEE Trans Evolut Comput. doi: 10.1109/4235.843493 – volume: 3 start-page: 124 issue: 2 year: 1999 ident: 139_CR7 publication-title: IEEE Trans Evolut Comput. doi: 10.1109/4235.771166 – volume: 157 start-page: 592 issue: 3 year: 2004 ident: 139_CR29 publication-title: Eur J Oper Res. doi: 10.1016/S0377-2217(03)00248-0 – ident: 139_CR34 doi: 10.1109/CEC.2003.1299905 |
| SSID | ssj0021753 |
| Score | 2.1637957 |
| Snippet | Parallel memetic algorithms (PMAs) are a class of modern parallel meta-heuristics that combine evolutionary algorithms, local search, parallel and distributed... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 873 |
| SubjectTerms | Adaptation Adaptive algorithms Algorithms Combinatorial analysis Computer networks Convergence Distributed processing Evolutionary algorithms Global optimization Optimization Robustness (mathematics) Searching Strategy |
| Title | Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems |
| URI | https://www.proquest.com/docview/2917966478 |
| Volume | 11 |
| WOSCitedRecordID | wos000245852900007&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1433-7479 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0021753 issn: 1432-7643 databaseCode: RSV dateStart: 19970401 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB4V6KGX0qeg0JUPPVWy6iSOHZ-qQkFISKsVfQj1EvkxLkjZB2TL7-84OFtx4dJLDnlamfH4m_HMfAAffMIBqA13qoxcWh24iRh47bAUEr3TJg5kE3o6bS4vzSwH3PqcVjnaxMFQh6VPMfJPJfkVBM2lbj6vbnhijUq7q5lCYwt2ipKwPunzrP61cbhyF0qCBIQiaekddzXF0ES0Hmqqkz9dGa4erksPzfKw1pzu_u8oX8DzjDLZl3u1eAlPcPEKdkcGB5Yn9Gu4_jqmZXAb7CqZPpaagXcddmyO81ThyGz3mz6xvpozAriMdDXFIFiXUshZTyJGRmMjBzu576TNbEnvmefyTpYJa_o38OP05PvxGc_kC9wTolnzoqhCdMLJRkqjMKLE0IQGja5coRohoxahUrGyonZB1VY1vtKFRZ96ftmyegvbi-UC94BhHbX2LqoonTRom0J4TyeUseScm7APYvz1rc-dyRNBRtdueioP0mqHHDySVqv24ePmkdV9W47Hbj4chdXmGdq3_yT17vHLB_BsjOeK4hC217d_8D089Xfr6_52AjtHJ9PZxQS2zjWfDOpHx4tvP_8CIXjjqg |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwELYQRWovpU_xautDuSBZdRLHjg-oqkoRCFhxAAn1kvoxhpWyj5KFij_V39hxNl7EhRuHXpM4ku3P8_LMN4R8dtEOAKWZlXlgwijPdADPSgs5F-Cs0qFrNqEGg-riQp8ukb-pFiamVSaZ2AlqP3ExRv4lR78CTXOhqq_T3yx2jYq3q6mFxhwWR3D3B122dvdwD_d3O8_3f5x9P2B9VwHmUFXPWJYVPlhuRSWElhBAgK98BVoVNpMVF0FxX8hQGF5aL0sjK1eozICLZFYmEh2gyH-GZoSOguC0_Llw8HrWSzRB0GpFVZ9uUXlHWlp2NdzRfy80kw_14EM10Om2_dX_bVVekZe9FU2_zWH_mizB-A1ZTR0qaC-w3pLhXko7YcabaRTtNJKdNw00dASjWMFJTXOJU5pdjSga8BTPYoyx0CamyNMWIQwU18IOxzE8gaeVTvA_o758lfYNedp35PxJJvyeLI8nY1gjFMqglLNBBmGFBlNl3Dl8ILURUmu_Tnja6tr1zOuxAUhTLzijO3TUXY4hoqOW62RnMWQ6px157OOtBI66l0BtfY-MjcdffyLPD85Ojuvjw8HRJnmRYtc82yLLs-sb-EBW3O1s2F5_7MBOya-nxtE_UPg81w |
| 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=Diversity-adaptive+parallel+memetic+algorithm+for+solving+large+scale+combinatorial+optimization+problems&rft.jtitle=Soft+computing+%28Berlin%2C+Germany%29&rft.au=Tang%2C+Jing&rft.au=Lim%2C+Meng+Hiot&rft.au=Ong%2C+Yew+Soon&rft.date=2007-07-01&rft.issn=1432-7643&rft.eissn=1433-7479&rft.volume=11&rft.issue=9&rft.spage=873&rft.epage=888&rft_id=info:doi/10.1007%2Fs00500-006-0139-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00500_006_0139_6 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-7643&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-7643&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-7643&client=summon |