{"id":"https://openalex.org/W2148458253","doi":"https://doi.org/10.1109/cec.1999.785502","title":"Memory enhanced evolutionary algorithms for changing optimization problems","display_name":"Memory enhanced evolutionary algorithms for changing optimization problems","publication_year":2003,"publication_date":"2003-01-20","ids":{"openalex":"https://openalex.org/W2148458253","doi":"https://doi.org/10.1109/cec.1999.785502","mag":"2148458253"},"language":"en","primary_location":{"id":"doi:10.1109/cec.1999.785502","doi":"https://doi.org/10.1109/cec.1999.785502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.1999.785502","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036018560","display_name":"Juergen Branke","orcid":"https://orcid.org/0000-0002-4343-5878","observed_orcids":["https://orcid.org/0000-0002-4343-5878"]},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J. Branke","raw_affiliation_strings":["Institute AIFB, University of Karlsruhe, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute AIFB, University of Karlsruhe, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036018560"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":17.2883,"has_fulltext":false,"cited_by_count":755,"citation_normalized_percentile":{"value":0.99579832,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1875","last_page":"1882"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9824000000953674,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.014600000344216824,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-optimization","display_name":"dynamic optimization","score":0.7689999938011169},{"id":"https://openalex.org/keywords/declarative-memory","display_name":"declarative memory","score":0.8460000157356262},{"id":"https://openalex.org/keywords/implicit-memory","display_name":"implicit memory","score":0.9959999918937683},{"id":"https://openalex.org/keywords/benchmark-problems","display_name":"benchmark problems","score":0.7409999966621399},{"id":"https://openalex.org/keywords/memory-trade-off","display_name":"memory trade-off","score":0.4180000126361847}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7362078428268433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.704623818397522},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.6561923623085022},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6256389617919922},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4720371961593628},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4335668683052063},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4241611063480377},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38473427295684814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3327513337135315},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3009026348590851},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20043569803237915},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cec.1999.785502","doi":"https://doi.org/10.1109/cec.1999.785502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.1999.785502","pdf_url":null,"source":{"id":"https://openalex.org/S4363605353","display_name":"IEEE Congress on Evolutionary Computation (CEC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.8897","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.8897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aifb.uni-karlsruhe.de/~jbr/././Papers/memory_final2.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.507.9390","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.507.9390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.macs.hw.ac.uk/~dwcorne/RSR/memory.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W58057073","https://openalex.org/W121727447","https://openalex.org/W156653239","https://openalex.org/W326774659","https://openalex.org/W1492417045","https://openalex.org/W1504769152","https://openalex.org/W1509222874","https://openalex.org/W1553457851","https://openalex.org/W1555154718","https://openalex.org/W1570270745","https://openalex.org/W1585458135","https://openalex.org/W1598065796","https://openalex.org/W1766318984","https://openalex.org/W1901504711","https://openalex.org/W2096590200","https://openalex.org/W2154716183","https://openalex.org/W4239017350","https://openalex.org/W6604961117"],"related_works":["https://openalex.org/W7095253266","https://openalex.org/W2082205880","https://openalex.org/W7099625510","https://openalex.org/W2052164702","https://openalex.org/W2131832383","https://openalex.org/W1548221569","https://openalex.org/W2133217149","https://openalex.org/W1595831395","https://openalex.org/W6983786338","https://openalex.org/W2592099176"],"abstract_inverted_index":{"Recently,":[0],"there":[1],"has":[2],"been":[3],"increased":[4],"interest":[5],"in":[6],"evolutionary":[7,24],"computation":[8],"applied":[9],"to":[10,54],"changing":[11],"optimization":[12],"problems.":[13],"The":[14],"paper":[15],"surveys":[16],"a":[17,32,41,51,59],"number":[18],"of":[19,58],"approaches":[20],"that":[21],"extend":[22],"the":[23,56],"algorithm":[25],"with":[26],"implicit":[27],"or":[28],"explicit":[29],"memory,":[30],"suggests":[31],"new":[33,52],"benchmark":[34],"problem":[35],"and":[36],"examines":[37],"under":[38],"which":[39],"circumstances":[40],"memory":[42,60],"may":[43],"be":[44],"helpful.":[45],"From":[46],"these":[47],"observations,":[48],"we":[49],"derive":[50],"way":[53],"explore":[55],"benefits":[57],"while":[61],"minimizing":[62],"its":[63],"negative":[64],"side":[65],"effects.":[66]},"counts_by_year":[{"year":2026,"cited_by_count":17},{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":39},{"year":2020,"cited_by_count":29},{"year":2019,"cited_by_count":27},{"year":2018,"cited_by_count":34},{"year":2017,"cited_by_count":28},{"year":2016,"cited_by_count":35},{"year":2015,"cited_by_count":39},{"year":2014,"cited_by_count":43},{"year":2013,"cited_by_count":52},{"year":2012,"cited_by_count":44}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}
