[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_8c436608-816b-41f0-97c5-bb871bdd9452":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:8c436608-816b-41f0-97c5-bb871bdd9452,\"}":937},{"meta":4,"data":6},{"total":5},"117",[7,56,246,295,379,474,535,646,710,744],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":25,"verifyStatus":26,"verifyTime":27,"verifyNote":28,"languages":29,"translateLanguages":28,"viewCount":32,"subjectFields":33,"manageAffiliations":34,"indexDatabases":35,"url":36,"thumbnailPath":28,"statistic":28,"gsStatistic":37,"type":55,"analyzePriority":28},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-08-27T01:57:29.562+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":14,"issn":16,"title":18,"introduce":21,"gsId":23},{"VOID":15},"VN",{"VOID":17},"08667535",{"EN":19,"VI":20},"Journal of Tropical Science and Engineering","Tạp chí Khoa học và Công nghệ nhiệt đới",{"EN":22},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":24},"MS2_GJQAAAAJ","PUBLISHER","VERIFIED","2025-10-27T06:27:25.058+00:00",null,[30,31],"VI","EN",0,[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":38,"totalPublicationByYear":39,"totalCitation":43,"totalCitationByYear":44,"totalCitationPerPublication":52,"totalCitationPerPublicationByYear":53,"hindexLast5Year":42,"hindex":42},483,{"0":40,"2020":40,"2021":40,"2022":40,"2024":40,"2025":41,"2026":42},1,475,3,117,{"2017":40,"2018":40,"2019":45,"2020":46,"2021":46,"2022":47,"2023":48,"2024":49,"2025":50,"2026":51},4,5,11,6,7,53,15,0.24,{"2020":46,"2021":46,"2022":47,"2024":49,"2025":54,"2026":46},0.11,"JOURNAL",{"id":57,"createTime":58,"updateTime":10,"relativeEntities":59,"slug":60,"properties":61,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":70,"manageAffiliations":71,"indexDatabases":84,"url":101,"thumbnailPath":28,"statistic":102,"gsStatistic":195,"type":55,"analyzePriority":28},"cc3aedc1-bd17-441e-b403-4be82349b362","2023-05-29T12:05:16.902+00:00",[],"Vietnam-Journal-of-Mechanics",{"country":62,"issn":63,"title":65,"gsId":67},{"VOID":15},{"VOID":64},"08667136",{"EN":66},"Vietnam Journal of Mechanics",{"VOID":68},"B98qpzgAAAAJ",29,[],[72],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":74,"slug":28,"properties":75,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":83,"statistic":28},"5bf72910-eb8d-41eb-b358-ea294f24f765",[],{"title":76,"country":79,"abbreviation":80},{"EN":77,"VI":78},"Vietnam Academy of Science and Technology","Viện Hàn lâm Khoa học và Công nghệ Việt Nam",{"VOID":15},{"VOID":81},"VAST","https:\u002F\u002Fvast.gov.vn\u002F",[],[85],{"id":86,"indexDatabase":87,"url":97,"indexYears":98,"academicFieldIds":99,"indexDatabaseRanking":28},"61d05d3d-1119-4247-9062-3944e6a8afd5",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":89,"label":90,"description":92,"key":94,"publicationTags":95,"standard":28},"7c6668cf-5dbb-472f-ac65-0e3d0d95e1c2",[],{"EN":91,"VI":91},"ACI - Asean Citation Index",{"EN":93,"VI":93},"Cơ sở dữ liệu ACI","aci",[96],"ACI","https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10758","2018-2022",[100],"007635a4-2624-49b8-a8f3-fec188e6a80e","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fvjmech\u002Findex",{"impactFactor":32,"impactFactorByYear":103,"i10Index":122,"i10IndexLast5Year":123,"totalPublication":124,"totalPublicationByYear":125,"totalCitation":143,"totalCitationByYear":144,"totalCitationPerPublication":163,"totalCitationPerPublicationByYear":164,"hindexLast5Year":146,"hindex":146},{"1994":104,"1995":105,"1997":54,"1998":106,"1999":105,"2000":107,"2001":108,"2002":107,"2003":107,"2004":109,"2005":110,"2006":111,"2007":105,"2008":110,"2010":112,"2011":113,"2012":114,"2013":115,"2014":105,"2015":116,"2016":111,"2017":116,"2018":117,"2019":109,"2020":118,"2021":119,"2022":115,"2023":120,"2024":121},0.12,0.08,0.05,0.02,0.1,0.15,0.14,0.09,0.07,0.21,0.73,0.52,0.13,0.26,0.36,0.61,0.64,0.27,23,2,1046,{"1979":126,"1980":127,"1981":128,"1982":129,"1983":51,"1984":129,"1985":130,"1986":128,"1987":51,"1988":51,"1989":122,"1990":128,"1991":129,"1992":128,"1993":131,"1994":132,"1995":133,"1996":133,"1997":132,"1998":131,"1999":128,"2000":122,"2001":134,"2002":130,"2003":135,"2004":122,"2005":136,"2006":133,"2007":137,"2008":138,"2009":131,"2010":134,"2011":47,"2012":139,"2013":131,"2014":134,"2015":131,"2016":135,"2017":140,"2018":132,"2019":131,"2020":141,"2021":122,"2022":142,"2023":130,"2024":123},12,17,18,19,20,25,28,27,22,21,24,38,35,37,26,39,36,1403,{"1980":40,"1982":40,"1983":40,"1991":132,"1992":45,"1993":48,"1994":49,"1995":145,"1996":146,"1997":134,"1998":140,"1999":47,"2000":136,"2001":127,"2002":128,"2003":147,"2004":148,"2005":131,"2006":149,"2007":150,"2008":151,"2009":152,"2010":153,"2011":154,"2012":155,"2013":156,"2014":152,"2015":157,"2016":158,"2017":138,"2018":159,"2019":160,"2020":159,"2021":161,"2022":162,"2023":45},9,13,31,30,46,40,65,43,119,105,89,72,63,66,70,59,68,58,1.34,{"1980":165,"1982":106,"1983":112,"1991":166,"1992":167,"1993":52,"1994":168,"1995":169,"1996":170,"1997":171,"1998":172,"1999":119,"2000":172,"2001":173,"2002":174,"2003":175,"2004":176,"2005":172,"2006":177,"2007":178,"2008":179,"2009":180,"2010":181,"2011":182,"2012":183,"2013":184,"2014":185,"2015":186,"2016":187,"2017":188,"2018":189,"2019":190,"2020":191,"2021":192,"2022":193,"2023":194},0.06,1.47,0.22,0.25,0.33,0.48,0.79,1.04,0.77,0.9,1.48,1.3,1.7,1.05,1.86,1.72,5.41,9.55,2.41,2.88,1.95,2.52,3.14,1.35,2.5,2.36,1.79,2.96,1.61,0.2,{"impactFactor":28,"impactFactorByYear":28,"i10Index":196,"i10IndexLast5Year":128,"totalPublication":197,"totalPublicationByYear":198,"totalCitation":203,"totalCitationByYear":204,"totalCitationPerPublication":219,"totalCitationPerPublicationByYear":220,"hindexLast5Year":126,"hindex":199},42,1244,{"0":147,"1979":146,"1980":127,"1981":127,"1982":199,"1983":199,"1984":129,"1985":129,"1986":128,"1987":129,"1988":51,"1989":140,"1990":127,"1991":129,"1992":129,"1993":133,"1994":147,"1995":132,"1996":69,"1997":132,"1998":131,"1999":134,"2000":140,"2001":131,"2002":134,"2003":131,"2004":133,"2005":132,"2006":131,"2007":200,"2008":138,"2009":140,"2010":132,"2011":122,"2012":201,"2013":132,"2014":140,"2015":148,"2016":122,"2017":202,"2018":69,"2019":140,"2020":69,"2021":132,"2022":139,"2023":130,"2024":133,"2025":131,"2026":138},16,47,41,32,2194,{"1997":126,"1998":205,"1999":126,"2000":145,"2001":145,"2002":126,"2003":205,"2004":127,"2005":129,"2006":146,"2007":132,"2008":136,"2009":47,"2010":131,"2011":138,"2012":206,"2013":207,"2014":208,"2015":162,"2016":209,"2017":209,"2018":210,"2019":211,"2020":212,"2021":213,"2022":214,"2023":215,"2024":216,"2025":217,"2026":218},10,54,64,62,93,123,118,122,168,159,177,205,255,154,1.76,{"1997":221,"1998":222,"1999":223,"2000":224,"2001":118,"2002":223,"2003":222,"2004":225,"2005":226,"2006":115,"2007":227,"2008":228,"2009":229,"2010":230,"2011":231,"2012":232,"2013":233,"2014":234,"2015":235,"2016":236,"2017":237,"2018":238,"2019":239,"2020":240,"2021":48,"2022":241,"2023":242,"2024":243,"2025":244,"2026":245},0.43,0.4,0.55,0.35,0.63,0.68,0.6,0.69,0.42,0.89,1.52,1.32,2.29,2.38,1.93,4.04,2.91,4.24,4.54,4.21,4.3,8.85,7.59,10.2,4.4,{"id":247,"createTime":248,"updateTime":10,"relativeEntities":249,"slug":250,"properties":251,"entityType":25,"verifyStatus":26,"verifyTime":261,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":147,"subjectFields":262,"manageAffiliations":263,"indexDatabases":264,"url":273,"thumbnailPath":28,"statistic":274,"gsStatistic":290,"type":55,"analyzePriority":28},"b5209d2b-2258-40ef-8732-874e80fe24a5","2023-08-01T04:13:30.887+00:00",[],"VNU-Journal-of-Science-Medical-and-Pharmaceutical-Sciences",{"country":252,"eissn":253,"issn":255,"title":257,"gsId":259},{"VOID":15},{"VOID":254},"25881132",{"VOID":256},"26159309",{"EN":258},"VNU Journal of Science: Medical and Pharmaceutical Sciences",{"VOID":260},"nxupvWQAAAAJ","2023-08-01T04:16:22.633+00:00",[],[],[265],{"id":266,"indexDatabase":267,"url":272,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"1c684ac3-c7bf-4466-8841-3c6146083c3c",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":268,"label":269,"description":270,"key":94,"publicationTags":271,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11969","https:\u002F\u002Fjs.vnu.edu.vn\u002FMPS",{"impactFactor":32,"impactFactorByYear":275,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":276,"totalPublicationByYear":277,"totalCitation":282,"totalCitationByYear":283,"totalCitationPerPublication":284,"totalCitationPerPublicationByYear":285,"hindexLast5Year":45,"hindex":45},{"2019":106,"2020":110,"2021":104,"2022":104,"2023":109,"2024":108},360,{"2016":140,"2017":278,"2018":69,"2019":148,"2020":279,"2021":200,"2022":280,"2023":281,"2024":200},34,48,49,50,163,{"2016":145,"2017":145,"2018":135,"2019":140,"2020":50,"2021":135,"2022":128,"2023":48},0.45,{"2016":224,"2017":117,"2018":286,"2019":287,"2020":288,"2021":284,"2022":289,"2023":104},0.72,0.87,1.1,0.37,{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":136,"totalPublicationByYear":291,"totalCitation":127,"totalCitationByYear":292,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":294,"hindexLast5Year":123,"hindex":42},{"0":123,"2014":40,"2015":40,"2016":130},{"2016":40,"2019":123,"2021":123,"2023":45,"2024":42,"2025":40,"2026":40},0.71,{"2016":106},{"id":296,"createTime":297,"updateTime":10,"relativeEntities":298,"slug":299,"properties":300,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":51,"subjectFields":310,"manageAffiliations":311,"indexDatabases":312,"url":313,"thumbnailPath":28,"statistic":314,"gsStatistic":349,"type":55,"analyzePriority":28},"e7ce3904-ad2d-4341-b39e-98ebe8da5908","2023-06-13T10:30:04.853+00:00",[],"Communications-in-Physics",{"country":301,"eissn":302,"issn":304,"title":306,"gsId":308},{"VOID":15},{"VOID":303},"28155947",{"VOID":305},"08863166",{"EN":307},"Communications in Physics",{"VOID":309},"FStER9AAAAAJ",[],[],[],"https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fcip",{"impactFactor":32,"impactFactorByYear":315,"i10Index":199,"i10IndexLast5Year":45,"totalPublication":321,"totalPublicationByYear":322,"totalCitation":326,"totalCitationByYear":327,"totalCitationPerPublication":335,"totalCitationPerPublicationByYear":336,"hindexLast5Year":126,"hindex":126},{"2008":110,"2009":316,"2010":165,"2011":317,"2012":317,"2013":112,"2014":318,"2015":105,"2016":108,"2017":116,"2018":318,"2019":52,"2020":319,"2021":284,"2022":320,"2023":116,"2024":222},0.3,0.03,0.16,0.34,0.28,738,{"2007":323,"2008":145,"2009":145,"2010":136,"2011":139,"2012":324,"2013":138,"2014":151,"2015":69,"2016":151,"2017":325,"2018":142,"2019":50,"2020":201,"2021":141,"2022":152,"2023":150,"2024":278,"2025":123},14,107,56,947,{"2007":148,"2008":49,"2009":49,"2010":127,"2011":328,"2012":155,"2013":278,"2014":329,"2015":206,"2016":330,"2017":331,"2018":332,"2019":333,"2020":334,"2021":127,"2022":132,"2023":148},52,94,86,129,76,91,106,1.28,{"2007":337,"2008":338,"2009":338,"2010":293,"2011":339,"2012":340,"2013":341,"2014":342,"2015":179,"2016":232,"2017":343,"2018":344,"2019":180,"2020":345,"2021":346,"2022":347,"2023":348},2.14,0.78,1.41,0.83,0.97,1.45,2.3,2.11,2.59,0.44,0.65,0.75,{"impactFactor":28,"impactFactorByYear":28,"i10Index":133,"i10IndexLast5Year":145,"totalPublication":350,"totalPublicationByYear":351,"totalCitation":355,"totalCitationByYear":356,"totalCitationPerPublication":363,"totalCitationPerPublicationByYear":364,"hindexLast5Year":145,"hindex":323},1117,{"0":48,"1972":40,"1991":127,"1992":51,"1993":49,"1994":47,"1995":323,"1996":42,"1997":40,"1998":146,"1999":146,"2000":205,"2001":47,"2002":128,"2003":136,"2004":132,"2005":136,"2006":148,"2007":141,"2008":149,"2009":352,"2010":353,"2011":196,"2012":208,"2013":280,"2014":354,"2015":150,"2016":328,"2017":137,"2018":142,"2019":325,"2020":152,"2021":139,"2022":139,"2023":142,"2024":148,"2025":147,"2026":132},33,44,92,1611,{"2004":46,"2005":357,"2006":47,"2007":47,"2008":126,"2009":140,"2010":69,"2011":147,"2012":147,"2013":147,"2014":208,"2015":353,"2016":201,"2017":280,"2018":161,"2019":358,"2020":212,"2021":331,"2022":212,"2023":359,"2024":360,"2025":361,"2026":362},8,85,153,178,188,132,1.44,{"2004":365,"2005":169,"2006":289,"2007":320,"2008":117,"2009":171,"2010":366,"2011":367,"2012":368,"2013":225,"2014":369,"2015":288,"2016":171,"2017":370,"2018":371,"2019":231,"2020":372,"2021":373,"2022":374,"2023":375,"2024":376,"2025":377,"2026":378},0.18,0.66,0.74,0.5,0.67,1.29,1.89,2.84,3.49,3.3,4.25,5.93,6.06,4.71,{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":394,"translateLanguages":28,"viewCount":127,"subjectFields":395,"manageAffiliations":396,"indexDatabases":404,"url":418,"thumbnailPath":28,"statistic":419,"gsStatistic":446,"type":55,"analyzePriority":28},"2300fd63-13a8-4ee9-92b0-d24d9e616c6b","2023-05-29T12:05:31.684+00:00","2026-08-27T01:57:29.561+00:00",[],"Journal-of-Computer-Science-and-Cybernetics",{"country":386,"issn":387,"title":389,"gsId":392},{"VOID":15},{"VOID":388},"18139663",{"EN":390,"VI":391},"Journal of Computer Science and Cybernetics","Tạp chí tin học và điều khiển học",{"VOID":393},"hVh9fuMAAAAJ",[30,31],[],[397],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":398,"slug":28,"properties":399,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":403,"statistic":28},[],{"title":400,"country":401,"abbreviation":402},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[405],{"id":406,"indexDatabase":407,"url":412,"indexYears":413,"academicFieldIds":414,"indexDatabaseRanking":28},"0c897c2c-8ca4-4a7a-91b9-14955abc3043",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":408,"label":409,"description":410,"key":94,"publicationTags":411,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11305","2019-2021",[100,415,416,417],"a24a4497-b6ac-43f3-ae94-c044be819e49","b2d37900-0c9f-4074-a519-9ee0b570caa7","37da756c-1c5e-4925-87f2-a9bd3ce5859c","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjcc",{"impactFactor":32,"impactFactorByYear":420,"i10Index":129,"i10IndexLast5Year":42,"totalPublication":425,"totalPublicationByYear":426,"totalCitation":431,"totalCitationByYear":432,"totalCitationPerPublication":438,"totalCitationPerPublicationByYear":439,"hindexLast5Year":323,"hindex":323},{"2013":107,"2014":107,"2015":111,"2016":365,"2017":107,"2018":421,"2019":117,"2020":422,"2021":227,"2022":423,"2023":368,"2024":424},0.04,0.32,0.39,0.57,1184,{"2012":427,"2013":358,"2014":278,"2015":428,"2016":429,"2017":51,"2018":430,"2019":148,"2020":130,"2021":136,"2022":199,"2023":132,"2024":42},473,71,251,134,995,{"2012":433,"2013":434,"2014":434,"2015":333,"2016":435,"2017":436,"2018":437,"2019":211,"2020":281,"2021":434,"2022":126,"2023":152},149,45,114,51,232,0.84,{"2012":422,"2013":440,"2014":232,"2015":335,"2016":284,"2017":441,"2018":442,"2019":443,"2020":189,"2021":444,"2022":348,"2023":445},0.53,3.4,1.73,3.93,1.88,1.54,{"impactFactor":28,"impactFactorByYear":28,"i10Index":150,"i10IndexLast5Year":132,"totalPublication":447,"totalPublicationByYear":448,"totalCitation":449,"totalCitationByYear":450,"totalCitationPerPublication":192,"totalCitationPerPublicationByYear":460,"hindexLast5Year":51,"hindex":199},1105,{"0":47,"1981":40,"1985":199,"1986":135,"1987":136,"1988":323,"1989":126,"1990":199,"1991":127,"1992":126,"1993":47,"1994":129,"1995":130,"1996":132,"1997":142,"1998":148,"1999":201,"2000":196,"2001":353,"2002":353,"2003":352,"2004":132,"2005":131,"2006":148,"2007":147,"2008":133,"2009":131,"2010":139,"2011":201,"2012":281,"2013":142,"2014":202,"2015":69,"2016":140,"2017":136,"2018":140,"2019":134,"2020":134,"2021":133,"2022":134,"2023":134,"2024":136,"2025":49},3272,{"2007":145,"2008":323,"2009":46,"2010":48,"2011":129,"2012":148,"2013":140,"2014":69,"2015":152,"2016":160,"2017":162,"2018":451,"2019":452,"2020":453,"2021":454,"2022":455,"2023":456,"2024":457,"2025":458,"2026":459},109,173,236,318,398,469,442,440,297,{"2007":461,"2008":115,"2009":194,"2010":318,"2011":462,"2012":227,"2013":286,"2014":463,"2015":175,"2016":464,"2017":465,"2018":466,"2019":467,"2020":468,"2021":469,"2022":470,"2023":471,"2024":472,"2025":473},0.29,0.46,0.91,2.27,2.42,4.19,7.86,10.73,11.78,18.09,21.32,18.42,62.86,{"id":475,"createTime":476,"updateTime":382,"relativeEntities":477,"slug":478,"properties":479,"entityType":25,"verifyStatus":26,"verifyTime":491,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":202,"subjectFields":492,"manageAffiliations":493,"indexDatabases":509,"url":510,"thumbnailPath":28,"statistic":511,"gsStatistic":525,"type":55,"analyzePriority":28},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":480,"issn":481,"title":483,"introduce":486,"gsId":489},{"VOID":15},{"VOID":482},"23541210",{"EN":484,"VI":485},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"EN":487,"VI":488},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"VOID":490},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",[],[494],{"id":495,"createTime":28,"updateTime":28,"relativeEntities":496,"slug":28,"properties":497,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":507,"parentIds":508,"statistic":28},"6413896b-eca9-442b-a73f-182a58a0ce40",[],{"title":498,"address":501,"country":504,"abbreviation":505},{"EN":499,"VI":500},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"EN":502,"VI":503},"No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam","Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam",{"VOID":15},{"VOID":506},"ctump","http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":32,"impactFactorByYear":512,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":520,"totalCitationByYear":521,"totalCitationPerPublication":108,"totalCitationPerPublicationByYear":523,"hindexLast5Year":45,"hindex":45},{"2022":513,"2023":111,"2024":106},0.01,1556,{"2020":47,"2021":516,"2022":517,"2023":518,"2024":519,"2025":122},57,306,801,358,161,{"2021":146,"2022":280,"2023":522},99,{"2021":524,"2022":318,"2023":104},0.23,{"impactFactor":28,"impactFactorByYear":28,"i10Index":123,"i10IndexLast5Year":123,"totalPublication":526,"totalPublicationByYear":527,"totalCitation":526,"totalCitationByYear":528,"totalCitationPerPublication":40,"totalCitationPerPublicationByYear":531,"hindexLast5Year":49,"hindex":49},476,{"0":205,"2019":123,"2021":139,"2022":459,"2023":451,"2024":357,"2025":49,"2026":48},{"2021":42,"2022":123,"2023":161,"2024":529,"2025":360,"2026":530},136,83,{"2021":105,"2022":513,"2023":532,"2024":127,"2025":533,"2026":534},0.62,25.43,13.83,{"id":536,"createTime":537,"updateTime":382,"relativeEntities":538,"slug":539,"properties":540,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":552,"translateLanguages":28,"viewCount":133,"subjectFields":553,"manageAffiliations":554,"indexDatabases":555,"url":556,"thumbnailPath":557,"statistic":558,"gsStatistic":594,"type":55,"analyzePriority":28},"6984a56a-db70-403b-9cc4-4013e1ceaffa","2023-05-09T06:47:40.346+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Nghi%C3%AAn%20c%E1%BB%A9u%20n%C6%B0%E1%BB%9Bc%20ngo%C3%A0i",{"country":541,"issn":542,"title":544,"introduce":547,"gsId":550},{"VOID":15},{"VOID":543},"25252445",{"EN":545,"VI":546},"VNU Journal of Foreign Studies","Tạp chí Nghiên cứu nước ngoài",{"EN":548,"VI":549},"{\"ops\":[{\"insert\":\"\\n\\nThe \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research. In 2002, with the rapid expansion of the field of Foreign Languages and International Studies, the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was delighted to announce the launch of the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n.\\n\\n\\nSince 2017, as a natural development from its predecessor \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n, the\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"VNU Journal of Foreign Studies \"},{\"insert\":\"\\ncontinues to be an official, independent publication of the University of Languages and International Studies (ULIS) under Vietnam National University (VNU).\\nThe\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\" VNU Journal of Foreign Studies\"},{\"attributes\":{\"italic\":true},\"insert\":\" \"},{\"insert\":\"\\npublishes \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"blind\"},{\"insert\":\"\\n \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"peer-reviewed\"},{\"insert\":\"\\n research papers, discussions and reviews concerning:\\nLinguisticsForeign language educationInternational studiesRelated social sciences and humanities\\nBimonthly in 4 English editions and 2 Vietnamese editions in the current year in both print and electronic forms, the journal provides maximum exposure for published articles, making research available to all to read and share.\\n\\n\\n\"}]}","{\"ops\":[{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học, Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n được thành lập năm 1985 với mục đích xuất bản các bài báo nghiên cứu trong nước và quốc tế về tất cả các lĩnh vực khoa học tự nhiên và công nghệ, khoa học xã hội và nhân văn. Kể từ đó, tạp chí đã phát triển về chất lượng, quy mô và phạm vi với hàng chục số báo liên quan đến nghiên cứu học thuật. Năm 2002, với sự phát triển nhanh chóng của lĩnh vực Ngoại ngữ và Quốc tế học, \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n đã vui mừng thông báo ra mắt Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài.\"},{\"insert\":\"\\n\\n\\nKể từ năm 2017, như một sự kế thừa và phát triển từ tiền thân Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài\"},{\"insert\":\"\\n của Tạp chí Khoa học, Đại học Quốc gia Hà Nội, \\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tạp chí\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"insert\":\"\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài \"},{\"insert\":\"\\ntiếp tục là ấn phẩm khoa học chính thức và độc lập của Trường Đại học Ngoại ngữ, Đại học Quốc gia Hà Nội.\\nTạp chí \\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài\"},{\"insert\":\"\\n xuất bản các bài báo nghiên cứu, trao đổi và đánh giá đã được phản biện kín về:\\nNgôn ngữ họcGiảng dạy ngoại ngữ\u002Fngôn ngữQuốc tế họcCác ngành khoa học xã hội và nhân văn có liên quan\\nTạp chí xuất bản định kì 06 số\u002Fnăm (gồm 04 số tiếng Anh\u002Fnăm và 2 số tiếng Việt\u002Fnăm) dưới dạng bản in và bản điện tử. Tạp chí cung cấp khả năng tiếp cận tối đa tới các bài báo đã xuất bản nhằm giúp độc giả dễ dàng đọc và chia sẻ.\\n\"}]}",{"VOID":551},"jyihv3YAAAAJ",[30,31],[],[],[],"https:\u002F\u002Fjfs.ulis.vnu.edu.vn\u002Findex.php\u002Ffs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6984a56a-db70-403b-9cc4-4013e1ceaffa\u002F92693604f5caf63c64520c5c2cd756b5.jpg",{"impactFactor":32,"impactFactorByYear":559,"i10Index":560,"i10IndexLast5Year":205,"totalPublication":561,"totalPublicationByYear":562,"totalCitation":568,"totalCitationByYear":569,"totalCitationPerPublication":579,"totalCitationPerPublicationByYear":580,"hindexLast5Year":140,"hindex":140},{"2007":317,"2010":112,"2011":109,"2012":421,"2013":165,"2014":421,"2015":421,"2016":111,"2017":116,"2018":104,"2019":109,"2020":320,"2021":284,"2022":168,"2023":116,"2024":108},67,1200,{"2002":51,"2003":51,"2004":47,"2005":352,"2006":142,"2007":131,"2008":147,"2009":139,"2010":278,"2011":138,"2012":69,"2013":206,"2014":137,"2015":69,"2016":196,"2017":563,"2018":209,"2019":564,"2020":565,"2021":566,"2022":530,"2023":567,"2024":428,"2025":281},130,78,90,80,61,3204,{"2002":42,"2003":123,"2004":123,"2005":570,"2006":47,"2007":127,"2008":571,"2009":572,"2010":196,"2011":573,"2012":130,"2013":560,"2014":574,"2015":149,"2016":325,"2017":575,"2018":576,"2019":577,"2020":578,"2021":453,"2022":206,"2023":205,"2025":51},189,223,765,246,98,171,377,355,199,2.67,{"2002":194,"2003":116,"2004":365,"2005":581,"2006":582,"2007":226,"2008":583,"2009":584,"2010":585,"2011":586,"2012":228,"2013":585,"2014":587,"2015":588,"2016":589,"2017":232,"2018":590,"2019":591,"2020":592,"2021":593,"2022":347,"2023":318,"2025":316},5.73,0.31,7.19,20.68,1.24,7.03,2.58,1.59,1.33,4.05,4.55,2.21,2.95,{"impactFactor":28,"impactFactorByYear":28,"i10Index":595,"i10IndexLast5Year":596,"totalPublication":597,"totalPublicationByYear":598,"totalCitation":609,"totalCitationByYear":610,"totalCitationPerPublication":625,"totalCitationPerPublicationByYear":626,"hindexLast5Year":142,"hindex":152},379,311,2120,{"0":361,"1960":40,"1971":40,"1975":40,"1987":40,"1988":40,"1989":40,"1990":45,"1992":40,"1993":40,"1994":46,"1995":46,"1996":45,"1997":42,"1998":49,"1999":42,"2000":123,"2001":42,"2002":48,"2003":46,"2004":145,"2005":131,"2006":51,"2007":131,"2008":135,"2009":146,"2010":127,"2011":122,"2012":148,"2013":352,"2014":201,"2015":149,"2016":599,"2017":600,"2018":601,"2019":209,"2020":602,"2021":603,"2022":604,"2023":605,"2024":606,"2025":607,"2026":608},77,75,97,143,167,156,182,231,230,128,13225,{"2003":149,"2004":150,"2005":201,"2006":196,"2007":157,"2008":436,"2009":328,"2010":611,"2011":612,"2012":333,"2013":522,"2014":613,"2015":520,"2016":614,"2017":615,"2018":616,"2019":617,"2020":618,"2021":619,"2022":620,"2023":621,"2024":622,"2025":623,"2026":624},74,88,146,228,310,347,413,636,944,1261,1400,1846,2511,1882,6.24,{"2003":627,"2004":628,"2005":629,"2006":630,"2007":186,"2008":631,"2009":45,"2010":632,"2011":633,"2012":634,"2013":42,"2014":635,"2015":636,"2016":192,"2017":637,"2018":638,"2019":628,"2020":639,"2021":640,"2022":641,"2023":642,"2024":643,"2025":644,"2026":645},9.2,4.44,1.64,2.8,2.43,4.35,3.83,3.03,3.56,3.5,4.13,3.58,4.45,5.65,8.08,7.69,7.99,10.92,14.7,{"id":647,"createTime":648,"updateTime":382,"relativeEntities":649,"slug":650,"properties":651,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":665,"translateLanguages":28,"viewCount":142,"subjectFields":666,"manageAffiliations":667,"indexDatabases":668,"url":677,"thumbnailPath":678,"statistic":679,"gsStatistic":699,"type":55,"analyzePriority":28},"21d239d8-ac9d-48c7-a176-9d8aadc5eba5","2023-08-21T02:43:48.721+00:00",[],"Khoa-h%E1%BB%8Dc-%C4%90HQGHN-Khoa-h%E1%BB%8Dc-T%E1%BB%B1-nhi%C3%AAn-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87",{"country":652,"eissn":653,"issn":655,"title":657,"introduce":660,"gsId":662},{"VOID":15},{"VOID":654},"25881140",{"VOID":656},"26159317",{"EN":658,"VI":659},"VNU Journal of Science: Natural Science and Technology","Khoa học ĐHQGHN: Khoa học Tự nhiên và Công nghệ",{"EN":661},"{\"ops\":[{\"insert\":\"The \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"With the rapid expansion of the field of Economics, the VNU \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" is delighted to announce the launch of the \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Natural Sciences and Technology (JS: NST) \"},{\"insert\":\"since 1985. This serial publication provides researchers with the opportunity to publish research covering aspects in these areas in the popular \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\" series.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"As a fully open access publication, the journal will provide maximum exposure for published articles, making the research available to all to read and share. The journal will be published quarterly in March, June, September and December.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"JS: NST is an open access journal publishing double-blinded peer-reviewed research papers, communications and reviews dealing with Biology, Bio-technology, Chemistry, Chemical engineering, Energy, Environmental technology and Materials engineering.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Publication Ethics\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"VNUJS is committed to maintaining the highest standards of publication ethics and takes all possible measures against any publication malpractices. The journal follows the guidelines and recommendations of the Committee on Publication Ethics (C.O.P.E) to ensure ethical publishing practices.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Plagiarism is strictly prohibited and will not be tolerated. Any form of plagiarism, including but not limited to copying, paraphrasing, or reusing previously published work without proper attribution, will result in rejection of the manuscript and potential sanctions against the author. VNUJS utilizes DoIt as plagiarism detection software to verify the originality of submitted manuscripts.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The publication ethics statement with full detail of the responsibilities of authors, reviewers and editors can be found \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fjs.vnu.edu.vn\u002FNST\u002Fethics\"},\"insert\":\"here\"},{\"attributes\":{\"bold\":true},\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Peer Review Process\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Any manuscript followed the journal’s scope and author guideline will be assigned to the managing editors. All manuscripts have undergone editorial screening and anonymous double-blind peer-review by the at least one independent expert in the field. The managing editor makes an editorial decision, which is subject to endorsement by the Editor – in - Chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The journal publishing process can be found in detail \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F136BOGahfq9_5BB3TzSBsLBkQKfCUe5yN\u002Fview?usp=share_link\"},\"insert\":\"here\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"VOID":663},"ZfBridMAAAAJ","Admin update database",[30,31],[],[],[669],{"id":670,"indexDatabase":671,"url":676,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"6684da33-2cb9-49f9-8332-28f0bcd72e39",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":672,"label":673,"description":674,"key":94,"publicationTags":675,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11968","https:\u002F\u002Fjs.vnu.edu.vn\u002FNST","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F21d239d8-ac9d-48c7-a176-9d8aadc5eba5\u002Fb081d4211e382646c2cdc054ead551b3.jpg",{"impactFactor":32,"impactFactorByYear":680,"i10Index":130,"i10IndexLast5Year":40,"totalPublication":682,"totalPublicationByYear":683,"totalCitation":685,"totalCitationByYear":686,"totalCitationPerPublication":691,"totalCitationPerPublicationByYear":692,"hindexLast5Year":47,"hindex":47},{"2000":317,"2005":513,"2007":107,"2010":513,"2011":317,"2012":106,"2013":107,"2014":317,"2015":107,"2016":107,"2017":421,"2018":317,"2019":421,"2020":113,"2021":582,"2022":681,"2023":194,"2024":104},0.19,1700,{"1985":131,"1986":353,"1987":130,"1988":69,"1989":69,"1990":200,"1991":196,"1992":146,"1993":279,"1994":148,"1995":200,"1996":201,"1999":278,"2000":140,"2001":128,"2002":202,"2003":353,"2004":138,"2005":202,"2006":136,"2007":278,"2008":139,"2009":137,"2010":141,"2011":278,"2012":132,"2013":202,"2014":202,"2015":278,"2016":684,"2017":359,"2018":160,"2019":162,"2020":281,"2021":157,"2022":436,"2023":358,"2024":136,"2025":135},165,870,{"1995":123,"1999":123,"2001":45,"2002":130,"2003":40,"2004":123,"2005":42,"2007":69,"2008":687,"2009":352,"2010":688,"2011":137,"2012":127,"2013":47,"2014":46,"2015":146,"2016":331,"2017":689,"2018":331,"2019":690,"2020":353,"2021":567,"2022":130,"2023":357},82,60,55,102,0.51,{"1995":421,"1999":165,"2001":167,"2002":532,"2003":107,"2004":165,"2005":111,"2007":693,"2008":694,"2009":287,"2010":445,"2011":695,"2012":119,"2013":319,"2014":318,"2015":696,"2016":338,"2017":118,"2018":697,"2019":219,"2020":698,"2021":341,"2022":423,"2023":111},0.85,2.22,1.12,0.38,2.19,0.88,{"impactFactor":28,"impactFactorByYear":28,"i10Index":126,"i10IndexLast5Year":123,"totalPublication":570,"totalPublicationByYear":700,"totalCitation":701,"totalCitationByYear":702,"totalCitationPerPublication":703,"totalCitationPerPublicationByYear":704,"hindexLast5Year":46,"hindex":205},{"0":48,"1999":146,"2000":47,"2001":45,"2002":40,"2003":199,"2004":123,"2005":42,"2006":123,"2007":145,"2008":145,"2009":46,"2010":49,"2011":47,"2012":47,"2013":49,"2014":45,"2015":45,"2016":157,"2017":40},425,{"2008":42,"2009":357,"2010":47,"2011":51,"2012":199,"2013":135,"2014":323,"2015":51,"2016":278,"2017":69,"2018":69,"2019":137,"2020":142,"2021":140,"2022":148,"2023":122,"2024":202,"2025":135,"2026":126},2.25,{"2008":169,"2009":705,"2010":706,"2011":707,"2012":342,"2013":42,"2014":636,"2015":708,"2016":709,"2017":69},1.6,1.57,1.36,3.75,0.54,{"id":711,"createTime":712,"updateTime":382,"relativeEntities":713,"slug":714,"properties":715,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":28,"translateLanguages":28,"viewCount":150,"subjectFields":727,"manageAffiliations":728,"indexDatabases":729,"url":730,"thumbnailPath":731,"statistic":732,"gsStatistic":738,"type":55,"analyzePriority":28},"954132b5-ca74-461c-b819-45ad6e49a404","2023-08-17T03:30:52.301+00:00",[],"HPU2-Journal-of-Science-Natural-Sciences-and-Technology",{"country":716,"issn":717,"title":719,"introduce":722,"gsId":725},{"VOID":15},{"VOID":718},"28155637",{"EN":720,"VI":721},"HPU2 Journal of Science: Natural Sciences and Technology","TẠP CHÍ KHOA HỌC TRƯỜNG ĐHSP HÀ NỘI 2: CHUYÊN SAN KHOA HỌC TỰ NHIÊN VÀ CÔNG NGHỆ",{"EN":723,"VI":724},"{\"ops\":[{\"insert\":\"HPU2 journal of Science aims to provide an interdisciplinary platform for the dissemination of advances in sciences and technology. The journal publishes original papers of scientific or technological value in all areas of natural, social or educational sciences.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Natural sciences and technology is in papers that describe valuable findings in physics, mathematics, chemistry, biology; solving engineering or technological problems.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Social Sciences and Humanity is to facilitate the publication of high-quality papers in various areas of social sciences and studies for human development.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Educational Sciences is to publish papers in the field of educational sciences and applications of advances to education for improving and enhancing science education at all levels.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Papers that are published by HPU2 Journal of Science are doubled-blind, peer-reviewed by at least two experts, are evaluated by the section editor and editor in chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Types of Articles\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Research articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Academic reports of original research that have never been published elsewhere in any languages. Manuscripts, where appropriate, should contain the following sections in the order: Title, Authors, Author affiliations, Email address of corresponding authors, Abstract, Keywords, Nomenclature (if any), Introduction, Experiment, Theory, Results and Discussion, Conclusions, Conflict of Interest, Acknowledgments (if any), References, Appendix (if any). Pre-published are to be formatted according to Templates (MS-Word version). \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Review articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"In addition to invited reviews, literature reviews, systematic reviews, and critical reviews will be accepted for consideration. The manuscript should be composed and organized according to the required sequence: Titles, Author names, Affiliations, Email addresses, Abstract, Keywords, Main text, Conclusion, Conflict of Interest, Acknowledgments (if any), References. Although, the main text structure may vary based on the review subtopics, the articles should be formatted according to suitable Templates as research articles.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Khoa học Trường ĐHSP Hà Nội 2 nhằm mục đích cung cấp một nền tảng liên ngành của sự phổ biến những tiến bộ của khoa học và công nghệ. Tạp chí xuất bản các bài báo gốc có giá trị khoa học hoặc công nghệ trong tất cả các lĩnh vực khoa học tự nhiên, xã hội hoặc giáo dục.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học tự nhiên và công nghệ:\"},{\"insert\":\" Là các bài báo mô tả những phát hiện có giá trị trong vật lý, toán học, hóa học, sinh học; giải quyết các vấn đề kỹ thuật hoặc công nghệ.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học Xã hội và Nhân văn:\"},{\"insert\":\" là các bài báo xuất bản chất lượng cao trong các lĩnh vực khác nhau của khoa học xã hội và nghiên cứu phát triển con người.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học giáo dục:\"},{\"insert\":\" là các bài báo xuất bản trong lĩnh vực khoa học giáo dục và các ứng dụng của tiến bộ vào giáo dục để cải thiện và nâng cao giáo dục khoa học ở tất cả các cấp.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí trường ĐHSP Hà Nội 2 xuất bản được phản biện kín, xét duyệt bởi ít nhất 02 chuyên gia, và được đánh giá, chọn lựa từ ban biên tập và Tổng biên tập.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Các loại bài báo\"},{\"insert\":\":\\nBài báo nghiên cứu:\"},{\"attributes\":{\"list\":\"ordered\"},\"insert\":\"\\n\"},{\"insert\":\"Báo cáo học thuật về nghiên cứu ban đầu chưa từng được xuất bản ở bất kỳ nơi nào, hay bằng bất kỳ ngôn ngữ nào khác. Bản thảo thích hợp, nên chứa các phần sau theo thứ tự: Tiêu đề, Tác giả, Liên kết tác giả, Địa chỉ email của tác giả tương ứng, Tóm tắt, Từ khóa, Danh pháp (nếu có), Giới thiệu, Thử nghiệm, Lý thuyết, Kết quả và thảo luận, Kết luận, Xung đột quan tâm, Lời cảm ơn (nếu có), Tài liệu tham khảo, Phụ lục (nếu có). Bản xuất bản trước phải được định dạng theo Mẫu (phiên bản MS-Word).\\n2. Bài báo tổng quan:\\nNgoài các bài phê bình được mời, các bài phê bình tài liệu, bài phê bình có hệ thống và bài phê bình sẽ được chấp nhận để xem xét. Bản thảo cần được soạn thảo và sắp xếp theo trình tự yêu cầu: Tên sách, Tên tác giả, Liên kết, Địa chỉ email, Tóm tắt, Từ khóa, Nội dung chính, Kết luận, Xung đột lợi ích, Lời cảm ơn (nếu có), Tài liệu tham khảo. Mặc dù, cấu trúc văn bản chính có thể thay đổi dựa trên các chủ đề phụ của bài đánh giá, các bài báo nên được định dạng theo các Mẫu phù hợp như các bài báo nghiên cứu.\\n\"}]}",{"VOID":726},"YPoBvsIAAAAJ",[],[],[],"https:\u002F\u002Fsj.hpu2.edu.vn\u002Findex.php\u002Fjournal","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F954132b5-ca74-461c-b819-45ad6e49a404\u002F2790ef1d0a7d7a40a504c2fc1647f670.jpg",{"impactFactor":32,"impactFactorByYear":733,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":329,"totalPublicationByYear":735,"totalCitation":134,"totalCitationByYear":736,"totalCitationPerPublication":524,"totalCitationPerPublicationByYear":737,"hindexLast5Year":123,"hindex":123},{"2024":734},0.17,{"2022":136,"2023":278,"2024":142},{"2022":357,"2023":126,"2024":123},{"2022":169,"2023":224,"2024":165},{"impactFactor":28,"impactFactorByYear":28,"i10Index":45,"i10IndexLast5Year":45,"totalPublication":330,"totalPublicationByYear":739,"totalCitation":154,"totalCitationByYear":740,"totalCitationPerPublication":741,"totalCitationPerPublicationByYear":742,"hindexLast5Year":46,"hindex":46},{"0":123,"2022":134,"2023":136,"2024":69,"2025":145},{"2023":46,"2024":136,"2025":201,"2026":278},1.22,{"2023":113,"2024":340,"2025":743},4.56,{"id":745,"createTime":746,"updateTime":747,"relativeEntities":748,"slug":749,"properties":750,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":762,"manageAffiliations":763,"indexDatabases":771,"url":817,"thumbnailPath":28,"statistic":818,"gsStatistic":850,"type":55,"analyzePriority":28},"21ccdb34-414d-420f-8a60-a592a2fa848e","2023-05-29T10:42:53.358+00:00","2026-08-27T01:57:29.560+00:00",[],"Vietnam-Journal-of-Earth-Sciences",{"country":751,"eissn":752,"issn":754,"title":756,"introduce":758,"gsId":760},{"VOID":15},{"VOID":753},"26159783",{"VOID":755},"08667187",{"EN":757},"Vietnam Journal of Earth Sciences",{"EN":759},"Science of the Earth, formerly Vietnam Journal of Earth Sciences, is a peer-reviewed journal to publish high-quality articles on the entire range of earth sciences and the environment, focused on the Asia Pacific region and their correlations and connections to the globe. The journal publishes fundamental and applied research in earth sciences and the environment, including geology, geophysics, geography, soil science, hydrology, meteorology, oceanography, petroleum, geohazards, environmental sciences, environmental engineering, sustainable development, geoinformatics, geodesy, GIS, and remote sensing.",{"VOID":761},"5htfr3YAAAAJ",[],[764],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":765,"slug":28,"properties":766,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":770,"statistic":28},[],{"title":767,"country":768,"abbreviation":769},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[772,789,800],{"id":773,"indexDatabase":774,"url":784,"indexYears":785,"academicFieldIds":786,"indexDatabaseRanking":788},"6ace2085-a177-4a27-b309-8813b832111e",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":776,"label":777,"description":779,"key":781,"publicationTags":782,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":778,"VI":778},"Scopus - Elsevier",{"EN":778,"VI":780},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[783],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[787],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":790,"indexDatabase":791,"url":796,"indexYears":797,"academicFieldIds":798,"indexDatabaseRanking":28},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":792,"label":793,"description":794,"key":94,"publicationTags":795,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[799],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf",{"id":801,"indexDatabase":802,"url":814,"indexYears":28,"academicFieldIds":815,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":804,"label":805,"description":807,"key":810,"publicationTags":811,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":806,"VI":806},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":808,"VI":809},"ESCI database","Cơ sở dữ liệu ESCI","esci",[812,813],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[816],"0db73426-2364-455f-81a4-efe0f91d712e","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":32,"impactFactorByYear":819,"i10Index":151,"i10IndexLast5Year":132,"totalPublication":824,"totalPublicationByYear":825,"totalCitation":827,"totalCitationByYear":828,"totalCitationPerPublication":838,"totalCitationPerPublicationByYear":839,"hindexLast5Year":129,"hindex":129},{"2007":513,"2008":513,"2010":513,"2011":107,"2012":513,"2013":513,"2014":317,"2015":107,"2016":54,"2017":168,"2018":222,"2019":820,"2020":821,"2021":371,"2022":445,"2023":822,"2024":823},1.03,1.08,1.49,1.43,1180,{"2000":689,"2001":688,"2002":281,"2003":160,"2004":279,"2005":325,"2006":516,"2007":137,"2008":200,"2009":162,"2010":436,"2011":826,"2012":434,"2013":689,"2014":280,"2015":152,"2016":150,"2017":148,"2018":352,"2019":147,"2020":152,"2021":69,"2022":148,"2023":280,"2024":139,"2025":45},79,2421,{"2000":205,"2001":51,"2002":145,"2003":146,"2004":126,"2005":51,"2006":130,"2007":128,"2008":127,"2009":152,"2010":122,"2011":137,"2012":567,"2013":200,"2014":829,"2015":687,"2016":830,"2017":831,"2018":832,"2019":833,"2020":834,"2021":835,"2022":836,"2023":837,"2024":145,"2025":40},73,197,219,380,281,328,148,183,160,2.05,{"2000":365,"2001":168,"2002":365,"2003":167,"2004":168,"2005":121,"2006":224,"2007":840,"2008":118,"2009":367,"2010":284,"2011":170,"2012":707,"2013":693,"2014":822,"2015":841,"2016":842,"2017":843,"2018":844,"2019":845,"2020":846,"2021":847,"2022":848,"2023":849,"2024":52,"2025":168},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":28,"impactFactorByYear":28,"i10Index":435,"i10IndexLast5Year":155,"totalPublication":130,"totalPublicationByYear":851,"totalCitation":852,"totalCitationByYear":853,"totalCitationPerPublication":860,"totalCitationPerPublicationByYear":861,"hindexLast5Year":136,"hindex":133},{"1017":40,"2015":40,"2016":123,"2017":42,"2018":42,"2019":40,"2020":45,"2022":123,"2023":123,"2024":40},3528,{"2014":323,"2015":140,"2016":201,"2017":158,"2018":522,"2019":613,"2020":854,"2021":855,"2022":701,"2023":856,"2024":857,"2025":858,"2026":859},280,403,436,525,589,366,176.4,{"2015":140,"2016":862,"2017":134,"2018":352,"2019":613,"2020":159,"2022":863,"2023":864,"2024":857},20.5,212.5,218,{"code":866,"data":867,"meta":28},"SUCCESS",{"id":868,"createTime":869,"updateTime":870,"relativeEntities":871,"slug":872,"properties":873,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":885,"manageAffiliations":892,"indexDatabases":907,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},"8c436608-816b-41f0-97c5-bb871bdd9452","2023-05-29T10:29:57.564+00:00","2025-11-21T09:59:11.153+00:00",[],"Evolutionary-Computation",{"country":874,"eissn":876,"issn":878,"title":880,"introduce":882},{"VOID":875},"US",{"VOID":877},"10636560",{"VOID":879},"15309304",{"EN":881},"Evolutionary Computation",{"EN":883},"Evolutionary Computation is a leading journal in its field. It provides an international forum for facilitating and enhancing the exchange of information among researchers involved in both the theoretical and practical aspects of computational systems drawing their inspiration from nature, with particular emphasis on evolutionary models of computation such as genetic algorithms, evolutionary strategies, classifier systems, evolutionary programming, and genetic programming. It welcomes articles from related fields such as swarm intelligence (e.g. Ant Colony Optimization and Particle Swarm Optimization), and other nature-inspired computation paradigms (e.g. Artificial Immune Systems). As well as publishing articles describing theoretical and\u002For experimental work, the journal also welcomes application-focused papers describing breakthrough results in an application domain or methodological papers where the specificities of the real-world problem led to significant algorithmic improvements that could possibly be generalized to other areas.","PENDING",[886],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":888,"label":889,"description":891,"parentId":28,"standard":28,"scholarHubFieldId":28},"0bfb7244-5877-4f77-9f03-0a51be00abe5",[],{"EN":890},"Computational Mathematics",{},[893,900],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":895,"slug":28,"properties":896,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":899,"statistic":28},"d2e08932-7781-40fe-b102-af9d11e32212",[],{"title":897},{"EN":898},"MIT PRESS",[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":902,"slug":28,"properties":903,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":906,"statistic":28},"ee8d4098-118a-4f29-a12a-344dfd0bb635",[],{"title":904},{"EN":905},"MIT Press Journals",[],[908,920],{"id":909,"indexDatabase":910,"url":915,"indexYears":916,"academicFieldIds":917,"indexDatabaseRanking":919},"f685fb82-623a-4b14-89ce-356d5dc6c7a0",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":911,"label":912,"description":913,"key":781,"publicationTags":914,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F24966","1996-2024",[918],"0ae9247a-0be3-46d8-a17e-488fa168abcc","SCOPUS__Q2",{"id":921,"indexDatabase":922,"url":933,"indexYears":28,"academicFieldIds":934,"indexDatabaseRanking":28},"8b5b0332-a011-4708-8ed8-252aa339367c",{"id":923,"createTime":28,"updateTime":28,"relativeEntities":924,"label":925,"description":927,"key":930,"publicationTags":931,"standard":28},"a4921856-b128-4d9f-8f1f-e80813d3bbd4",[],{"EN":926,"VI":926},"ISI\u002FSCIE - Science Citation Index Expanded",{"EN":928,"VI":929},"SCIE database","Cơ sở dữ liệu SCIE","scie",[932,813],"SCIE","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=1063-6560",[935],"874c55e0-262a-4246-b3d1-85e02c3c09db","https:\u002F\u002Fwww.mitpressjournals.org\u002Floi\u002Fevco",{"meta":938,"data":940},{"total":939},"11",[941,1072,1228,1374,1493,1676,1806,1895,2009,2154],{"id":942,"createTime":943,"updateTime":944,"relativeEntities":945,"slug":946,"properties":947,"entityType":959,"verifyStatus":26,"verifyTime":943,"verifyNote":960,"languages":961,"translateLanguages":962,"viewCount":32,"primaryUrl":963,"fullTextUrl":28,"authors":964,"publicationType":1003,"publisherRelationship":1004,"citationCount":1050,"citationInfo":1051,"publishDate":1065,"publishYear":1052,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":1066,"openAccess":28,"references":1067,"isForceReanalyzing":1071},"c5c5808e-6e59-405a-9b81-da9ec494b3e7","2024-10-03T23:35:03.615+00:00","2026-09-13T10:12:41.601+00:00",[],"Muiltiobjective-Optimization-Using-Nondominated-Sorting-in-Genetic-Algorithms",{"openalex":948,"mag":950,"abstract":952,"title":954,"doi":957},{"VOID":949},"W2116661285",{"VOID":951},"2116661285",{"EN":953},"\u003Cjats:p> In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands that the user have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. Since genetic algorithms (GAs) work with a population of points, it seems natural to use GAs in multiobjective optimization problems to capture a number of solutions simultaneously. Although a vector evaluated GA (VEGA) has been implemented by Schaffer and has been tried to solve a number of multiobjective problems, the algorithm seems to have bias toward some regions. In this paper, we investigate Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously. The proof-of-principle results obtained on three problems used by Schaffer and others suggest that the proposed method can be extended to higher dimensional and more difficult multiobjective problems. A number of suggestions for extension and application of the algorithm are also discussed. \u003C\u002Fjats:p>",{"EN":955,"VI":956},"Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms","Tối ưu hóa đa mục tiêu sử dụng sắp xếp không bị trội trong các thuật toán di truyền",{"VOID":958},"10.1162\u002Fevco.1994.2.3.221","PUBLICATION","Auto Verify",[31],[30],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F2\u002F3\u002F221-248\u002F1396",[965,984],{"id":966,"sortIndex":32,"researcher":28,"roles":967,"affiliations":968,"properties":977,"displayName":981,"givenName":28,"familyName":28},"d418ce72-d360-4051-902c-090516ab0db4",[],[969],{"id":970,"sortIndex":32,"affiliation":971,"properties":28},"bcf64ee7-e6b1-4276-96c6-a0dbd9862820",{"id":970,"createTime":28,"updateTime":28,"relativeEntities":972,"slug":28,"properties":973,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":976,"statistic":28},[],{"title":974},{"EN":975},"Department of Mechanical Engineering Indian Institute of Technology Kanpur, UP 208 016, India#TAB#",[],{"orcid":978,"title":980,"openalex":982},{"VOID":979},"https:\u002F\u002Forcid.org\u002F0000-0003-1856-3082",{"EN":981},"Srinivas Nagaballi",{"VOID":983},"A5027939665",{"id":985,"sortIndex":40,"researcher":28,"roles":986,"affiliations":987,"properties":996,"displayName":1000,"givenName":28,"familyName":28},"fe7bcda0-4e1b-466a-bdf2-8bf1e9cbdaf8",[],[988],{"id":989,"sortIndex":32,"affiliation":990,"properties":28},"7872722a-5237-4b0d-a5fc-26a6755bd44c",{"id":989,"createTime":28,"updateTime":28,"relativeEntities":991,"slug":28,"properties":992,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":995,"statistic":28},[],{"title":993},{"EN":994},"Department of Mechanical Engineering Indian Institute of Technology Kanpur, UP 208016, India deb@iitk.ernet.in",[],{"orcid":997,"title":999,"openalex":1001},{"VOID":998},"https:\u002F\u002Forcid.org\u002F0000-0001-7402-9939",{"EN":1000},"Kalyanmoy Deb",{"VOID":1002},"A5088394271","ARTICLE",{"url":28,"publisher":1005,"properties":1043},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1006,"slug":872,"properties":1007,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1012,"manageAffiliations":1017,"indexDatabases":1028,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1008,"eissn":1009,"issn":1010,"title":1011},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1013],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1014,"label":1015,"description":1016,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1018,1023],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1019,"slug":28,"properties":1020,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1022,"statistic":28},[],{"title":1021},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1024,"slug":28,"properties":1025,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1027,"statistic":28},[],{"title":1026},{"EN":905},[],[1029,1036],{"id":909,"indexDatabase":1030,"url":915,"indexYears":916,"academicFieldIds":1035,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1031,"label":1032,"description":1033,"key":781,"publicationTags":1034,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1037,"url":933,"indexYears":28,"academicFieldIds":1042,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1038,"label":1039,"description":1040,"key":930,"publicationTags":1041,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1044,"pages":1046,"volume":1048},{"VOID":1045},"3",{"VOID":1047},"221-248",{"VOID":1049},"2",6390,{"total":1050,"publishYear":1052,"statisticByYear":1053},1994,{"2012":1054,"2013":1055,"2014":1056,"2015":615,"2016":1057,"2017":1058,"2018":1059,"2019":1060,"2020":1061,"2021":576,"2022":1062,"2023":1063,"2024":1064},308,332,320,305,335,325,331,309,324,330,229,"1994-09-01",[932],[1068],{"id":28,"text":1069,"url":28,"identifiers":1070},"Tamura K., Optimization Theoryand Applications, 27, 509",{},false,{"id":1073,"createTime":1074,"updateTime":1075,"relativeEntities":1076,"slug":1077,"properties":1078,"entityType":959,"verifyStatus":26,"verifyTime":1074,"verifyNote":960,"languages":1092,"translateLanguages":1093,"viewCount":32,"primaryUrl":1094,"fullTextUrl":28,"authors":1095,"publicationType":1003,"publisherRelationship":1146,"citationCount":1191,"citationInfo":1192,"publishDate":1208,"publishYear":1193,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":1209,"openAccess":28,"references":1210,"isForceReanalyzing":1071},"4f541038-5292-4aee-bbc7-c0e7b0e201e2","2024-09-01T20:18:02.280+00:00","2026-09-14T04:14:29.563+00:00",[],"Comparison-of-Multiobjective-Evolutionary-Algorithms-Empirical-Results",{"openalex":1079,"mag":1081,"abstract":1083,"title":1085,"pm":1088,"doi":1090},{"VOID":1080},"W2125899728",{"VOID":1082},"2125899728",{"EN":1084},"\u003Cjats:p> In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in converging to the Pareto-optimal front (e.g., multimodality and deception). By investigating these different problem features separately, it is possible to predict the kind of problems to which a certain technique is or is not well suited. However, in contrast to what was suspected beforehand, the experimental results indicate a hierarchy of the algorithms under consideration. Furthermore, the emerging effects are evidence that the suggested test functions provide sufficient complexity to compare multiobjective optimizers. Finally, elitism is shown to be an important factor for improving evolutionary multiobjective search. \u003C\u002Fjats:p>",{"EN":1086,"VI":1087},"Comparison of Multiobjective Evolutionary Algorithms: Empirical Results","So sánh các thuật toán tiến hóa đa mục tiêu: Các kết quả thực nghiệm",{"VOID":1089},"10843520",{"VOID":1091},"10.1162\u002F106365600568202",[31],[30],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F8\u002F2\u002F173-195\u002F868",[1096,1113,1129],{"id":1097,"sortIndex":32,"researcher":28,"roles":1098,"affiliations":1099,"properties":1108,"displayName":1110,"givenName":28,"familyName":28},"dccb41bd-34ad-4401-b0bb-d599f721a82a",[],[1100],{"id":1101,"sortIndex":32,"affiliation":1102,"properties":28},"26ded15b-2a13-4b9d-babb-e87fdc7f3ba0",{"id":1101,"createTime":28,"updateTime":28,"relativeEntities":1103,"slug":28,"properties":1104,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1107,"statistic":28},[],{"title":1105},{"EN":1106},"Department of Electrical Engineering, Swiss Federal Institute of Technology 8092 Zurich, Switzerland",[],{"title":1109,"openalex":1111},{"EN":1110},"Eckart Zitzler",{"VOID":1112},"A5031698269",{"id":1114,"sortIndex":40,"researcher":28,"roles":1115,"affiliations":1116,"properties":1125,"displayName":1000,"givenName":28,"familyName":28},"fcf225bf-f348-4571-8e0f-e6f9b3b28753",[],[1117],{"id":1118,"sortIndex":32,"affiliation":1119,"properties":28},"c87dfc9c-0abb-460e-a83f-de2cbee3b521",{"id":1118,"createTime":28,"updateTime":28,"relativeEntities":1120,"slug":28,"properties":1121,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1124,"statistic":28},[],{"title":1122},{"EN":1123},"Department of Mechanical Engineering, Indian Institute of Technology Kanpur, Kanpur, PIN 208 016, India",[],{"orcid":1126,"title":1127,"openalex":1128},{"VOID":998},{"EN":1000},{"VOID":1002},{"id":1130,"sortIndex":123,"researcher":28,"roles":1131,"affiliations":1132,"properties":1139,"displayName":1143,"givenName":28,"familyName":28},"afba2cda-aec2-464e-a1ef-bbf3eae6121d",[],[1133],{"id":1101,"sortIndex":32,"affiliation":1134,"properties":28},{"id":1101,"createTime":28,"updateTime":28,"relativeEntities":1135,"slug":28,"properties":1136,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1138,"statistic":28},[],{"title":1137},{"EN":1106},[],{"orcid":1140,"title":1142,"openalex":1144},{"VOID":1141},"https:\u002F\u002Forcid.org\u002F0000-0001-6139-868X",{"EN":1143},"Lothar Thiele",{"VOID":1145},"A5060999697",{"url":28,"publisher":1147,"properties":1185},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1148,"slug":872,"properties":1149,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1154,"manageAffiliations":1159,"indexDatabases":1170,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1150,"eissn":1151,"issn":1152,"title":1153},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1155],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1156,"label":1157,"description":1158,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1160,1165],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1161,"slug":28,"properties":1162,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1164,"statistic":28},[],{"title":1163},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1166,"slug":28,"properties":1167,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1169,"statistic":28},[],{"title":1168},{"EN":905},[],[1171,1178],{"id":909,"indexDatabase":1172,"url":915,"indexYears":916,"academicFieldIds":1177,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1173,"label":1174,"description":1175,"key":781,"publicationTags":1176,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1179,"url":933,"indexYears":28,"academicFieldIds":1184,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1180,"label":1181,"description":1182,"key":930,"publicationTags":1183,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1186,"pages":1187,"volume":1189},{"VOID":1049},{"VOID":1188},"173-195",{"VOID":1190},"8",5131,{"total":1191,"publishYear":1193,"statisticByYear":1194},2000,{"2012":1195,"2013":1196,"2014":1197,"2015":1198,"2016":1199,"2017":1200,"2018":1201,"2019":1202,"2020":1203,"2021":1204,"2022":1205,"2023":1206,"2024":1207},259,278,265,329,268,272,235,271,287,333,292,285,155,"2000-06-01",[919,932],[1211,1214,1217,1220,1223,1225],{"id":28,"text":1212,"url":28,"identifiers":1213},"10.1162\u002Fevco.1999.7.3.205",{"doi":1212},{"id":28,"text":1215,"url":28,"identifiers":1216},"10.1162\u002Fevco.1995.3.1.1",{"doi":1215},{"id":28,"text":1218,"url":28,"identifiers":1219},"10.1109\u002F3468.650320",{"doi":1218},{"id":28,"text":1221,"url":28,"identifiers":1222},"10.1007\u002FBF01759923",{"doi":1221},{"id":28,"text":958,"url":28,"identifiers":1224},{"doi":958},{"id":28,"text":1226,"url":28,"identifiers":1227},"10.1109\u002F4235.797969",{"doi":1226},{"id":1229,"createTime":1230,"updateTime":1230,"relativeEntities":1231,"slug":1232,"properties":1233,"entityType":959,"verifyStatus":26,"verifyTime":1230,"verifyNote":960,"languages":1246,"translateLanguages":28,"viewCount":32,"primaryUrl":1247,"fullTextUrl":28,"authors":1248,"publicationType":1003,"publisherRelationship":1283,"citationCount":1328,"citationInfo":1329,"publishDate":1338,"publishYear":1330,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":1339,"openAccess":28,"references":1340,"isForceReanalyzing":1071},"3a1af5f0-1bf9-44ef-bb82-1cb830d26952","2024-09-02T01:29:56.418+00:00",[],"Completely-Derandomized-Self-Adaptation-in-Evolution-Strategies",{"openalex":1234,"mag":1236,"abstract":1238,"title":1240,"pm":1242,"doi":1244},{"VOID":1235},"W2112036188",{"VOID":1237},"2112036188",{"EN":1239},"\u003Cjats:p> This paper puts forward two useful methods for self-adaptation of the mutation distribution - the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adaptation of arbitrary (normal) mutation distributions are developed. Applying arbitrary, normal mutation distributions is equiv-alent to applying a general, linear problem encoding. \u003C\u002Fjats:p>\u003Cjats:p> The underlying objective of mutative strategy parameter control is roughly to favor previously selected mutation steps in the future. If this objective is pursued rigor-ously, a completely derandomized self-adaptation scheme results, which adapts arbitrary normal mutation distributions. This scheme, called covariance matrix adaptation (CMA), meets the previously stated demands. It can still be considerably improved by cumulation - utilizing an evolution path rather than single search steps. \u003C\u002Fjats:p>\u003Cjats:p> Simulations on various test functions reveal local and global search properties of the evolution strategy with and without covariance matrix adaptation. Their performances are comparable only on perfectly scaled functions. On badly scaled, non-separable functions usually a speed up factor of several orders of magnitude is ob-served. On moderately mis-scaled functions a speed up factor of three to ten can be expected. \u003C\u002Fjats:p>",{"EN":1241},"Completely Derandomized Self-Adaptation in Evolution Strategies",{"VOID":1243},"11382355",{"VOID":1245},"10.1162\u002F106365601750190398",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F9\u002F2\u002F159-195\u002F892",[1249,1268],{"id":1250,"sortIndex":32,"researcher":28,"roles":1251,"affiliations":1252,"properties":1261,"displayName":1265,"givenName":28,"familyName":28},"d7046ef2-e765-44e9-84ce-0fe0441f90ec",[],[1253],{"id":1254,"sortIndex":32,"affiliation":1255,"properties":28},"ed0468fe-a022-4f35-8735-f796dd13b541",{"id":1254,"createTime":28,"updateTime":28,"relativeEntities":1256,"slug":28,"properties":1257,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1260,"statistic":28},[],{"title":1258},{"EN":1259},"Technische Universität Berlin, Fachgebiet für Bionik, Sekr. ACK 1, Ackerstr. 71-76, 13355 Berlin, Germany,",[],{"orcid":1262,"title":1264,"openalex":1266},{"VOID":1263},"https:\u002F\u002Forcid.org\u002F0000-0001-7788-4906",{"EN":1265},"Nikolaus Hansen",{"VOID":1267},"A5039669927",{"id":1269,"sortIndex":40,"researcher":28,"roles":1270,"affiliations":1271,"properties":1278,"displayName":1280,"givenName":28,"familyName":28},"4dfde387-79e7-46a1-a45e-a5d0fb54e667",[],[1272],{"id":1254,"sortIndex":32,"affiliation":1273,"properties":28},{"id":1254,"createTime":28,"updateTime":28,"relativeEntities":1274,"slug":28,"properties":1275,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1277,"statistic":28},[],{"title":1276},{"EN":1259},[],{"title":1279,"openalex":1281},{"EN":1280},"Andreas Ostermeier",{"VOID":1282},"A5030069735",{"url":28,"publisher":1284,"properties":1322},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1285,"slug":872,"properties":1286,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1291,"manageAffiliations":1296,"indexDatabases":1307,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1287,"eissn":1288,"issn":1289,"title":1290},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1292],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1293,"label":1294,"description":1295,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1297,1302],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1298,"slug":28,"properties":1299,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1301,"statistic":28},[],{"title":1300},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1303,"slug":28,"properties":1304,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1306,"statistic":28},[],{"title":1305},{"EN":905},[],[1308,1315],{"id":909,"indexDatabase":1309,"url":915,"indexYears":916,"academicFieldIds":1314,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1310,"label":1311,"description":1312,"key":781,"publicationTags":1313,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1316,"url":933,"indexYears":28,"academicFieldIds":1321,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1317,"label":1318,"description":1319,"key":930,"publicationTags":1320,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1323,"pages":1324,"volume":1326},{"VOID":1049},{"VOID":1325},"159-195",{"VOID":1327},"9",3678,{"total":1328,"publishYear":1330,"statisticByYear":1331},2001,{"2012":1332,"2013":1207,"2014":570,"2015":1333,"2016":1334,"2017":605,"2018":1335,"2019":1336,"2020":1196,"2021":1203,"2022":1195,"2023":1337,"2024":362},175,185,202,242,277,245,"2001-06-01",[919,932],[1341,1344,1347,1350,1353,1356,1359,1362,1365,1368,1371],{"id":28,"text":1342,"url":28,"identifiers":1343},"10.1162\u002Fevco.1993.1.1.1",{"doi":1342},{"id":28,"text":1345,"url":28,"identifiers":1346},"10.1109\u002F4235.585888",{"doi":1345},{"id":28,"text":1348,"url":28,"identifiers":1349},"10.1162\u002Fevco.1995.3.1.81",{"doi":1348},{"id":28,"text":1351,"url":28,"identifiers":1352},"10.1162\u002Fevco.1995.3.3.311",{"doi":1351},{"id":28,"text":1354,"url":28,"identifiers":1355},"Cerveri P., 2001, IEEE Transactions on Evolutionary Computation, in press.",{},{"id":28,"text":1357,"url":28,"identifiers":1358},"10.1145\u002F163428.163431",{"doi":1357},{"id":28,"text":1360,"url":28,"identifiers":1361},"10.1016\u002FS0925-2312(00)00328-3",{"doi":1360},{"id":28,"text":1363,"url":28,"identifiers":1364},"10.2514\u002F2.2313",{"doi":1363},{"id":28,"text":1366,"url":28,"identifiers":1367},"Olhofer M., 2000, Parmee, I., editor, Adaptive Computing in Design and Manufacture (ACDM), pages, 45",{},{"id":28,"text":1369,"url":28,"identifiers":1370},"10.1162\u002Fevco.1994.2.4.369",{"doi":1369},{"id":28,"text":1372,"url":28,"identifiers":1373},"10.1016\u002F0004-3702(95)00124-7",{"doi":1372},{"id":1375,"createTime":1376,"updateTime":1376,"relativeEntities":1377,"slug":1378,"properties":1379,"entityType":959,"verifyStatus":26,"verifyTime":1389,"verifyNote":960,"languages":1390,"translateLanguages":28,"viewCount":32,"primaryUrl":1391,"fullTextUrl":28,"authors":1392,"publicationType":1003,"publisherRelationship":1431,"citationCount":1476,"citationInfo":1477,"publishDate":1483,"publishYear":1478,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":1484,"openAccess":28,"references":1485,"isForceReanalyzing":1071},"b7e0a3d0-f26a-4753-8c86-fe6ae3f3a840","2024-10-03T23:35:03.606+00:00",[],"An-Overview-of-Evolutionary-Algorithms-in-Multiobjective-Optimization",{"openalex":1380,"mag":1382,"abstract":1384,"title":1386,"doi":1388},{"VOID":1381},"W2121365620",{"VOID":1383},"2121365620",{"EN":1385},"\u003Cjats:p> The application of evolutionary algorithms (EAs) in multiobjective optimization is currently receiving growing interest from researchers with various backgrounds. Most research in this area has understandably concentrated on the selection stage of EAs, due to the need to integrate vectorial performance measures with the inherently scalar way in which EAs reward individual performance, that is, number of offspring. \u003C\u002Fjats:p>\u003Cjats:p> In this review, current multiobjective evolutionary approaches are discussed, ranging from the conventional analytical aggregation of the different objectives into a single function to a number of population-based approaches and the more recent ranking schemes based on the definition of Pareto optimality. The sensitivity of different methods to objective scaling and\u002For possible concavities in the trade-off surface is considered, and related to the (static) fitness landscapes such methods induce on the search space. From the discussion, directions for future research in multiobjective fitness assignment and search strategies are identified, including the incorporation of decision making in the selection procedure, fitness sharing, and adaptive representations. \u003C\u002Fjats:p>",{"EN":1387},"An Overview of Evolutionary Algorithms in Multiobjective Optimization",{"VOID":1215},"2024-10-03T23:35:03.605+00:00",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F3\u002F1\u002F1-16\u002F733",[1393,1412],{"id":1394,"sortIndex":32,"researcher":28,"roles":1395,"affiliations":1396,"properties":1405,"displayName":1409,"givenName":28,"familyName":28},"5476bcb0-dd77-424b-b933-2d3337cd33ce",[],[1397],{"id":1398,"sortIndex":32,"affiliation":1399,"properties":28},"f2a5301c-db4e-419b-a4c7-8eb8ea9d00de",{"id":1398,"createTime":28,"updateTime":28,"relativeEntities":1400,"slug":28,"properties":1401,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1404,"statistic":28},[],{"title":1402},{"EN":1403},"[Department of Automatic Control and Systems Engmeering The University of Sheffield Sheffield S1 3JD, U.K. C.Fonseca@shef.ac.uk]",[],{"orcid":1406,"title":1408,"openalex":1410},{"VOID":1407},"https:\u002F\u002Forcid.org\u002F0000-0001-5162-2457",{"EN":1409},"Carlos M. Fonseca",{"VOID":1411},"A5038504776",{"id":1413,"sortIndex":40,"researcher":28,"roles":1414,"affiliations":1415,"properties":1424,"displayName":1428,"givenName":28,"familyName":28},"1eb60403-b4df-4f63-9094-a48d9ecc7469",[],[1416],{"id":1417,"sortIndex":32,"affiliation":1418,"properties":28},"738e40fb-6552-4433-afaa-4bf6fe343b27",{"id":1417,"createTime":28,"updateTime":28,"relativeEntities":1419,"slug":28,"properties":1420,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1423,"statistic":28},[],{"title":1421},{"EN":1422},"[Department of Automatic Control and Systems Engineering The University of Sheffield Sheffield S1 3JD, U.K. P.Fleming@shef.ac.uk]",[],{"orcid":1425,"title":1427,"openalex":1429},{"VOID":1426},"https:\u002F\u002Forcid.org\u002F0000-0001-9837-8404",{"EN":1428},"P.J. Fleming",{"VOID":1430},"A5071374930",{"url":28,"publisher":1432,"properties":1470},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1433,"slug":872,"properties":1434,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1439,"manageAffiliations":1444,"indexDatabases":1455,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1435,"eissn":1436,"issn":1437,"title":1438},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1440],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1441,"label":1442,"description":1443,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1445,1450],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1446,"slug":28,"properties":1447,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1449,"statistic":28},[],{"title":1448},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1451,"slug":28,"properties":1452,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1454,"statistic":28},[],{"title":1453},{"EN":905},[],[1456,1463],{"id":909,"indexDatabase":1457,"url":915,"indexYears":916,"academicFieldIds":1462,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1458,"label":1459,"description":1460,"key":781,"publicationTags":1461,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1464,"url":933,"indexYears":28,"academicFieldIds":1469,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1465,"label":1466,"description":1467,"key":930,"publicationTags":1468,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1471,"pages":1473,"volume":1475},{"VOID":1472},"1",{"VOID":1474},"1-16",{"VOID":1045},2242,{"total":1476,"publishYear":1478,"statisticByYear":1479},1995,{"2012":154,"2013":1480,"2014":1481,"2015":1482,"2016":599,"2017":151,"2018":159,"2019":516,"2020":689,"2021":208,"2022":196,"2023":434,"2024":133},81,116,104,"1995-03-01",[932],[1486,1489,1491],{"id":28,"text":1487,"url":28,"identifiers":1488},"10.1162\u002Fevco.1993.1.3.213",{"doi":1487},{"id":28,"text":1221,"url":28,"identifiers":1490},{"doi":1221},{"id":28,"text":958,"url":28,"identifiers":1492},{"doi":958},{"id":1494,"createTime":1495,"updateTime":1495,"relativeEntities":1496,"slug":1497,"properties":1498,"entityType":959,"verifyStatus":26,"verifyTime":1495,"verifyNote":960,"languages":1509,"translateLanguages":28,"viewCount":32,"primaryUrl":1510,"fullTextUrl":28,"authors":1511,"publicationType":1003,"publisherRelationship":1550,"citationCount":1595,"citationInfo":1596,"publishDate":1600,"publishYear":1597,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":1601,"openAccess":28,"references":1602,"isForceReanalyzing":1071},"14409890-7a0b-4a06-8aca-7597d8a9fd1a","2024-10-09T21:58:12.590+00:00",[],"Evolutionary-Algorithms-for-Constrained-Parameter-Optimization-Problems",{"openalex":1499,"mag":1501,"abstract":1503,"title":1505,"doi":1507},{"VOID":1500},"W2164655924",{"VOID":1502},"2164655924",{"EN":1504},"\u003Cjats:p> Evolutionary computation techniques have received a great deal of attention regarding their potential as optimization techniques for complex numerical functions. However, they have not produced a significant breakthrough in the area of nonlinear programming due to the fact that they have not addressed the issue of constraints in a systematic way. Only recently have several methods been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; however, these methods have several drawbacks, and the experimental results on many test cases have been disappointing. \u003C\u002Fjats:p>\u003Cjats:p> In this paper we (1) discuss difficulties connected with solving the general nonlinear programming problem; (2) survey several approaches that have emerged in the evolutionary computation community; and (3) provide a set of 11 interesting test cases that may serve as a handy reference for future methods. \u003C\u002Fjats:p>",{"EN":1506},"Evolutionary Algorithms for Constrained Parameter Optimization Problems",{"VOID":1508},"10.1162\u002Fevco.1996.4.1.1",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F4\u002F1\u002F1-32\u002F754",[1512,1531],{"id":1513,"sortIndex":32,"researcher":28,"roles":1514,"affiliations":1515,"properties":1524,"displayName":1528,"givenName":28,"familyName":28},"99e44a21-9740-4857-8835-2c1368c97bcf",[],[1516],{"id":1517,"sortIndex":32,"affiliation":1518,"properties":28},"4a7eefc3-a70b-4f8a-be07-7f36a9e80704",{"id":1517,"createTime":28,"updateTime":28,"relativeEntities":1519,"slug":28,"properties":1520,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1523,"statistic":28},[],{"title":1521},{"VI":1522},"University of North Carolina, Charlotte",[],{"orcid":1525,"title":1527,"openalex":1529},{"VOID":1526},"https:\u002F\u002Forcid.org\u002F0000-0001-5609-5457",{"EN":1528},"Zbigniew Michalewicz",{"VOID":1530},"A5072022501",{"id":1532,"sortIndex":40,"researcher":28,"roles":1533,"affiliations":1534,"properties":1543,"displayName":1547,"givenName":28,"familyName":28},"678ba83b-b86f-475f-bb46-794633f725fe",[],[1535],{"id":1536,"sortIndex":32,"affiliation":1537,"properties":28},"39490069-9b58-44dd-8984-4caf2e6f3070",{"id":1536,"createTime":28,"updateTime":28,"relativeEntities":1538,"slug":28,"properties":1539,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1542,"statistic":28},[],{"title":1540},{"EN":1541},"Centre de Mathématiques Appliquées - Ecole Polytechnique",[],{"orcid":1544,"title":1546,"openalex":1548},{"VOID":1545},"https:\u002F\u002Forcid.org\u002F0000-0003-1450-6830",{"EN":1547},"Marc Schoenauer",{"VOID":1549},"A5081938847",{"url":28,"publisher":1551,"properties":1589},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1552,"slug":872,"properties":1553,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1558,"manageAffiliations":1563,"indexDatabases":1574,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1554,"eissn":1555,"issn":1556,"title":1557},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1559],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1560,"label":1561,"description":1562,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1564,1569],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1565,"slug":28,"properties":1566,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1568,"statistic":28},[],{"title":1567},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1570,"slug":28,"properties":1571,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1573,"statistic":28},[],{"title":1572},{"EN":905},[],[1575,1582],{"id":909,"indexDatabase":1576,"url":915,"indexYears":916,"academicFieldIds":1581,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1577,"label":1578,"description":1579,"key":781,"publicationTags":1580,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1583,"url":933,"indexYears":28,"academicFieldIds":1588,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1584,"label":1585,"description":1586,"key":930,"publicationTags":1587,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1590,"pages":1591,"volume":1593},{"VOID":1472},{"VOID":1592},"1-32",{"VOID":1594},"4",1628,{"total":1595,"publishYear":1597,"statisticByYear":1598},1996,{"2012":155,"2013":159,"2014":1599,"2015":161,"2016":151,"2017":50,"2018":328,"2019":689,"2020":281,"2021":206,"2022":50,"2023":161,"2024":149},95,"1996-03-01",[919,932],[1603,1606,1609,1612,1615,1618,1621,1624,1627,1630,1633,1636,1639,1642,1645,1648,1652,1655,1658,1661,1664,1667,1670,1673],{"id":28,"text":1604,"url":28,"identifiers":1605},"Back, T., Hoffmeister, F. & Schwefel, H.P. (199 1). A survey of evolution strategies. In R. K. Belew & L. B. Booker (Eds.), Pmceedizgs of the Fourth lntemational Conference on Genetic Algorithms (pp. 2-9). San Mateo, CA: Morgan Kaufmann.",{},{"id":28,"text":1607,"url":28,"identifiers":1608},"Bean, J. C. & Hadj-Alouane, A. B. (1992). Adiialgeizeticalgoritbmforboll?zded integerprogr-ams. Technical Report T R 92-53, Ann Arbor, MI: University ofMichigan, Department of Industrial and Operations Engineering.",{},{"id":28,"text":1610,"url":28,"identifiers":1611},"Bilchev, G. (1995). Private communication.",{},{"id":28,"text":1613,"url":28,"identifiers":1614},"Bilchev, G. & Parmee, I. (1995). Ant colony search vs. genetic algorithms. Technical Report. Plymouth, UK: University of Plymouth, Plymouth Engineering Design Centre.",{},{"id":28,"text":1616,"url":28,"identifiers":1617},"Colorni, A., Dorigo, M. & Maniezzo, V. (1991). Distributed optimization by ant colonies. In P. Bourgine & F. Varela (Eds.), Aaceedingsof the First European Coizference o n Artificial L i f . Cambridge, MA: M I T PresdBradford Books.",{},{"id":28,"text":1619,"url":28,"identifiers":1620},"Davis, L. (1989). Adapting operator probabilities in genetic algorithms. In J. D. Schaffer (Ed.), Proccedivzgs of the Third Intematio2nl Conference on Genetic Algorithms (pp. 61-69). San Mateo, CA: Morgan Kaufmann.",{},{"id":28,"text":1622,"url":28,"identifiers":1623},"Davis, L. (1995) Private communication.",{},{"id":28,"text":1625,"url":28,"identifiers":1626},"De Jong, K. (1 975). The adysi.s ofthe bebanior- of a clnss ofgenetic adaptive systems. Doctoral dissertation, University of Michigan, Ann Arbor. L)i.rseitatim~ Abstl-acts htematiowal,6( lo), 5 140B. (University Microfilms No 76-9381).",{},{"id":28,"text":1628,"url":28,"identifiers":1629},"Eiben, A., Raue, P.E. & Ruttkay, Z. (1994). Genetic algorithms with multi-parent recombination. In Y. Davidor, H.P. Schwefel, & R. MCnner (Eds.), Proceedings ojtbe Third Conference o n Paidlel Problem Solvingfi-om Napwe, Volume 866 of Lectwe Notes in Computer Science (pp. 78-87). Berlin: Springer-Verlag.",{},{"id":28,"text":1631,"url":28,"identifiers":1632},"Eshelman, L. & Schaffer, J. D. (1993). Real-coded genetic algorithms and interval-schemata. In L. D. Whitley (Ed.), Foendntionr of Genetic Algovithms 2 (pp. 187-202). Los Altos, CA: Morgan Kaufmann. parameter spaces. In Paceediizgs of the Third Annual Confkreie on Euokitioizaiy Progrumviing (pp. 84-97). River Edge, NJ: World Scientific.",{},{"id":28,"text":1634,"url":28,"identifiers":1635},"Michalewicz, Z. & Nazhiyath, G. (1995). Genocop 111: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. In D. B. Fogel (Ed.), PF-oceedingsof the Second IEEE bzteinntional Coizfererice o?a Eziokitionaiy Compiitation (pp. 647-65 1). Piscataway, NJ: IEEE Press.",{},{"id":28,"text":1637,"url":28,"identifiers":1638},"Michalewicz, Z., Nazhiyath, G. & Michalewicz, M. (1996). A note on usefulness of geometrical crossover for numerical optimization problems. In P. J. Angeline & T. Back (Eds.), Proceediizgs ofthe Ftfth A?zmal Conference on Eziohtionaiy Programming. Cambridge, MA: M I T Press. In press.",{},{"id":28,"text":1640,"url":28,"identifiers":1641},"Muhlenbein, H. & Voigt, HI.M. (1995). Gene pool recombination for the breeder genetic algorithm. In Proceedings of the 1nteirr.ational Couference on i21etaheiiristicsfor Optimization (pp. 19-2 5 ) . ilordrecht, The Netherlands: Kluwer Publishing.",{},{"id":28,"text":1643,"url":28,"identifiers":1644},"Myung, H., Kim, J.H. & Fogel, D. (1995). Preliminary investigation into a two-stage method of evolutionary optimization on constrained problems. in J. R. McDonnell, R. G. Reynolds, & D. B. Fogel (Eds.), Proceediugr of the Foirith Allllllal Coizference 011 Evoliitiomq Progr-amming (pp. 449-463). Cambridge, MA: M I T Press.",{},{"id":28,"text":1646,"url":28,"identifiers":1647},"Orvosh, D. & Davis, L. (1993). Shall we repair? Genetic algorithms, combinatorial optimization, and feasibility constraints. In S. Forrest (Ed.), Proceedings ofthe Fifth Intei7zntio?zal Coi$erencr on Gemtic Algorithms (p. 650). San Mateo, CA: Morgan Kaufmann.",{},{"id":28,"text":1649,"url":28,"identifiers":1650},"Paredis, J. ( I 994). Coevolutionary constraint satisfaction. In Y. Davidor, H.P. Schwefel, & R. Manner (Eds.), Proceedings of the Third Coi$ei.eizce on Parallel Problem SolzGngfi-om Nature (pp. 46-55). Berlin: Springer-Verlag.",{"doi":1651},"10.1007\u002F3-540-58484-6_249",{"id":28,"text":1653,"url":28,"identifiers":1654},"Parrnee, I. & Purchase, G. (1994). The development of directed genetic search technique for heavily constrained design spaces. In Proceedings of the Collfel-ence on Adaptiue Computing ii7 Engineering Desig-17 mid Control (pp. 97-102). Plymouth, UK: University of Plymouth.",{},{"id":28,"text":1656,"url":28,"identifiers":1657},"Powell, D. & Skolnick, M. M. (1993). Using genetic algorithms in engineering design optimization with non-linear constraints. In S. Forrest (Ed.), Proceedings of the Fifth bzteirzntional Coifereiice 077 Genetic Algorithms (pp. 424-430). San Mateo, CA: Morgan Kaufmann.",{},{"id":28,"text":1659,"url":28,"identifiers":1660},"Renders, J.M. & Bersini, H. (1 994). Hybridizing genetic algorithms with hill-climbing methods for global optimization: Two possible ways. In 2. Michalewicz, J. D. Schaffer, 11.P. Schwefel, D. B. Fogel, & H . Kitano (Eds.), Pruceedi7gr of the Fiirt IEEE Inte?rzatio?znl Coifereme o n Evolritioizniy Compitutioiz (pp. 3 12-3 17). Piscataway, NJ: IFXE Press.",{},{"id":28,"text":1662,"url":28,"identifiers":1663},"Keynolds R., 1994, Proceedings ofthe Third Amial Coizfererzce 011 Ezioliitionaty Programming (pp., 13, 1",{},{"id":28,"text":1665,"url":28,"identifiers":1666},"Reynolds, R., Michalewicz, Z. & Cavaretta, M. (1995). Using cultural algorithms for constraint handling in Genocop. In J. R. McDonnell, R. G. Reynolds, & D. B. Fogel (Eds.), Proceedings ofthe Fourth Anma1 Coizfereizce on Evolutionary A-ogramming (pp. 298-305). Cambridge, MA: M I T Press.",{},{"id":28,"text":1668,"url":28,"identifiers":1669},"Richardson, J. T, Palmer, M. R., Liepins, G. & Hilliard, M. (1989). Some guidelines for genetic algorithms with penalty functions. In J. D. Schaffer (Ed.), Proceedingr of the Third 17ztei7zatioiml Coizference 017 Genetic Algorithms (pp. 191-197). San Mateo, CA: Morgan Kaufmann.",{},{"id":28,"text":1671,"url":28,"identifiers":1672},"Schaffer, D. (1985). Multiple objective optimization with vector evaluated genetic algorithms. In J. J. Grefenstette (Ed.), Proceedings of\" the First Inteirzational Corzference on Genetic Algorithms. New York: Laurence Erlbaum Associates.",{},{"id":28,"text":1674,"url":28,"identifiers":1675},"Schoenauer, M. & Michalewicz, Z. (1996). Evolutionary computation at the edge of feasibility. In W. Ebeling & H.M. Voigt (Eds.), Paceediizgs of the Foziith Corzfeiwzee on Parallel Problem Solvingfi-om Natzire. Berlin: Springer-Verlag.",{},{"id":1677,"createTime":1678,"updateTime":1678,"relativeEntities":1679,"slug":1680,"properties":1681,"entityType":959,"verifyStatus":26,"verifyTime":1678,"verifyNote":960,"languages":1694,"translateLanguages":28,"viewCount":32,"primaryUrl":1695,"fullTextUrl":28,"authors":1696,"publicationType":1003,"publisherRelationship":1731,"citationCount":1775,"citationInfo":1776,"publishDate":1208,"publishYear":1193,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":1778,"openAccess":28,"references":1779,"isForceReanalyzing":1071},"5e7f1ec3-a5c6-405d-a12c-626f23173d9a","2024-10-03T23:35:07.741+00:00",[],"Multiobjective-Evolutionary-Algorithms-Analyzing-the-State-of-the-Art",{"openalex":1682,"mag":1684,"abstract":1686,"title":1688,"pm":1690,"doi":1692},{"VOID":1683},"W2125502051",{"VOID":1685},"2125502051",{"EN":1687},"\u003Cjats:p> Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied during the mid-eighties in an attempt to stochastically solve problems of this generic class. During the past decade, a variety of multiobjective EA (MOEA) techniques have been proposed and applied to many scientific and engineering applications. Our discussion's intent is to rigorously define multiobjective optimization problems and certain related concepts, present an MOEA classification scheme, and evaluate the variety of contemporary MOEAs. Current MOEA theoretical developments are evaluated; specific topics addressed include fitness functions, Pareto ranking, niching, fitness sharing, mating restriction, and secondary populations. Since the development and application of MOEAs is a dynamic and rapidly growing activity, we focus on key analytical insights based upon critical MOEA evaluation of current research and applications. Recommended MOEA designs are presented, along with conclusions and recommendations for future work. \u003C\u002Fjats:p>",{"EN":1689},"Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art",{"VOID":1691},"10843518",{"VOID":1693},"10.1162\u002F106365600568158",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F8\u002F2\u002F125-147\u002F870",[1697,1714],{"id":1698,"sortIndex":32,"researcher":28,"roles":1699,"affiliations":1700,"properties":1709,"displayName":1711,"givenName":28,"familyName":28},"8d2fce12-1bef-4aaf-b4b5-0b9a688d4851",[],[1701],{"id":1702,"sortIndex":32,"affiliation":1703,"properties":28},"8296a374-ac65-471c-9bc8-3751993d7c36",{"id":1702,"createTime":28,"updateTime":28,"relativeEntities":1704,"slug":28,"properties":1705,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1708,"statistic":28},[],{"title":1706},{"EN":1707},"Air Force Research Laboratory, Optical Radiation Branch, Brooks AFB, TX 78235, USA",[],{"title":1710,"openalex":1712},{"EN":1711},"David A. Van Veldhuizen",{"VOID":1713},"A5030786672",{"id":1715,"sortIndex":40,"researcher":28,"roles":1716,"affiliations":1717,"properties":1726,"displayName":1728,"givenName":28,"familyName":28},"80f760fd-0796-4bdf-b048-fd93ce6d8305",[],[1718],{"id":1719,"sortIndex":32,"affiliation":1720,"properties":28},"3090461e-c9ad-40c7-99b5-b5ced63551fd",{"id":1719,"createTime":28,"updateTime":28,"relativeEntities":1721,"slug":28,"properties":1722,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1725,"statistic":28},[],{"title":1723},{"VI":1724},"Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, OH 45433 USA",[],{"title":1727,"openalex":1729},{"EN":1728},"Gary B. Lamont",{"VOID":1730},"A5014121562",{"url":28,"publisher":1732,"properties":1770},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1733,"slug":872,"properties":1734,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1739,"manageAffiliations":1744,"indexDatabases":1755,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1735,"eissn":1736,"issn":1737,"title":1738},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1740],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1741,"label":1742,"description":1743,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1745,1750],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1746,"slug":28,"properties":1747,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1749,"statistic":28},[],{"title":1748},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1751,"slug":28,"properties":1752,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1754,"statistic":28},[],{"title":1753},{"EN":905},[],[1756,1763],{"id":909,"indexDatabase":1757,"url":915,"indexYears":916,"academicFieldIds":1762,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1758,"label":1759,"description":1760,"key":781,"publicationTags":1761,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1764,"url":933,"indexYears":28,"academicFieldIds":1769,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1765,"label":1766,"description":1767,"key":930,"publicationTags":1768,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1771,"pages":1772,"volume":1774},{"VOID":1049},{"VOID":1773},"125-147",{"VOID":1190},1175,{"total":1775,"publishYear":1193,"statisticByYear":1777},{"2012":689,"2013":434,"2014":328,"2015":207,"2016":206,"2017":328,"2018":150,"2019":150,"2020":137,"2021":516,"2022":202,"2023":148,"2024":205},[919,932],[1780,1783,1786,1789,1791,1793,1796,1798,1801,1804],{"id":28,"text":1781,"url":28,"identifiers":1782},"10.1002\u002F(SICI)1520-6750(199702)44:1\u003C47::AID-NAV3>3.0.CO;2-M",{"doi":1781},{"id":28,"text":1784,"url":28,"identifiers":1785},"10.1007\u002FBF03325101",{"doi":1784},{"id":28,"text":1787,"url":28,"identifiers":1788},"10.1080\u002F03052150008941301",{"doi":1787},{"id":28,"text":1212,"url":28,"identifiers":1790},{"doi":1212},{"id":28,"text":1215,"url":28,"identifiers":1792},{"doi":1215},{"id":28,"text":1794,"url":28,"identifiers":1795},"10.1109\u002F3468.650319",{"doi":1794},{"id":28,"text":958,"url":28,"identifiers":1797},{"doi":958},{"id":28,"text":1799,"url":28,"identifiers":1800},"10.1016\u002F0003-2670(92)85027-4",{"doi":1799},{"id":28,"text":1802,"url":28,"identifiers":1803},"10.1109\u002F4235.585893",{"doi":1802},{"id":28,"text":1226,"url":28,"identifiers":1805},{"doi":1226},{"id":1807,"createTime":1808,"updateTime":1808,"relativeEntities":1809,"slug":1810,"properties":1811,"entityType":959,"verifyStatus":26,"verifyTime":1808,"verifyNote":960,"languages":1822,"translateLanguages":28,"viewCount":32,"primaryUrl":1823,"fullTextUrl":28,"authors":1824,"publicationType":1003,"publisherRelationship":1842,"citationCount":1886,"citationInfo":1887,"publishDate":1889,"publishYear":1478,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":1890,"openAccess":28,"references":1891,"isForceReanalyzing":1071},"2da73c64-870e-4506-bd3e-f160742915b9","2024-09-28T08:10:20.117+00:00",[],"Strongly-Typed-Genetic-Programming",{"openalex":1812,"mag":1814,"abstract":1816,"title":1818,"doi":1820},{"VOID":1813},"W2027649639",{"VOID":1815},"2027649639",{"EN":1817},"\u003Cjats:p> Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on particular data types, this can lead to unnecessarily large search times and\u002For unnecessarily poor generalization performance. Strongly typed genetic programming (STGP) is an enhanced version of genetic programming that enforces data-type constraints and whose use of generic functions and generic data types makes it more powerful than other approaches to type-constraint enforcement. After describing its operation, we illustrate its use on problems in two domains, matrix\u002Fvector manipulation and list manipulation, which require its generality. The examples are (1) the multidimensional least-squares regression problem, (2) the multidimensional Kalman filter, (3) the list manipulation function NTH, and (4) the list manipulation function MAPCAR. \u003C\u002Fjats:p>",{"EN":1819},"Strongly Typed Genetic Programming",{"VOID":1821},"10.1162\u002Fevco.1995.3.2.199",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F3\u002F2\u002F199-230\u002F731",[1825],{"id":1826,"sortIndex":32,"researcher":28,"roles":1827,"affiliations":1828,"properties":1837,"displayName":1839,"givenName":28,"familyName":28},"e4952b44-c6dd-48bf-a831-b4330ec91b71",[],[1829],{"id":1830,"sortIndex":32,"affiliation":1831,"properties":28},"2f272929-802e-4847-a518-71324232c4e8",{"id":1830,"createTime":28,"updateTime":28,"relativeEntities":1832,"slug":28,"properties":1833,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1836,"statistic":28},[],{"title":1834},{"EN":1835},"Bolt Beranek and Newman, Inc. 70 Fawcett Street Cambridge, MA 02138 dmontana@bbn.com#TAB#",[],{"title":1838,"openalex":1840},{"EN":1839},"David J. Montana",{"VOID":1841},"A5103330610",{"url":28,"publisher":1843,"properties":1881},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1844,"slug":872,"properties":1845,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1850,"manageAffiliations":1855,"indexDatabases":1866,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1846,"eissn":1847,"issn":1848,"title":1849},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1851],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1852,"label":1853,"description":1854,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1856,1861],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1857,"slug":28,"properties":1858,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1860,"statistic":28},[],{"title":1859},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1862,"slug":28,"properties":1863,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1865,"statistic":28},[],{"title":1864},{"EN":905},[],[1867,1874],{"id":909,"indexDatabase":1868,"url":915,"indexYears":916,"academicFieldIds":1873,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1869,"label":1870,"description":1871,"key":781,"publicationTags":1872,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1875,"url":933,"indexYears":28,"academicFieldIds":1880,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1876,"label":1877,"description":1878,"key":930,"publicationTags":1879,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1882,"pages":1883,"volume":1885},{"VOID":1049},{"VOID":1884},"199-230",{"VOID":1045},877,{"total":1886,"publishYear":1478,"statisticByYear":1888},{"2012":278,"2013":139,"2014":131,"2015":132,"2016":128,"2017":130,"2018":122,"2019":136,"2020":149,"2021":358,"2022":136,"2023":130,"2024":127},"1995-06-01",[932],[1892],{"id":28,"text":1893,"url":28,"identifiers":1894},"10.1115\u002F1.3662552",{"doi":1893},{"id":1896,"createTime":1897,"updateTime":1897,"relativeEntities":1898,"slug":1899,"properties":1900,"entityType":959,"verifyStatus":26,"verifyTime":1897,"verifyNote":960,"languages":1913,"translateLanguages":28,"viewCount":32,"primaryUrl":1914,"fullTextUrl":28,"authors":1915,"publicationType":1003,"publisherRelationship":1951,"citationCount":1996,"citationInfo":1997,"publishDate":2000,"publishYear":1998,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":2001,"openAccess":28,"references":2002,"isForceReanalyzing":1071},"8485d0d1-2c6a-47a7-bb68-2bb82ec8126b","2024-09-12T17:09:02.860+00:00",[],"Introducing-Robustness-in-Multi-Objective-Optimization",{"openalex":1901,"mag":1903,"abstract":1905,"title":1907,"pm":1909,"doi":1911},{"VOID":1902},"W2166364496",{"VOID":1904},"2166364496",{"EN":1906},"\u003Cjats:p> In optimization studies including multi-objective optimization, the main focus is placed on finding the global optimum or global Pareto-optimal solutions, representing the best possible objective values. However, in practice, users may not always be interested in finding the so-called global best solutions, particularly when these solutions are quite sensitive to the variable perturbations which cannot be avoided in practice. In such cases, practitioners are interested in finding the robust solutions which are less sensitive to small perturbations in variables. Although robust optimization is dealt with in detail in single-objective evolutionary optimization studies, in this paper, we present two different robust multi-objective optimization procedures, where the emphasis is to find a robust frontier, instead of the global Pareto-optimal frontier in a problem. The first procedure is a straightforward extension of a technique used for single-objective optimization and the second procedure is a more practical approach enabling a user to set the extent of robustness desired in a problem. To demonstrate the differences between global and robust multi-objective optimization principles and the differences between the two robust optimization procedures suggested here, we develop a number of constrained and unconstrained test problems having two and three objectives and show simulation results using an evolutionary multi-objective optimization (EMO) algorithm. Finally, we also apply both robust optimization methodologies to an engineering design problem. \u003C\u002Fjats:p>",{"EN":1908},"Introducing Robustness in Multi-Objective Optimization",{"VOID":1910},"17109607",{"VOID":1912},"10.1162\u002Fevco.2006.14.4.463",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F14\u002F4\u002F463-494\u002F1251",[1916,1932],{"id":1917,"sortIndex":32,"researcher":28,"roles":1918,"affiliations":1919,"properties":1928,"displayName":1000,"givenName":28,"familyName":28},"c428e1fb-6617-45c8-9702-f3a1c2bc5863",[],[1920],{"id":1921,"sortIndex":32,"affiliation":1922,"properties":28},"52e03126-2be4-4eaa-96dc-0e515b708602",{"id":1921,"createTime":28,"updateTime":28,"relativeEntities":1923,"slug":28,"properties":1924,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1927,"statistic":28},[],{"title":1925},{"EN":1926},"Kanpur Genetic Algorithms Laboratory (KanGAL), Indian Institute of Technology Kanpur, Kanpur, PIN 208016, INDIA",[],{"orcid":1929,"title":1930,"openalex":1931},{"VOID":998},{"EN":1000},{"VOID":1002},{"id":1933,"sortIndex":40,"researcher":28,"roles":1934,"affiliations":1935,"properties":1944,"displayName":1948,"givenName":28,"familyName":28},"a3e140cd-8fbd-432d-9a40-3858f94ef21b",[],[1936],{"id":1937,"sortIndex":32,"affiliation":1938,"properties":28},"cd74bdf7-d8cb-4966-8e54-fa48bb0baf8b",{"id":1937,"createTime":28,"updateTime":28,"relativeEntities":1939,"slug":28,"properties":1940,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1943,"statistic":28},[],{"title":1941},{"EN":1942},"IBM India Research Lab, Block 1, Indian Institute of Technology, Hauz Khas, New Delhi, PIN 110016, India",[],{"orcid":1945,"title":1947,"openalex":1949},{"VOID":1946},"https:\u002F\u002Forcid.org\u002F0000-0003-4799-5693",{"EN":1948},"Himanshu Gupta",{"VOID":1950},"A5101643161",{"url":28,"publisher":1952,"properties":1990},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1953,"slug":872,"properties":1954,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":1959,"manageAffiliations":1964,"indexDatabases":1975,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":1955,"eissn":1956,"issn":1957,"title":1958},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[1960],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1961,"label":1962,"description":1963,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[1965,1970],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":1966,"slug":28,"properties":1967,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1969,"statistic":28},[],{"title":1968},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":1971,"slug":28,"properties":1972,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1974,"statistic":28},[],{"title":1973},{"EN":905},[],[1976,1983],{"id":909,"indexDatabase":1977,"url":915,"indexYears":916,"academicFieldIds":1982,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1978,"label":1979,"description":1980,"key":781,"publicationTags":1981,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":1984,"url":933,"indexYears":28,"academicFieldIds":1989,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":1985,"label":1986,"description":1987,"key":930,"publicationTags":1988,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":1991,"pages":1992,"volume":1994},{"VOID":1594},{"VOID":1993},"463-494",{"VOID":1995},"14",467,{"total":1996,"publishYear":1998,"statisticByYear":1999},2006,{"2012":51,"2013":128,"2014":134,"2015":150,"2016":150,"2017":278,"2018":152,"2019":139,"2020":137,"2021":147,"2022":139,"2023":122,"2024":135},"2006-12-01",[919,932],[2003,2006],{"id":28,"text":2004,"url":28,"identifiers":2005},"10.1109\u002F4235.996017",{"doi":2004},{"id":28,"text":2007,"url":28,"identifiers":2008},"10.1109\u002F4235.661550",{"doi":2007},{"id":2010,"createTime":2011,"updateTime":2011,"relativeEntities":2012,"slug":2013,"properties":2014,"entityType":959,"verifyStatus":26,"verifyTime":2011,"verifyNote":960,"languages":2027,"translateLanguages":28,"viewCount":32,"primaryUrl":2028,"fullTextUrl":28,"authors":2029,"publicationType":1003,"publisherRelationship":2068,"citationCount":212,"citationInfo":2113,"publishDate":2116,"publishYear":2114,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":2117,"openAccess":28,"references":2118,"isForceReanalyzing":1071},"dad972a8-8552-4bd5-bb88-bded275f6255","2024-11-26T10:48:56.399+00:00",[],"Empirical-Investigation-of-Multiparent-Recombination-Operators-in-Evolution-Strategies",{"openalex":2015,"mag":2017,"abstract":2019,"title":2021,"pm":2023,"doi":2025},{"VOID":2016},"W1980398615",{"VOID":2018},"1980398615",{"EN":2020},"\u003Cjats:p>An extension of evolution strategies to multiparent recombination involving a variable number ϱ of parents to create an offspring individual is proposed. The extension is experimentally evaluated on a test suite of functions differing in their modality and separability and the regular\u002Firregular arrangement of their local optima. Multiparent diagonal crossover and uniform scanning crossover and a multiparent version of intermediary recombination are considered in the experiments. The performance of the algorithm is observed to depend on the particular combination of recombination operator and objective function. In most of the cases a significant increase in performance is observed as the number of parents increases. However, there might also be no significant impact of recombination at all, and for one of the unimodal objective functions, the performance is observed to deteriorate over the course of evolution for certain choices of the recombination operator and the number of parents. Additional experiments with a skewed initialization of the population clarify that intermediary recombination does not cause a search bias toward the origin of the coordinate system in the case of domains of variables that are symmetric around zero.\u003C\u002Fjats:p>",{"EN":2022},"Empirical Investigation of Multiparent Recombination Operators in Evolution Strategies",{"VOID":2024},"10021763",{"VOID":2026},"10.1162\u002Fevco.1997.5.3.347",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F5\u002F3\u002F347-365\u002F798",[2030,2049],{"id":2031,"sortIndex":32,"researcher":28,"roles":2032,"affiliations":2033,"properties":2042,"displayName":2046,"givenName":28,"familyName":28},"10bb2076-5fc4-49ba-b63a-7cb3f0f50da7",[],[2034],{"id":2035,"sortIndex":32,"affiliation":2036,"properties":28},"19433ab9-068b-4ed9-803e-580b204006c9",{"id":2035,"createTime":28,"updateTime":28,"relativeEntities":2037,"slug":28,"properties":2038,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2041,"statistic":28},[],{"title":2039},{"EN":2040},"Department of Mathematics and Computer Science Leiden University Niels Bohrweg 1 NL-2333 CA, Leiden The Netherlands gusz@wi.leidenuniv.nl#TAB#",[],{"orcid":2043,"title":2045,"openalex":2047},{"VOID":2044},"https:\u002F\u002Forcid.org\u002F0000-0002-3106-4213",{"EN":2046},"A. E. Eiben",{"VOID":2048},"A5074492402",{"id":2050,"sortIndex":40,"researcher":28,"roles":2051,"affiliations":2052,"properties":2061,"displayName":2065,"givenName":28,"familyName":28},"4c66ef13-863a-4742-8fb4-473fc53f34bd",[],[2053],{"id":2054,"sortIndex":32,"affiliation":2055,"properties":28},"947e4afd-a6a3-47bf-a40a-735d5d486a26",{"id":2054,"createTime":28,"updateTime":28,"relativeEntities":2056,"slug":28,"properties":2057,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2060,"statistic":28},[],{"title":2058},{"EN":2059},"Informatik Centrum Dortmund Center for Applied Systems Analysis Joseph-von-Fraunhofer-Strasse 20 D-44227 Dortmund, Germany and Department of Mathematics and Computer Science Leiden University Niels Bohrweg 1 NL-2333 CA, Leiden The Netherlands",[],{"orcid":2062,"title":2064,"openalex":2066},{"VOID":2063},"https:\u002F\u002Forcid.org\u002F0000-0001-6768-1478",{"EN":2065},"Thomas Bäck",{"VOID":2067},"A5062646838",{"url":28,"publisher":2069,"properties":2107},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2070,"slug":872,"properties":2071,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2076,"manageAffiliations":2081,"indexDatabases":2092,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":2072,"eissn":2073,"issn":2074,"title":2075},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[2077],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":2078,"label":2079,"description":2080,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[2082,2087],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":2083,"slug":28,"properties":2084,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2086,"statistic":28},[],{"title":2085},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":2088,"slug":28,"properties":2089,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2091,"statistic":28},[],{"title":2090},{"EN":905},[],[2093,2100],{"id":909,"indexDatabase":2094,"url":915,"indexYears":916,"academicFieldIds":2099,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2095,"label":2096,"description":2097,"key":781,"publicationTags":2098,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":2101,"url":933,"indexYears":28,"academicFieldIds":2106,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":2102,"label":2103,"description":2104,"key":930,"publicationTags":2105,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":2108,"pages":2109,"volume":2111},{"VOID":1045},{"VOID":2110},"347-365",{"VOID":2112},"5",{"total":212,"publishYear":2114,"statisticByYear":2115},1997,{"2012":46,"2013":145,"2014":49,"2015":46,"2016":40,"2017":123,"2018":123,"2020":42,"2021":46,"2022":42},"1997-09-01",[919,932],[2119,2123,2127,2130,2133,2136,2139,2142,2145,2148,2151],{"id":28,"text":2120,"url":28,"identifiers":2121},"Back, T. (1996). Evolutionary algorithms in theory and practice. New York: Oxford University Press.",{"doi":2122},"10.1093\u002Foso\u002F9780195099713.001.0001",{"id":28,"text":2124,"url":28,"identifiers":2125},"Back, T., Fogel, D. & Michalewicz, Z. (Eds.) (1997). Handbook of evolutionary computation. New York: Oxford University Press.",{"doi":2126},"10.1887\u002F0750308958",{"id":28,"text":2128,"url":28,"identifiers":2129},"Back, T, & Michalewicz, 2. (1997). Test landscapes. In T. Back, D. Fogel, & Z. Michalewicz (Eds.), Handbook of evolutionary computation (pp. B2.7: 14-B2.7:20). New York: Oxford University Press.",{},{"id":28,"text":2131,"url":28,"identifiers":2132},"Back, T, & Schwefel, H.P. (1993). An overview ofevolutionary algorithms for parameter optimization. Evolutionary Computation, 1 (I), 1-2 3.",{"doi":1342},{"id":28,"text":2134,"url":28,"identifiers":2135},"Belew, K. & Booker, L. (Eds.) (1991). Proceedings of the Foziith Oiteirzntional Conference on Genetic :llgorithms. San Illateo, Ch: Morgan Kaufmann.",{},{"id":28,"text":2137,"url":28,"identifiers":2138},"Bersini, H. Dorigo, AI., Langerman, S., Seront, G. & Gambardella, L. (1996). Results of the First International Contest on Evolutionary Optimization. In Proceedings ofthe Third IEEE Conference o n Eyoliitioimiy Compritatioii (pp. 61 1-61 5 ) . Piscataway, NJ: IEEE Press.",{},{"id":28,"text":2140,"url":28,"identifiers":2141},"Toward LIP, Compiitntron, 3, 1",{},{"id":28,"text":2143,"url":28,"identifiers":2144},"Bremermann, H., Kogson, hl. & Salaff, S. (1966). Global properties of evolution processes. In H. Pattee, E. Edlsack, L. Fein, & A. Callahan, (Eds.),\\ktwnlnzrtomtita nizd use~dsimdations (pp. 3-41). Washington, DC: Spartan Rooks.",{},{"id":28,"text":2146,"url":28,"identifiers":2147},"Eihen, A. (1997). Multi-parent recornbination. In T. Back, D. Fogel, & Z. Michalewicz (Eds.), Haiidbook of FL'OhtiOliN1? ro7npiitntion (pp. C3.3.7: 1-C3.3.7:9). New York: Oxford University Press.",{},{"id":28,"text":2149,"url":28,"identifiers":2150},"E:iben, A, Kaue, P.E., 8i Kuttkay, Z. (1 994). Genetic algorithms with multi-parent recombination. In Y. Davidor, R-P. Schwefel, & R. Manner, (Eds.), Proceedingsofibe Third Conjii-ence on PnrallelProblem S0Li.i~.g-fi07\u002F1.littnre [Lecture Notes in Computer Science 8661 (pp. 78-87). Berlin: Springer-Verlag.",{},{"id":28,"text":2152,"url":28,"identifiers":2153},"Eiben, A, R Schippers, C. (1996). Multi-parent's niche: n-an; crossovers on NK-landscapes. In I I.LI. \\'oipt, 1%'. Eheling, I. Kechenberg, & H.P. Schwefel (Eds.), Piaceeding.softhe Feud Conference 011 f'nt-~lkel h n b h i i Sohiizgfifi.otn %twr [Lecture Notes in Computer Science 1 1411 (pp. 3 19-328). 13erlin: Springer-Verlag.",{},{"id":2155,"createTime":2156,"updateTime":2156,"relativeEntities":2157,"slug":2158,"properties":2159,"entityType":959,"verifyStatus":26,"verifyTime":2156,"verifyNote":960,"languages":2172,"translateLanguages":28,"viewCount":32,"primaryUrl":2173,"fullTextUrl":28,"authors":2174,"publicationType":1003,"publisherRelationship":2213,"citationCount":139,"citationInfo":2258,"publishDate":2261,"publishYear":2259,"citationAnalyzeStatus":884,"lastCitationAnalyze":28,"indexDatabases":2262,"openAccess":28,"references":2263,"isForceReanalyzing":1071},"5809cd64-d593-43f2-9085-619db81989ed","2024-10-02T14:28:30.815+00:00",[],"A-Hidden-Markov-Model-Approach-to-the-Problem-of-Heuristic-Selection-in-Hyper-Heuristics-with-a-Case-Study-in-High-School-Timetabling-Problems",{"openalex":2160,"mag":2162,"abstract":2164,"title":2166,"pm":2168,"doi":2170},{"VOID":2161},"W2462755584",{"VOID":2163},"2462755584",{"EN":2165},"\u003Cjats:title>Abstract\u003C\u002Fjats:title>\n               \u003Cjats:p>Operations research is a well-established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an operations research problem and is a challenging task which requires assigning events and resources to time slots subject to a set of constraints. In this article, a new sequence-based selection hyper-heuristic is presented that produces excellent results on a suite of high school timetabling problems. In this study, we present an easy-to-implement, easy-to-maintain, and effective sequence-based selection hyper-heuristic to solve high school timetabling problems using a benchmark of unified real-world instances collected from different countries. We show that with sequence-based methods, it is possible to discover new best known solutions for a number of the problems in the timetabling domain. Through this investigation, the usefulness of sequence-based selection hyper-heuristics has been demonstrated and the capability of these methods has been shown to exceed the state of the art.\u003C\u002Fjats:p>",{"EN":2167},"A Hidden Markov Model Approach to the Problem of Heuristic Selection in\n          Hyper-Heuristics with a Case Study in High School Timetabling Problems",{"VOID":2169},"27258841",{"VOID":2171},"10.1162\u002Fevco_a_00186",[31],"https:\u002F\u002Fdirect.mit.edu\u002Fevco\u002Farticle\u002F25\u002F3\u002F473\u002F1044\u002FA-Hidden-Markov-Model-Approach-to-the-Problem-of",[2175,2194],{"id":2176,"sortIndex":32,"researcher":28,"roles":2177,"affiliations":2178,"properties":2187,"displayName":2191,"givenName":28,"familyName":28},"e770c6cc-309e-42e8-a2d3-bcdf2ad04f54",[],[2179],{"id":2180,"sortIndex":32,"affiliation":2181,"properties":28},"22d75cf2-fee4-4252-89ca-8bbcd78b9a91",{"id":2180,"createTime":28,"updateTime":28,"relativeEntities":2182,"slug":28,"properties":2183,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2186,"statistic":28},[],{"title":2184},{"EN":2185},"University of Exeter, College of Engineering, Mathematics and Physical Sciences, Streatham Campus, Harrison Building, Exeter EX4 4QF, United Kingdom a.kheiri@exeter.ac.uk",[],{"orcid":2188,"title":2190,"openalex":2192},{"VOID":2189},"https:\u002F\u002Forcid.org\u002F0000-0002-6716-2130",{"EN":2191},"Ahmed Kheiri",{"VOID":2193},"A5017573824",{"id":2195,"sortIndex":40,"researcher":28,"roles":2196,"affiliations":2197,"properties":2206,"displayName":2210,"givenName":28,"familyName":28},"7a9cdfa5-101d-411f-910e-799ba21b3144",[],[2198],{"id":2199,"sortIndex":32,"affiliation":2200,"properties":28},"f2c82fae-d70d-4294-8335-7f5a5cc6bb66",{"id":2199,"createTime":28,"updateTime":28,"relativeEntities":2201,"slug":28,"properties":2202,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2205,"statistic":28},[],{"title":2203},{"EN":2204},"University of Exeter, College of Engineering, Mathematics and Physical Sciences, Streatham Campus, Harrison Building, Exeter EX4 4QF, United Kingdom e.c.keedwell@exeter.ac.uk",[],{"orcid":2207,"title":2209,"openalex":2211},{"VOID":2208},"https:\u002F\u002Forcid.org\u002F0000-0003-3650-6487",{"EN":2210},"Edward Keedwell",{"VOID":2212},"A5058871746",{"url":28,"publisher":2214,"properties":2252},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2215,"slug":872,"properties":2216,"entityType":25,"verifyStatus":884,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":32,"subjectFields":2221,"manageAffiliations":2226,"indexDatabases":2237,"url":936,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"country":2217,"eissn":2218,"issn":2219,"title":2220},{"VOID":875},{"VOID":877},{"VOID":879},{"EN":881},[2222],{"id":887,"createTime":28,"updateTime":28,"relativeEntities":2223,"label":2224,"description":2225,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},[2227,2232],{"id":894,"createTime":28,"updateTime":28,"relativeEntities":2228,"slug":28,"properties":2229,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2231,"statistic":28},[],{"title":2230},{"EN":898},[],{"id":901,"createTime":28,"updateTime":28,"relativeEntities":2233,"slug":28,"properties":2234,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2236,"statistic":28},[],{"title":2235},{"EN":905},[],[2238,2245],{"id":909,"indexDatabase":2239,"url":915,"indexYears":916,"academicFieldIds":2244,"indexDatabaseRanking":919},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2240,"label":2241,"description":2242,"key":781,"publicationTags":2243,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[918],{"id":921,"indexDatabase":2246,"url":933,"indexYears":28,"academicFieldIds":2251,"indexDatabaseRanking":28},{"id":923,"createTime":28,"updateTime":28,"relativeEntities":2247,"label":2248,"description":2249,"key":930,"publicationTags":2250,"standard":28},[],{"EN":926,"VI":926},{"EN":928,"VI":929},[932,813],[935],{"issue":2253,"pages":2254,"volume":2256},{"VOID":1045},{"VOID":2255},"473-501",{"VOID":2257},"25",{"total":139,"publishYear":2259,"statisticByYear":2260},2017,{"2018":46,"2019":48,"2020":145,"2021":48,"2022":49,"2023":123,"2024":123},"2017-09-01",[919,932],[2264,2268,2271,2275,2279,2283,2287,2290,2294,2298,2302,2306,2309,2313,2317,2320,2324,2328,2332,2336,2339,2342,2346,2350,2353,2356,2360,2364,2367,2370,2374,2378,2382,2386,2389,2393,2397,2401,2404,2408,2412,2416,2420,2424,2428,2432,2436,2440,2443,2447,2451,2455,2458,2461,2465],{"id":28,"text":2265,"url":28,"identifiers":2266},"Abramson, D.\n           (1991). Constructing school timetables using\n            simulated annealing: Sequential and parallel algorithms.\n            Management Science,\n            37(1):98–113.",{"doi":2267},"10.1287\u002Fmnsc.37.1.98",{"id":28,"text":2269,"url":28,"identifiers":2270},"Abramson, D. A.,\n                Dang, H.,\n            and Krisnamoorthy,\n              M. (1999).\n            Simulated annealing cooling schedules for the school timetabling\n            problem. Asia-Pacific Journal of Operational Research,\n            16(1):1–22.",{},{"id":28,"text":2272,"url":28,"identifiers":2273},"Ahmed, L. N.,\n                Özcan, E.,\n            and Kheiri,\n            A. (2015).\n            Solving high school timetabling problems worldwide using selection\n            hyper-heuristics. Expert Systems with Applications,\n            42(13):5463–5471.",{"doi":2274},"10.1016\u002Fj.eswa.2015.02.059",{"id":28,"text":2276,"url":28,"identifiers":2277},"Alvarez-Valdés, R.,\n                Parreño,\n            F., and\n              Tamarit, J.\n              M. (2002). A\n            tabu search algorithm for assigning teachers to courses.\n            TOP,\n            10(2):239–259.",{"doi":2278},"10.1007\u002FBF02579018",{"id":28,"text":2280,"url":28,"identifiers":2281},"Baum, L. E., and\n                Petrie,\n            T. (1966).\n            Statistical inference for probabilistic functions of finite state Markov\n            chains. The Annals of Mathematical Statistics,\n            37(6):1554–1563.",{"doi":2282},"10.1214\u002Faoms\u002F1177699147",{"id":28,"text":2284,"url":28,"identifiers":2285},"Beligiannis, G. N.,\n                Moschopoulos, C.\n              N., Kaperonis,\n                G. P., and\n                Likothanassis, S.\n              D. (2008).\n            Applying evolutionary computation to the school timetabling problem: The\n            Greek case. Computers and Operations Research,\n            35(4):1265–1280.",{"doi":2286},"10.1016\u002Fj.cor.2006.08.010",{"id":28,"text":2288,"url":28,"identifiers":2289},"Bello, G. S.,\n                Rangel, M.\n              C., and Boeres,\n                M. C. S.\n          (2008). An approach for the class\u002Fteacher timetabling\n            problem. In Proceedings of the 7th International Conference on\n            the Practice and Theory of Automated Timetabling, pp.\n            1–6.",{},{"id":28,"text":2291,"url":28,"identifiers":2292},"Bilgin, B.,\n                Özcan, E.,\n            and Korkmaz, E.\n              E. (2007). An\n            experimental study on hyper-heuristics and exam scheduling. In\n            E.\n                K.Burke and\n                H.Rudová\n          (Eds.), Practice and Theory of Automated Timetabling VI, volume\n            3867 of Lecture Notes in Computer Science, pp.\n            394–412.",{"doi":2293},"10.1007\u002F978-3-540-77345-0_25",{"id":28,"text":2295,"url":28,"identifiers":2296},"Birbas, T.,\n                Daskalaki,\n              S., and\n                Housos,\n            E. (2009).\n            School timetabling for quality student and teacher\n            schedules. Journal of Scheduling,\n            12(2):177–197.",{"doi":2297},"10.1007\u002Fs10951-008-0088-2",{"id":28,"text":2299,"url":28,"identifiers":2300},"Bufé, M.,\n                Fischer,\n            T., Gubbels,\n                H., Häcker,\n                C.,\n                Hasprich,\n              O., Scheibel,\n                C.,\n              Weicker, K.,\n                Weicker,\n            N., Wenig,\n                M., and\n                Wolfangel,\n              C. (2001).\n            Automated solution of a highly constrained school timetabling\n            problem—Preliminary results. In E. J.\n              W.Boers (Ed.),\n            Applications of Evolutionary Computing, volume 2037 of\n            Lecture Notes in Computer Science, pp.\n            431–440.",{"doi":2301},"10.1007\u002F3-540-45365-2_45",{"id":28,"text":2303,"url":28,"identifiers":2304},"Burke, E. K.,\n                Gendreau,\n              M., Hyde,\n                M.,\n              Kendall, G.,\n                Ochoa, G.,\n                Özcan, E.,\n            and Qu,\n            R. (2013).\n            Hyper-heuristics: A survey of the state of the art.\n            Journal of the Operational Research Society,\n            64(12):1695–1724.",{"doi":2305},"10.1057\u002Fjors.2013.71",{"id":28,"text":2307,"url":28,"identifiers":2308},"Calderia, J. P., and\n                Ross, A.\n            C. (1997). School\n            timetabling using genetic search. In Proceedings of the\n            International Conference on the Practice and Theory of Automated Timetabling,\n          pp. 115–122.",{},{"id":28,"text":2310,"url":28,"identifiers":2311},"Colorni, A.,\n                Dorigo, M.,\n            and Maniezzo,\n              V. (1992).\n            A genetic algorithm to solve the timetable problem.\n            Technical Report Technical Report No. 90-060, Politecnico di Milano,\n            Italy.",{"doi":2312},"10.1007\u002F978-3-642-77489-8_14",{"id":28,"text":2314,"url":28,"identifiers":2315},"Cowling, P.,\n                Kendall,\n            G., and\n                Soubeiga,\n              E. (2001).\n            A hyperheuristic approach to scheduling a sales summit.\n          In E.Burke\n            and\n            W.Erben\n          (Eds.), Practice and Theory of Automated Timetabling III, volume\n            2079 of Lecture Notes in Computer Science, pp.\n            176–190.",{"doi":2316},"10.1007\u002F3-540-44629-X_11",{"id":28,"text":2318,"url":28,"identifiers":2319},"Domrös, J., and\n                Homberger,\n              J. (2012).\n            An evolutionary algorithm for high school timetabling. In\n            Proceedings of the 9th International Conference on the Practice and Theory of\n            Automated Timetabling, pp.\n          485–488.",{},{"id":28,"text":2321,"url":28,"identifiers":2322},"Dueck, G.\n           (1993). New optimization heuristics: The great\n            deluge algorithm and the record-to-record travel. Journal of\n            Computational Physics,\n            104(1):86–92.",{"doi":2323},"10.1006\u002Fjcph.1993.1010",{"id":28,"text":2325,"url":28,"identifiers":2326},"Even, S.,\n                Itai, A.,\n            and Shamir,\n            A. (1976).\n            On the complexity of timetable and multicommodity flow\n            problems. SIAM Journal on Computing,\n            5(4):691–703.",{"doi":2327},"10.1137\u002F0205048",{"id":28,"text":2329,"url":28,"identifiers":2330},"Fagerland, M. W., and\n                Sandvik,\n            L. (2009).\n            The Wilcoxon–Mann–Whitney test under scrutiny.\n            Statistics in Medicine,\n            28(10):1487–1497.",{"doi":2331},"10.1002\u002Fsim.3561",{"id":28,"text":2333,"url":28,"identifiers":2334},"Filho, G. R.,\n                Antonio,\n            L., and Lorena,\n                L. A. N.\n          (2001). A constructive evolutionary approach to school\n            timetabling. In E. J.\n              W.Boers (Ed.),\n            Applications of Evolutionary Computing, volume 2037 of\n            Lecture Notes in Computer Science, pp.\n            130–139.",{"doi":2335},"10.1007\u002F3-540-45365-2_14",{"id":28,"text":2337,"url":28,"identifiers":2338},"Fonseca, G. H. G.,\n                Santos, H.\n              G., and Carrano,\n                E. G. (2015).\n            Late acceptance hill-climbing for high school\n          timetabling. Journal of Scheduling, pp.\n            1–13.",{},{"id":28,"text":2340,"url":28,"identifiers":2341},"Fonseca, G. H. G.,\n                Santos, H.\n              G., Toffolo,\n                T. Â. M.,\n                Brito, S.\n              S., and Souza,\n                M. J. F.\n          (2014). GOAL solver: A hybrid local search based solver for\n            high school timetabling. Annals of Operations Research,\n          pp. 1–21.",{},{"id":28,"text":2343,"url":28,"identifiers":2344},"Glover, F.\n           (1986). Future paths for integer programming\n            and links to artificial intelligence. Computers and Operations\n            Research,\n            13(5):533–549.",{"doi":2345},"10.1016\u002F0305-0548(86)90048-1",{"id":28,"text":2347,"url":28,"identifiers":2348},"Hajek, B.\n           (1988). Cooling schedules for optimal\n            annealing. Mathematics of Operations Research,\n            13(2):311–329.",{"doi":2349},"10.1287\u002Fmoor.13.2.311",{"id":28,"text":2351,"url":28,"identifiers":2352},"Holland, J.\n           (1975). Adaptation in natural and artificial\n            systems. Ann Arbor, MI:\n            University of Michigan Press.",{},{"id":28,"text":2354,"url":28,"identifiers":2355},"Jacobsen, F.,\n                Bortfeldt,\n              A., and\n                Gehring,\n            H. (2006).\n            Timetabling at German secondary schools: Tabu search versus constraint\n            programming. In Proceedings of the 6th International Conference\n            on the Practice and Theory of Automated Timetabling, pp.\n            439–442.",{},{"id":28,"text":2357,"url":28,"identifiers":2358},"Kalender, M.,\n                Kheiri, A.,\n                Özcan, E.,\n            and Burke, E.\n              K. (2013). A\n            greedy gradient-simulated annealing selection hyper-heuristic.\n            Soft Computing,\n            17(12):2279–2292.",{"doi":2359},"10.1007\u002Fs00500-013-1096-5",{"id":28,"text":2361,"url":28,"identifiers":2362},"Kendall, G., and\n                Mohamad,\n            M. (2004).\n            Channel assignment optimisation using a hyper-heuristic.\n          In Proceedings of the 2004 IEEE Conference on Cybernetic and Intelligent\n            Systems, pp. 790–795.",{"doi":2363},"10.1109\u002FICCIS.2004.1460689",{"id":28,"text":2365,"url":28,"identifiers":2366},"Kheiri, A.\n           (2014). Multi-stage hyper-heuristics for optimisation\n            problems. PhD thesis, University of Nottingham, School of Computer\n            Science.",{},{"id":28,"text":2368,"url":28,"identifiers":2369},"Kheiri, A., and\n                Keedwell,\n              E. (2015a).\n            Markov chain selection hyper-heuristic for the optimisation of\n            constrained magic squares. 15th UK Workshop on Computational\n            Intelligence.",{},{"id":28,"text":2371,"url":28,"identifiers":2372},"Kheiri, A., and\n                Keedwell,\n              E. (2015b).\n            A sequence-based selection hyper-heuristic utilising a hidden Markov\n            model. In Proceedings of the 2015 on Genetic and Evolutionary\n            Computation Conference, GECCO’15, pp.\n          417–424.",{"doi":2373},"10.1145\u002F2739480.2754766",{"id":28,"text":2375,"url":28,"identifiers":2376},"Kheiri, A.,\n                Keedwell,\n              E., Gibson,\n                M. J., and\n                Savic,\n            D. (2015).\n            Sequence analysis-based hyper-heuristics for water distribution network\n            optimisation. Procedia Engineering,\n            119:1269–1277.",{"doi":2377},"10.1016\u002Fj.proeng.2015.08.993",{"id":28,"text":2379,"url":28,"identifiers":2380},"Kheiri, A.,\n                Özcan, E.,\n            and Parkes, A.\n              J. (2016). A\n            stochastic local search algorithm with adaptive acceptance for high-school\n            timetabling. Annals of Operations Research,\n            239(1):135–151.",{"doi":2381},"10.1007\u002Fs10479-014-1660-0",{"id":28,"text":2383,"url":28,"identifiers":2384},"Kingston, J. H.\n           (2005). A tiling algorithm for high school\n            timetabling. In E.Burke\n            and\n            M.Trick\n          (Eds.), Practice and Theory of Automated Timetabling V, volume\n            3616 of Lecture Notes in Computer Science, pp.\n            208–225.",{"doi":2385},"10.1007\u002F11593577_13",{"id":28,"text":2387,"url":28,"identifiers":2388},"Kingston, J. H.\n           (2014). KHE14: An algorithm for high school\n            timetabling. In Proceedings of the 10th International Conference\n            on the Practice and Theory of Automated Timetabling, pp.\n            269–291.",{},{"id":28,"text":2390,"url":28,"identifiers":2391},"Kirkpatrick, S.,\n                Gelatt, C.\n              D., and Vecchi,\n                M. P. (1983).\n            Optimization by simulated annealing.\n            Science,\n            220(4598):671–680.",{"doi":2392},"10.1126\u002Fscience.220.4598.671",{"id":28,"text":2394,"url":28,"identifiers":2395},"Kruskal, W. H.\n           (1957). Historical notes on the Wilcoxon\n            unpaired two-sample test. Journal of the American Statistical\n            Association,\n            52(279):356–360.",{"doi":2396},"10.1080\u002F01621459.1957.10501395",{"id":28,"text":2398,"url":28,"identifiers":2399},"Lara, C.,\n                Flores, J.\n              J., and Calderon,\n                F. (2008).\n            Solving a school timetabling problem using a bee\n            algorithm. In A.Gelbukh\n            and E.\n              F.Morales (Eds.),\n            MICAI 2008: Advances in Artificial Intelligence, volume\n            5317 of Lecture Notes in Computer Science, pp.\n            664–674.",{"doi":2400},"10.1007\u002F978-3-540-88636-5_63",{"id":28,"text":2402,"url":28,"identifiers":2403},"Melício, F.,\n                Calderia, J.\n              P., and Rosa,\n                A. (2006).\n            THOR: A tool for school timetabling. In\n            Proceedings of the 6th International Conference on the Practice and Theory of\n            Automated Timetabling, pp.\n          532–535.",{},{"id":28,"text":2405,"url":28,"identifiers":2406},"Moura, A. V., and\n                Scaraficci, R.\n              A. (2010). A\n            GRASP strategy for a more constrained school timetabling problem.\n            International Journal of Operational Research,\n            7(2):152–170.",{"doi":2407},"10.1504\u002FIJOR.2010.030801",{"id":28,"text":2409,"url":28,"identifiers":2410},"Özcan, E.,\n                Bilgin, B.,\n            and Korkmaz, E.\n              E. (2008). A\n            comprehensive analysis of hyper-heuristics. Intelligent Data\n            Analysis,\n            12(1):3–23.",{"doi":2411},"10.3233\u002FIDA-2008-12102",{"id":28,"text":2413,"url":28,"identifiers":2414},"Özcan, E.,\n                Bykov, Y.,\n                Birben, M.,\n            and Burke, E.\n              K. (2009).\n            Examination timetabling using late acceptance\n            hyper-heuristics. In IEEE Congress on Evolutionary\n            Computation, pp. 997–1004.",{"doi":2415},"10.1109\u002FCEC.2009.4983054",{"id":28,"text":2417,"url":28,"identifiers":2418},"Pillay, N.\n           (2013). A survey of school timetabling\n            research. Annals of Operations Research, pp.\n            1–33.",{"doi":2419},"10.1007\u002Fs10479-013-1321-8",{"id":28,"text":2421,"url":28,"identifiers":2422},"Post, G.,\n                Ahmadi, S.,\n                Daskalaki,\n              S., Kingston,\n                J. H.,\n                Kyngas, J.,\n                Nurmi, C.,\n            and Ranson,\n            D. (2012).\n            An XML format for benchmarks in high school timetabling.\n            Annals of Operations Research,\n            194(1):385–397.",{"doi":2423},"10.1007\u002Fs10479-010-0699-9",{"id":28,"text":2425,"url":28,"identifiers":2426},"Post, G.,\n                Di Gaspero,\n              L., Kingston,\n                J. H.,\n                McCollum,\n              B., and\n                Schaerf,\n            A. (2013).\n            The third international timetabling competition.\n            Annals of Operations Research, pp.\n          1–7.",{"doi":2427},"10.1007\u002Fs10479-013-1340-5",{"id":28,"text":2429,"url":28,"identifiers":2430},"Raghavjee, R., and\n                Pillay,\n            N. (2008).\n            An application of genetic algorithms to the school timetabling\n            problem. In Proceedings of the 2008 Annual Research Conference\n            of the South African Institute of Computer Scientists and Information Technologists on\n            IT Research in Developing Countries: Riding the Wave of Technology, pp.\n            193–199.",{"doi":2431},"10.1145\u002F1456659.1456682",{"id":28,"text":2433,"url":28,"identifiers":2434},"Raghavjee, R., and\n                Pillay,\n            N. (2012).\n            A comparison of genetic algorithms and genetic programming in solving the\n            school timetabling problem. In Fourth World Congress on Nature\n            and Biologically Inspired Computing, pp.\n          98–103.",{"doi":2435},"10.1109\u002FNaBIC.2012.6402246",{"id":28,"text":2437,"url":28,"identifiers":2438},"Smith, K. A.,\n                Abramson,\n              D., and Duke,\n                D. (2003).\n            Hopfield neural networks for timetabling: Formulations, methods, and\n            comparative results. Computers and Industrial\n            Engineering,\n            44(2):283–305.",{"doi":2439},"10.1016\u002FS0360-8352(02)00180-8",{"id":28,"text":2441,"url":28,"identifiers":2442},"Sørensen, M.,\n                Kristiansen,\n              S., and\n                Stidsen, T.\n              R. (2012).\n            International timetabling competition 2011: An adaptive large\n            neighborhood search algorithm. In Proceedings of the 9th\n            International Conference on the Practice and Theory of Automated Timetabling,\n          pp. 489–492.",{},{"id":28,"text":2444,"url":28,"identifiers":2445},"Tassopoulos, I. X., and\n                Beligiannis, G.\n              N. (2012). A\n            hybrid particle swarm optimization based algorithm for high school timetabling\n            problems. Applied Soft Computing,\n            12(11):3472–3489.",{"doi":2446},"10.1016\u002Fj.asoc.2012.05.029",{"id":28,"text":2448,"url":28,"identifiers":2449},"Valouxis, C., and\n                Housos,\n            E. (2003).\n            Constraint programming approach for school timetabling.\n            Computers and Operations Research,\n            30(10):1555–1572.",{"doi":2450},"10.1016\u002FS0305-0548(02)00083-7",{"id":28,"text":2452,"url":28,"identifiers":2453},"Wilke, P.,\n                Gröbner,\n            M., and Oster,\n                N. (2002).\n            A hybrid genetic algorithm for school timetabling. In\n            B.McKay\n            and\n            J.Slaney\n          (Eds.), AI 2002: Advances in Artificial Intelligence, volume\n            2557 of Lecture Notes in Computer Science, pp.\n            455–464.",{"doi":2454},"10.1007\u002F3-540-36187-1_40",{"id":28,"text":2456,"url":28,"identifiers":2457},"Wilke, P., and\n                Killer,\n            H. (2010).\n            Walk down jump up algorithm: A new hybrid algorithm for timetabling\n            problems. In Proceedings of the 8th International Conference on\n            the Practice and Theory of Automated Timetabling, pp.\n            440–446.",{},{"id":28,"text":2459,"url":28,"identifiers":2460},"Wolpert, D. H., and\n                Macready, W.\n              G. (1997). No\n            free lunch theorems for optimization. IEEE Transactions on\n            Evolutionary Computation,\n          1:67–82.",{"doi":1802},{"id":28,"text":2462,"url":28,"identifiers":2463},"Wright, M. B.\n           (1996). School timetabling using heuristic\n            search. Journal of the Operational Research Society,\n            47(3):347–357.",{"doi":2464},"10.1057\u002Fjors.1996.34",{"id":28,"text":2466,"url":28,"identifiers":2467},"Zhang, D.,\n                Liu, Y.,\n                M’Hallah,\n              R., and\n              Leung, S. C.\n              H. (2010). A\n            simulated annealing with a new neighborhood structure based algorithm for high school\n            timetabling problems. European Journal of Operational\n            Research,\n            203(3):550–558.",{"doi":2468},"10.1016\u002Fj.ejor.2009.09.014"]