{"id":"https://openalex.org/W2204178636","doi":null,"title":"Genetic Algorithm and Variable neighbourhood search for BDD Variable Ordering Problem","display_name":"Genetic Algorithm and Variable neighbourhood search for BDD Variable Ordering Problem","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2204178636","mag":"2204178636"},"language":"en","primary_location":{"id":"pmh:oai:americanae.aecid.es:2730334","doi":null,"is_oa":false,"landing_page_url":"https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/324","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOCOMP Journal of Computer Science; Vol. 10 No. 1 (2011): March, 2011; 29-35","raw_type":"info:eu-repo/semantics/article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Layeb, Abdesselem","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I125485651","display_name":"University Fr\u00e8res Mentouri Constantine 1","ror":"https://ror.org/017wv6808","country_code":"DZ","type":"education","lineage":["https://openalex.org/I125485651"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Layeb, Abdesselem","raw_affiliation_strings":["University of Constantine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Constantine","institution_ids":["https://openalex.org/I125485651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027759450","display_name":"Tabib Nacer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I125485651","display_name":"University Fr\u00e8res Mentouri Constantine 1","ror":"https://ror.org/017wv6808","country_code":"DZ","type":"education","lineage":["https://openalex.org/I125485651"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Tabib, Nacer","raw_affiliation_strings":["University of Constantine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Constantine","institution_ids":["https://openalex.org/I125485651"]}]},{"author_position":"last","author":{"id":null,"display_name":"Brirem, Bilel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I125485651","display_name":"University Fr\u00e8res Mentouri Constantine 1","ror":"https://ror.org/017wv6808","country_code":"DZ","type":"education","lineage":["https://openalex.org/I125485651"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Brirem, Bilel","raw_affiliation_strings":["University of Constantine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Constantine","institution_ids":["https://openalex.org/I125485651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I125485651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9848999977111816,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9848999977111816,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.006800000090152025,"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.001500000013038516,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-decision-diagrams","display_name":"binary decision diagrams","score":0.9789999723434448},{"id":"https://openalex.org/keywords/variable-ordering","display_name":"variable ordering","score":0.8519999980926514},{"id":"https://openalex.org/keywords/bdd-minimization","display_name":"BDD minimization","score":0.8370000123977661},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8569999933242798},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"variable neighborhood search","score":0.9160000085830688},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.8830000162124634},{"id":"https://openalex.org/keywords/np-hard-optimization-problems","display_name":"NP-hard optimization","score":0.5809999704360962},{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.6129999756813049},{"id":"https://openalex.org/keywords/symbolic-state-representation","display_name":"symbolic state representation","score":0.6909999847412109}],"concepts":[{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6051573157310486},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5623788237571716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5580501556396484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47639814019203186},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45208540558815},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.44097253680229187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4291412830352783},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.41667264699935913},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4106597900390625},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:americanae.aecid.es:2730334","doi":null,"is_oa":false,"landing_page_url":"https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/324","pdf_url":null,"source":{"id":"https://openalex.org/S4306400786","display_name":"Americanae (AECID Library)","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFOCOMP Journal of Computer Science; Vol. 10 No. 1 (2011): March, 2011; 29-35","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:infocomp.dcc.ufla.br:article/324","doi":null,"is_oa":false,"landing_page_url":"https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/324","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"instacron:UFLA","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1512383952","https://openalex.org/W1516301787","https://openalex.org/W1589504134","https://openalex.org/W1596778355","https://openalex.org/W1986254541","https://openalex.org/W2030224590","https://openalex.org/W2066335675","https://openalex.org/W2067583942","https://openalex.org/W2093970175","https://openalex.org/W2104670598","https://openalex.org/W2129559415","https://openalex.org/W2141472133","https://openalex.org/W2154030608","https://openalex.org/W2801381011","https://openalex.org/W4245047141"],"related_works":["https://openalex.org/W2152325732","https://openalex.org/W2362966260","https://openalex.org/W98810354","https://openalex.org/W2032843794","https://openalex.org/W7099912576","https://openalex.org/W2141714581","https://openalex.org/W2157414893","https://openalex.org/W7138874246","https://openalex.org/W2104379552","https://openalex.org/W7098276859"],"abstract_inverted_index":{"The":[0,26,84],"Binary":[1],"Decision":[2],"Diagram":[3],"(BDD)":[4],"is":[5,17,29],"used":[6,19],"to":[7],"represent":[8],"in":[9,20,34],"symbolic":[10],"manner":[11],"a":[12,30,50,69,75],"set":[13],"of":[14,23,42,49,96],"states.":[15],"It":[16],"largely":[18],"the":[21,35,47,53,56,92,97],"field":[22],"formal":[24],"checking.":[25],"variable":[27],"ordering":[28,59],"very":[31,88],"important":[32],"step":[33],"BDD":[36],"optimization":[37],"process.":[38],"A":[39],"good":[40],"order":[41],"variables":[43,58],"will":[44],"reduce":[45],"considerably":[46],"size":[48],"BDD.":[51],"Unfortunately,":[52],"search":[54],"for":[55],"best":[57],"has":[60],"been":[61],"showed":[62],"NP-difficult.":[63],"In":[64],"this":[65],"article,":[66],"we":[67],"propose":[68],"new":[70],"iterative":[71],"approach":[72],"based":[73],"on":[74],"hybrid":[76,99],"Genetic":[77],"Algorithm":[78],"and":[79,90,94],"Variable":[80],"Neighborhood":[81],"Search":[82],"Algorithm.":[83],"obtained":[85],"results":[86],"are":[87],"encouraging":[89],"show":[91],"feasibility":[93],"effectiveness":[95],"proposed":[98],"approach.":[100]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2025-10-10T00:00:00"}