{"id":"https://openalex.org/W1989030152","doi":"https://doi.org/10.1145/1389095.1389214","title":"A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems","display_name":"A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems","publication_year":2008,"publication_date":"2008-07-12","ids":{"openalex":"https://openalex.org/W1989030152","doi":"https://doi.org/10.1145/1389095.1389214","mag":"1989030152"},"language":"en","primary_location":{"id":"doi:10.1145/1389095.1389214","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389214","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","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/A5077226101","display_name":"Markus Borschbach","orcid":null},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M. Borschbach","raw_affiliation_strings":["University of M\u00fcnster, Germany"],"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004579529","display_name":"Andre Exeler","orcid":null},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"A. Exeler","raw_affiliation_strings":["University of M\u00fcnster, Germany"],"affiliations":[{"raw_affiliation_string":"University of M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077226101"],"corresponding_institution_ids":["https://openalex.org/I22465464"],"apc_list":null,"apc_paid":null,"fwci":0.6360283,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7480771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"605","last_page":"606"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.9221259355545044},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8878127932548523},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.8859672546386719},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.650285542011261},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5820772051811218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5663230419158936},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5595039129257202},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4843229353427887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4558582901954651},{"id":"https://openalex.org/keywords/memetics","display_name":"Memetics","score":0.4470755159854889},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.43063318729400635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31824201345443726},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23581379652023315}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.9221259355545044},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8878127932548523},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8859672546386719},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.650285542011261},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5820772051811218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5663230419158936},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5595039129257202},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4843229353427887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4558582901954651},{"id":"https://openalex.org/C51620047","wikidata":"https://www.wikidata.org/wiki/Q23399","display_name":"Memetics","level":2,"score":0.4470755159854889},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.43063318729400635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31824201345443726},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23581379652023315},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1389095.1389214","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389214","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W18318535","https://openalex.org/W76341307","https://openalex.org/W103186331","https://openalex.org/W139325465","https://openalex.org/W180299957","https://openalex.org/W1554262786","https://openalex.org/W1667395620","https://openalex.org/W1787074469","https://openalex.org/W2011039300","https://openalex.org/W2031823362","https://openalex.org/W2036265926","https://openalex.org/W2060265333","https://openalex.org/W2329627532","https://openalex.org/W2406315113","https://openalex.org/W6603088002","https://openalex.org/W6633331062"],"related_works":["https://openalex.org/W2318617794","https://openalex.org/W2162921349","https://openalex.org/W2388961298","https://openalex.org/W2123894366","https://openalex.org/W2122102648","https://openalex.org/W2020131881","https://openalex.org/W1990478250","https://openalex.org/W3034910425","https://openalex.org/W2152512538","https://openalex.org/W2936675634"],"abstract_inverted_index":{"The":[0],"solution":[1],"for":[2,9,23],"the":[3,6,53,67],"Max-2SAT":[4,24,46],"is":[5,38],"starting":[7],"point":[8],"a":[10,16,20,28],"selection":[11],"of":[12,45,70],"these":[13],"strategies":[14,57],"by":[15],"brief":[17],"review.":[18],"Moreover,":[19],"memetic":[21,55],"algorithm":[22,56],"problems":[25,48],"based":[26],"on":[27,42],"specific":[29],"crossover":[30],"operator":[31],"and":[32,62],"an":[33],"improved":[34],"tabu":[35],"search":[36,73],"stage":[37],"presented.":[39],"Simulation":[40],"performed":[41],"several":[43],"instances":[44],"reference":[47],"are":[49],"used":[50],"to":[51,63,66],"evaluate":[52],"different":[54],"applied":[58],"in":[59],"our":[60],"approach":[61],"compare":[64],"it":[65],"computational":[68],"complexity":[69],"existing":[71],"local":[72],"solutions.":[74]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}