{"id":"https://openalex.org/W2512972094","doi":"https://doi.org/10.1142/s1469026816500176","title":"A New Parallel GA-Based Method for Constraint Satisfaction Problems","display_name":"A New Parallel GA-Based Method for Constraint Satisfaction Problems","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2512972094","doi":"https://doi.org/10.1142/s1469026816500176","mag":"2512972094"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026816500176","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026816500176","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-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/A5031719929","display_name":"Reza Abbasian","orcid":null},"institutions":[{"id":"https://openalex.org/I194028371","display_name":"University of Regina","ror":"https://ror.org/03dzc0485","country_code":"CA","type":"education","lineage":["https://openalex.org/I194028371"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Reza Abbasian","raw_affiliation_strings":["Department of Computer Science, University of Regina, Regina S4S 0A2, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Regina, Regina S4S 0A2, Canada","institution_ids":["https://openalex.org/I194028371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058768233","display_name":"Malek Mouhoub","orcid":"https://orcid.org/0000-0001-7381-1064"},"institutions":[{"id":"https://openalex.org/I194028371","display_name":"University of Regina","ror":"https://ror.org/03dzc0485","country_code":"CA","type":"education","lineage":["https://openalex.org/I194028371"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Malek Mouhoub","raw_affiliation_strings":["Department of Computer Science, University of Regina, Regina S4S 0A2, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Regina, Regina S4S 0A2, Canada","institution_ids":["https://openalex.org/I194028371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031719929"],"corresponding_institution_ids":["https://openalex.org/I194028371"],"apc_list":null,"apc_paid":null,"fwci":1.1812,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82173488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"03","first_page":"1650017","last_page":"1650017"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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.9998000264167786,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9613000154495239,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8813893795013428},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8484789133071899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.814505934715271},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5942682027816772},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5476048588752747},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5359920263290405},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5314128994941711},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4960959851741791},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49410727620124817},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.45592406392097473},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.43881455063819885},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.43815332651138306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3239993453025818},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15654727816581726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12015008926391602},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09817689657211304}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8813893795013428},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8484789133071899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.814505934715271},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5942682027816772},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5476048588752747},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5359920263290405},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5314128994941711},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4960959851741791},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49410727620124817},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.45592406392097473},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.43881455063819885},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.43815332651138306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3239993453025818},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15654727816581726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12015008926391602},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09817689657211304},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1469026816500176","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026816500176","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"No poverty","id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1526788855","https://openalex.org/W1541691514","https://openalex.org/W1574141101","https://openalex.org/W1605050868","https://openalex.org/W1788316346","https://openalex.org/W1974771415","https://openalex.org/W1988866671","https://openalex.org/W1993219802","https://openalex.org/W2020799200","https://openalex.org/W2038210370","https://openalex.org/W2039339012","https://openalex.org/W2050586250","https://openalex.org/W2068852367","https://openalex.org/W2071639741","https://openalex.org/W2073818615","https://openalex.org/W2080143744","https://openalex.org/W2098964079","https://openalex.org/W2105251799","https://openalex.org/W2113297784","https://openalex.org/W2130182605","https://openalex.org/W2130778140","https://openalex.org/W2135432705","https://openalex.org/W2139300273","https://openalex.org/W2161484642","https://openalex.org/W2169354676","https://openalex.org/W2426452510","https://openalex.org/W4299796063"],"related_works":["https://openalex.org/W4303044088","https://openalex.org/W1486916474","https://openalex.org/W2140769824","https://openalex.org/W115413730","https://openalex.org/W2032348095","https://openalex.org/W2049055139","https://openalex.org/W2495408185","https://openalex.org/W2520084020","https://openalex.org/W2524435840","https://openalex.org/W2156897434"],"abstract_inverted_index":{"Despite":[0],"some":[1],"success":[2],"of":[3,61,159,187],"Genetic":[4],"Algorithms":[5],"(GAs)":[6],"when":[7],"tackling":[8],"Constraint":[9],"Satisfaction":[10],"Problems":[11],"(CSPs),":[12],"they":[13],"generally":[14],"suffer":[15],"from":[16,133],"poor":[17],"crossover":[18,32,57],"operators.":[19],"In":[20,105],"order":[21,154],"to":[22,98,114,155,162,172],"overcome":[23],"this":[24,55],"limitation":[25],"in":[26,153,167],"practice,":[27],"we":[28,107,111,138],"propose":[29],"a":[30,44,52,181,184],"novel":[31],"specifically":[33],"designed":[34],"for":[35,103,123,195],"solving":[36,60,173],"CSPs":[37,40,77,149],"including":[38],"Temporal":[39],"(TCSPs).":[41],"Together":[42],"with":[43,116,164,183],"variable":[45],"ordering":[46],"heuristic":[47],"and":[48,63,78,146,150],"an":[49],"integration":[50],"into":[51],"parallel":[53],"architecture,":[54],"proposed":[56,94],"enables":[58],"the":[59,70,82,99,117,157,174,177,192],"large":[62,144],"hard":[64],"problem":[65,125],"instances":[66,126,131,152],"as":[67,127,129],"demonstrated":[68],"by":[69,179],"experimental":[71],"tests":[72,141],"conducted":[73,139],"on":[74,81,142,191],"randomly":[75],"generated":[76],"TCSPs":[79,151],"based":[80],"model":[83],"RB.":[84],"We":[85],"will":[86,108],"indeed":[87],"demonstrate,":[88],"through":[89],"these":[90],"tests,":[91],"that":[92,110],"our":[93,160],"method":[95,161],"is":[96],"superior":[97],"known":[100],"GA-based":[101],"techniques":[102],"CSPs.":[104],"addition,":[106],"show":[109,156],"are":[112],"able":[113],"compete":[115],"efficient":[118],"MAC-based":[119],"Abscon":[120],"109":[121],"solver":[122],"random":[124],"well":[128],"those":[130],"taken":[132],"Lecoutre\u2019s":[134],"CSP":[135,175],"library.":[136],"Finally,":[137],"additional":[140],"very":[143],"consistent":[145],"over":[147],"constrained":[148],"ability":[158],"deal":[163],"constraint":[165],"problems":[166],"real":[168],"time.":[169],"This":[170],"corresponds":[171],"or":[176],"TCSP":[178],"giving":[180],"solution":[182],"quality":[185],"(number":[186],"solved":[188],"constraints)":[189],"depending":[190],"time":[193],"allocated":[194],"computation.":[196]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}