A learning automata-based memetic algorithm
Combing a genetic algorithm (GA) with a local search method produces a type of evolutionary algorithm known as a memetic algorithm (MA). Combining a GA with a learning automaton (LA) produces an MA named GALA, where the LA provides the local search function. GALA represents chromosomes as object mig...
Saved in:
| Published in: | Genetic programming and evolvable machines Vol. 16; no. 4; pp. 399 - 453 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.12.2015
|
| Subjects: | |
| ISSN: | 1389-2576, 1573-7632 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Combing a genetic algorithm (GA) with a local search method produces a type of evolutionary algorithm known as a memetic algorithm (MA). Combining a GA with a learning automaton (LA) produces an MA named GALA, where the LA provides the local search function. GALA represents chromosomes as object migration automata (OMAs), whose states represent the history of the local search process. Each state in an OMA has two attributes: the value of the gene (allele), and the degree of association with those values. The local search changes the degree of association between genes and their values. In GALA a chromosome’s fitness is computed using only the value of the genes. GALA is a Lamarckian learning model as it passes on the learned traits acquired by its local search method to offspring by a modification of the genotype. Herein we introduce a modified GALA (MGALA) that behaves according to a Baldwinian learning model. In MGALA the fitness function is computed using a chromosome’s fitness and the history of the local search recorded by the OMA states. In addition, in MGALA the learned traits are not passed to the offspring. Unlike GALA, MGALA uses all the information recorded in an OMA representation of the chromosome, i.e., the degree of association between genes and their alleles, and the value of a gene, to compute the fitness of genes. We used MGALA to solve two problems: object partitioning and graph isomorphism. MGALA outperformed GALA, a canonical MA, and an OMA-based method using computer simulations, in terms of solution quality and rate of convergence. |
|---|---|
| AbstractList | Combing a genetic algorithm (GA) with a local search method produces a type of evolutionary algorithm known as a memetic algorithm (MA). Combining a GA with a learning automaton (LA) produces an MA named GALA, where the LA provides the local search function. GALA represents chromosomes as object migration automata (OMAs), whose states represent the history of the local search process. Each state in an OMA has two attributes: the value of the gene (allele), and the degree of association with those values. The local search changes the degree of association between genes and their values. In GALA a chromosome’s fitness is computed using only the value of the genes. GALA is a Lamarckian learning model as it passes on the learned traits acquired by its local search method to offspring by a modification of the genotype. Herein we introduce a modified GALA (MGALA) that behaves according to a Baldwinian learning model. In MGALA the fitness function is computed using a chromosome’s fitness and the history of the local search recorded by the OMA states. In addition, in MGALA the learned traits are not passed to the offspring. Unlike GALA, MGALA uses all the information recorded in an OMA representation of the chromosome, i.e., the degree of association between genes and their alleles, and the value of a gene, to compute the fitness of genes. We used MGALA to solve two problems: object partitioning and graph isomorphism. MGALA outperformed GALA, a canonical MA, and an OMA-based method using computer simulations, in terms of solution quality and rate of convergence. |
| Author | Meybodi, M. R. Rezapoor Mirsaleh, M. |
| Author_xml | – sequence: 1 givenname: M. surname: Rezapoor Mirsaleh fullname: Rezapoor Mirsaleh, M. email: mrezapoorm@aut.ac.ir organization: Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology – sequence: 2 givenname: M. R. surname: Meybodi fullname: Meybodi, M. R. organization: Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology, Institute for Research and Fundamental Sciences, School of Computer Science |
| BookMark | eNp9j7FOwzAURS1UJNrCB7BlR4b37DiOx6oCilSJBWbLcZzgKnGQ7Q78PanKxNDp3eGde3VWZBGm4Ai5R3hEAPmUECQCBRRUsRKpuiJLFJJTWXG2mDOvFWVCVjdkldIBACsm1JI8bIrBmRh86AtzzNNosqGNSa4tRje67G1hhn6KPn-Nt-S6M0Nyd393TT5fnj-2O7p_f33bbvbUclFnalrBuGiEgop1dcmxUo1sa5BV2xhkDQPbKIUdtKWTWMpyjpZbNT9wy2rF1wTPvTZOKUXX6e_oRxN_NII-2eqzrZ5t9clWnxj5j7E-m-ynkKPxw0WSnck0r4TeRX2YjjHMghegX0A-aVA |
| CitedBy_id | crossref_primary_10_1007_s10489_018_1136_z crossref_primary_10_1016_j_jocs_2017_10_005 crossref_primary_10_1111_coin_12148 crossref_primary_10_1016_j_neucom_2016_06_030 |
| Cites_doi | 10.1023/A:1011953410319 10.1007/s10710-009-9089-y 10.1002/(SICI)1096-987X(19981115)19:14<1639::AID-JCC10>3.0.CO;2-B 10.1109/TEVC.2011.2132725 10.1109/TSMCB.2002.1049606 10.1109/12.75146 10.1109/TPAMI.2004.75 10.1145/321921.321925 10.1109/TEVC.2005.850260 10.1109/3477.604100 10.1109/CIT.2009.111 10.1109/ICAICT.2011.6110885 10.1109/NETAPPS.2010.10 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media New York 2015 |
| Copyright_xml | – notice: Springer Science+Business Media New York 2015 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s10710-015-9241-9 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1573-7632 |
| EndPage | 453 |
| ExternalDocumentID | 10_1007_s10710_015_9241_9 |
| GroupedDBID | -59 -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 29H 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 78A 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BDATZ BGNMA BSONS CAG 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 GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9O PF0 PT4 QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE S16 S1Z S27 S3B SAP SCO SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c358t-ad5235b59062f843169b7d8076dba12b20cb991f0d4e714741f0c3c90763c2893 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000364634900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1389-2576 |
| IngestDate | Sat Nov 29 04:04:55 EST 2025 Tue Nov 18 22:44:07 EST 2025 Fri Feb 21 02:30:44 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Learning automata (LA) Local search Object migration automata (OMA) Memetic algorithm (MA) |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c358t-ad5235b59062f843169b7d8076dba12b20cb991f0d4e714741f0c3c90763c2893 |
| PageCount | 55 |
| ParticipantIDs | crossref_primary_10_1007_s10710_015_9241_9 crossref_citationtrail_10_1007_s10710_015_9241_9 springer_journals_10_1007_s10710_015_9241_9 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-12-01 |
| PublicationDateYYYYMMDD | 2015-12-01 |
| PublicationDate_xml | – month: 12 year: 2015 text: 2015-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Genetic programming and evolvable machines |
| PublicationTitleAbbrev | Genet Program Evolvable Mach |
| PublicationYear | 2015 |
| Publisher | Springer US |
| Publisher_xml | – name: Springer US |
| References | Zaree, Meybodi, Abbaszadeh (CR17) 2007; 2007 Ullmann (CR33) 1976; 23 Weber, Neri, Tirronen (CR1) 2009; 10 CR19 CR18 Isazadeh, Izadkhah, Mokarram (CR23) 2012; 6 Cordella, Foggia, Sansone, Vento (CR34) 2004; 26 Krasnogor, Smith (CR5) 2005; 9 CR16 CR15 CR14 CR13 CR11 CR32 CR30 Yuan-Kai, Kuo-Chin, Jorng-Tzong (CR31) 1997; 27 Oommen, Ma (CR10) 1988; 37 Xianshun, Yew-Soon, Meng-Hiot, Kay Chen (CR4) 2011; 15 Asghari, Safari Mamaghani, Mahmoudi, Meybodi (CR12) 2008; 1 Morris, Goodsell, Halliday, Huey, Hart, Belew, Olson (CR3) 1998; 19 CR2 Narendra, Thathachar (CR7) 1989 CR28 CR9 CR27 CR26 CR25 CR24 Downing (CR6) 2001; 2 CR22 CR21 CR20 Thathachar, Sastry (CR8) 2002; 32 Majid Nezhad, Motee Gader, Efimov (CR29) 2011; 8 C Xianshun (9241_CR4) 2011; 15 K Downing (9241_CR6) 2001; 2 9241_CR21 N Krasnogor (9241_CR5) 2005; 9 9241_CR20 9241_CR25 9241_CR24 9241_CR22 9241_CR28 9241_CR27 9241_CR2 9241_CR26 GM Morris (9241_CR3) 1998; 19 K Asghari (9241_CR12) 2008; 1 MAL Thathachar (9241_CR8) 2002; 32 9241_CR19 JR Ullmann (9241_CR33) 1976; 23 A Isazadeh (9241_CR23) 2012; 6 W Yuan-Kai (9241_CR31) 1997; 27 LP Cordella (9241_CR34) 2004; 26 V Majid Nezhad (9241_CR29) 2011; 8 9241_CR32 M Weber (9241_CR1) 2009; 10 9241_CR30 9241_CR14 9241_CR13 KS Narendra (9241_CR7) 1989 9241_CR11 9241_CR18 9241_CR16 9241_CR15 9241_CR9 B Zaree (9241_CR17) 2007; 2007 BJ Oommen (9241_CR10) 1988; 37 |
| References_xml | – volume: 1 start-page: 28 year: 2008 end-page: 39 ident: CR12 article-title: A relational databases query optimization using hybrid evolutionary algorithm publication-title: J. Comput. Robot. – ident: CR22 – ident: CR18 – volume: 2 start-page: 259 year: 2001 end-page: 288 ident: CR6 article-title: Reinforced genetic programming publication-title: Genet. Progr. Evolvable Mach. doi: 10.1023/A:1011953410319 – volume: 10 start-page: 343 year: 2009 end-page: 371 ident: CR1 article-title: Distributed differential evolution with explorative–exploitative population families publication-title: Genet. Progr. Evolvable Mach. doi: 10.1007/s10710-009-9089-y – ident: CR14 – ident: CR2 – ident: CR16 – volume: 6 start-page: 51 year: 2012 end-page: 57 ident: CR23 article-title: A learning based evolutionary approach for minimization of matrix bandwidth problem publication-title: Appl. Math. – ident: CR30 – volume: 19 start-page: 1639 year: 1998 end-page: 1662 ident: CR3 article-title: Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function publication-title: J. Comput. Chem. doi: 10.1002/(SICI)1096-987X(19981115)19:14<1639::AID-JCC10>3.0.CO;2-B – year: 1989 ident: CR7 publication-title: Learning automata: an introduction – volume: 15 start-page: 591 year: 2011 end-page: 607 ident: CR4 article-title: A multi-facet aurvey on memetic computation publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2011.2132725 – volume: 8 start-page: 32 year: 2011 end-page: 38 ident: CR29 article-title: A novel hybrid algorithm for task graph scheduling publication-title: Int. J. Comput. Sci. Issues – volume: 32 start-page: 711 year: 2002 end-page: 722 ident: CR8 article-title: Varieties of learning automata: an overview publication-title: IEEE Trans. Syst. Man Cybern. B Cybern. doi: 10.1109/TSMCB.2002.1049606 – ident: CR25 – volume: 37 start-page: 2 year: 1988 end-page: 13 ident: CR10 article-title: Deterministic learning automata solutions to the equipartitioning problem publication-title: IEEE Trans. Comput. doi: 10.1109/12.75146 – ident: CR27 – volume: 26 start-page: 1367 year: 2004 end-page: 1372 ident: CR34 article-title: A (sub) graph isomorphism algorithm for matching large graphs publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/TPAMI.2004.75 – ident: CR21 – ident: CR19 – volume: 23 start-page: 31 year: 1976 end-page: 42 ident: CR33 article-title: An algorithm for subgraph isomorphism publication-title: J. ACM doi: 10.1145/321921.321925 – volume: 9 start-page: 474 year: 2005 end-page: 488 ident: CR5 article-title: A tutorial for competent memetic algorithms: model, taxonomy, and design issues publication-title: Evol. Comput. IEEE Trans. doi: 10.1109/TEVC.2005.850260 – ident: CR15 – volume: 27 start-page: 588 year: 1997 end-page: 597 ident: CR31 article-title: Genetic-based search for error-correcting graph isomorphism publication-title: IEEE Trans. Syst. Man Cybern. B Cybern. doi: 10.1109/3477.604100 – ident: CR13 – ident: CR11 – ident: CR9 – ident: CR32 – ident: CR28 – ident: CR26 – ident: CR24 – volume: 2007 start-page: 394 year: 2007 end-page: 399 ident: CR17 article-title: A hybrid method for solving traveling salesman problem publication-title: IEEE/ACIS International Conference on Computer and Information Science, ICIS – ident: CR20 – volume: 37 start-page: 2 year: 1988 ident: 9241_CR10 publication-title: IEEE Trans. Comput. doi: 10.1109/12.75146 – ident: 9241_CR27 – ident: 9241_CR25 – ident: 9241_CR21 – ident: 9241_CR24 doi: 10.1109/CIT.2009.111 – volume: 26 start-page: 1367 year: 2004 ident: 9241_CR34 publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/TPAMI.2004.75 – ident: 9241_CR13 – ident: 9241_CR15 – ident: 9241_CR11 – ident: 9241_CR19 – volume: 8 start-page: 32 year: 2011 ident: 9241_CR29 publication-title: Int. J. Comput. Sci. Issues – ident: 9241_CR32 – volume: 2 start-page: 259 year: 2001 ident: 9241_CR6 publication-title: Genet. Progr. Evolvable Mach. doi: 10.1023/A:1011953410319 – volume: 10 start-page: 343 year: 2009 ident: 9241_CR1 publication-title: Genet. Progr. Evolvable Mach. doi: 10.1007/s10710-009-9089-y – ident: 9241_CR2 – ident: 9241_CR22 doi: 10.1109/ICAICT.2011.6110885 – volume-title: Learning automata: an introduction year: 1989 ident: 9241_CR7 – ident: 9241_CR26 – ident: 9241_CR30 – ident: 9241_CR20 – volume: 15 start-page: 591 year: 2011 ident: 9241_CR4 publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2011.2132725 – volume: 32 start-page: 711 year: 2002 ident: 9241_CR8 publication-title: IEEE Trans. Syst. Man Cybern. B Cybern. doi: 10.1109/TSMCB.2002.1049606 – ident: 9241_CR14 – volume: 1 start-page: 28 year: 2008 ident: 9241_CR12 publication-title: J. Comput. Robot. – ident: 9241_CR28 doi: 10.1109/NETAPPS.2010.10 – ident: 9241_CR16 – volume: 2007 start-page: 394 year: 2007 ident: 9241_CR17 publication-title: IEEE/ACIS International Conference on Computer and Information Science, ICIS – volume: 19 start-page: 1639 year: 1998 ident: 9241_CR3 publication-title: J. Comput. Chem. doi: 10.1002/(SICI)1096-987X(19981115)19:14<1639::AID-JCC10>3.0.CO;2-B – ident: 9241_CR18 – volume: 9 start-page: 474 year: 2005 ident: 9241_CR5 publication-title: Evol. Comput. IEEE Trans. doi: 10.1109/TEVC.2005.850260 – volume: 27 start-page: 588 year: 1997 ident: 9241_CR31 publication-title: IEEE Trans. Syst. Man Cybern. B Cybern. doi: 10.1109/3477.604100 – ident: 9241_CR9 – volume: 23 start-page: 31 year: 1976 ident: 9241_CR33 publication-title: J. ACM doi: 10.1145/321921.321925 – volume: 6 start-page: 51 year: 2012 ident: 9241_CR23 publication-title: Appl. Math. |
| SSID | ssj0016259 |
| Score | 2.0887547 |
| Snippet | Combing a genetic algorithm (GA) with a local search method produces a type of evolutionary algorithm known as a memetic algorithm (MA). Combining a GA with a... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 399 |
| SubjectTerms | Artificial Intelligence Biomedical Engineering and Bioengineering Compilers Computer Science Electrical Engineering Interpreters Programming Languages Programming Techniques Software Engineering/Programming and Operating Systems |
| Title | A learning automata-based memetic algorithm |
| URI | https://link.springer.com/article/10.1007/s10710-015-9241-9 |
| Volume | 16 |
| WOSCitedRecordID | wos000364634900001&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: 1573-7632 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016259 issn: 1389-2576 databaseCode: RSV dateStart: 20000401 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/eLvHCXMwnV1JSwMxFH5o9eDFumLdyMGTJTDTyTI5FrF4KuJGb0OWSS20HWmn_n6TdKZaUEHvL2H4ksz7Hm_5AK6EITZiUmMtucaEMYmd00uwobFiTFGlJQliE7zfTwcDcV_1cc_ravc6JRn-1F-a3XgooqLYxQwxFpuw5bxd6vUaHh5fVqkDT-hDlOXLdxybrlOZ322x7ozWM6HBwfSa__q0Pdit-CTqLi_APmzk0wNo1loNqHq6h9DuokogYojkoiwcUZXYuzCDJvnEdzIiOR4Ws1H5OjmC597t080droQSsE5oWmJpXDhJFfUzh23qm9uF4iaNODNKxh3VibRyPNBGhuQ8Jo5E2Egn2sXFLNEu4kqOoTEtpvkJICodZ7EiJpYrooyVNmWCKkKsdjvlSQuiGrFMV1PEvZjFOPucf-zByBwYmQcjEy24Xi15W47Q-M24XUOcVa9p_rP16Z-sz2Cn488oFKOcQ6OcLfIL2Nbv5Wg-uwy36APEC78A |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JS8NAFH5oFfRiXbGuc_BkGUiaWZJjEUvFWkSr9BZmybSFLtKm_n5n0qRaUEHvb4bwzUy-7_E2gKtIE-MxobASXGHCmMCW9AKsqS8Zk1QqQbJhE7zdDrvd6DGv454V2e5FSDL7U38pduNZEhXF1mfwcbQOG8QSlmuY__T8ugwdOEGfeVkufceq6SKU-d0Wq2S0GgnNCKZR_ten7cJOridRfXEB9mAtGe9DuZjVgPKnewDVOsoHRPSQmKcTK1QFdhSm0SgZuUpGJIa9yXSQ9keH8NK47dw0cT4oAauAhikW2rqTVFLXc9iErrg9klyHHmdaCr8ma56SVgcaT5OE-8SKCOOpQFm_mAXKelzBEZTGk3FyDIgKq1lM5BPDJZHaCBOyiEpCjLI7JUEFvAKxWOVdxN0wi2H82f_YgRFbMGIHRhxV4Hq55G3RQuM342oBcZy_ptnP1id_sr6ErWbnoRW37tr3p7Bdc-eVJaacQSmdzpNz2FTv6WA2vchu1AfC08Hk |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JSwMxFH5oFfFiXbGuc_BkCc50sswci1oUpRRc6G3IMqmFdlraqb_fZJqpFlQQ7y8hvCS87-MtH8BFrLD2KZdIciYRppQjE_RCpEggKBVESI4LsQnWbkfdbtxxOqfTstq9TEnOexrslKYsvxorffWl8Y0VBVUEGf4QoHgV1rCto7d0_el1kUaw4L5gXLaUxyDrMq353RbLgWk5K1oEm1b138fchi2HM73m_GHswEqa7UK11HDw3Jfeg3rTc8IRPY_P8pEBsBzZ0Ka8YTq0HY4eH_RGk37-NtyHl9bt8_UdcgIKSIYkyhFXhmYSQewsYh3ZpvdYMBX5jCrBg4Zo-FIYfKh9hVMWYAMutC9DafgyDaVhYuEBVLJRlh6CR7jBMjoOsGYCC6W5jmhMBMZamp3SsAZ-6b1EuuniVuRikHzORbbOSIwzEuuMJK7B5WLJeD5a4zfjeunuxP2y6c_WR3-yPoeNzk0rebxvPxzDZsNeV1GvcgKVfDJLT2Fdvuf96eSseFwfRS3KyA |
| 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+learning+automata-based+memetic+algorithm&rft.jtitle=Genetic+programming+and+evolvable+machines&rft.au=Rezapoor+Mirsaleh%2C+M.&rft.au=Meybodi%2C+M.+R.&rft.date=2015-12-01&rft.issn=1389-2576&rft.eissn=1573-7632&rft.volume=16&rft.issue=4&rft.spage=399&rft.epage=453&rft_id=info:doi/10.1007%2Fs10710-015-9241-9&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10710_015_9241_9 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1389-2576&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1389-2576&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1389-2576&client=summon |