{"id":"https://openalex.org/W1564010316","doi":"https://doi.org/10.1109/cec.2005.1554840","title":"D>sup<3>/sup<G>sup<2>/sup<A : a new Dynamic Distributed Double Guided Genetic Algorithm for \u03c3CSPs","display_name":"D>sup<3>/sup<G>sup<2>/sup<A : a new Dynamic Distributed Double Guided Genetic Algorithm for \u03c3CSPs","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W1564010316","doi":"https://doi.org/10.1109/cec.2005.1554840","mag":"1564010316"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5072960507","display_name":"Sadok Bouamama","orcid":"https://orcid.org/0000-0002-3840-3978"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"S. Bouamama","raw_affiliation_strings":["Departement of Comput. Sci., Univ. of Tunis, Bouchoucha, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departement of Comput. Sci., Univ. of Tunis, Bouchoucha, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027500742","display_name":"Khaled Gh\u00e9dira","orcid":"https://orcid.org/0000-0003-0834-9314"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"K. Ghedira","raw_affiliation_strings":["B. 204 departement of computer science, SOIE/University of Tunis, cit\u00e9 Bouchoucha, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"B. 204 departement of computer science, SOIE/University of Tunis, cit\u00e9 Bouchoucha, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I108714496"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07451279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1298","last_page":"1304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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.9994000196456909,"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.9952999949455261,"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.9868000149726868,"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/algorithm","display_name":"Algorithm","score":0.6182000637054443},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5447893142700195},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45883268117904663},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.42842257022857666},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4246428906917572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41347578167915344},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4065704345703125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3947009742259979},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36666837334632874},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.13738423585891724}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6182000637054443},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5447893142700195},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45883268117904663},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.42842257022857666},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4246428906917572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41347578167915344},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4065704345703125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3947009742259979},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36666837334632874},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.13738423585891724},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2005.1554840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W115793361","https://openalex.org/W1497256448","https://openalex.org/W1591152531","https://openalex.org/W1661761688","https://openalex.org/W1868841418","https://openalex.org/W2028983148","https://openalex.org/W2121766240","https://openalex.org/W2569549435","https://openalex.org/W3023540311"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W1991411408","https://openalex.org/W4288278856","https://openalex.org/W2572370460"],"abstract_inverted_index":{"Inspired":[0],"by":[1,8,57,95],"the":[2,9,48,59,63,81,116,119,125,135,141,146,150],"guided":[3,13,56],"genetic":[4,14,68],"algorithm":[5,15,36,148],"(GGA)":[6],"and":[7,42,62,128,140],"dynamic":[10],"distributed":[11],"double":[12],"for":[16,76],"Max/spl":[17],"I.bar/CSPs,":[18],"D/sup":[19,163],"3/G/sup":[20,164],"2/A":[21,165],"is":[22,93,132,171],"a":[23,96],"new":[24,97,147],"multi-agent":[25,84],"approach":[26,92],"which":[27],"addresses":[28],"additive":[29,77],"constraint":[30],"satisfaction":[31],"problems":[32],"(/spl":[33],"Sigma/CSPs).":[34],"This":[35,131],"consists":[37],"of":[38,137],"agents":[39,152],"dynamically":[40],"created":[41],"cooperating":[43],"in":[44,80],"order":[45,160],"to":[46,154,161],"solve":[47],"problem.":[49],"Each":[50],"agent":[51],"performs":[52],"its":[53],"own":[54],"GA,":[55],"both":[58],"template":[60],"concept":[61],"min-conflict-heuristic.":[64],"In":[65,115,144,159],"one":[66],"hand,":[67,83],"algorithms":[69],"(GAs)":[70],"efficiency":[71],"provides":[72],"good":[73],"solution":[74],"quality":[75],"CSPs":[78],"and,":[79],"other":[82],"principles":[85],"reduces":[86],"GA":[87,157],"temporal":[88],"complexity.":[89],"First,":[90],"our":[91],"enhanced":[94],"parameter":[98],"called":[99],"guidance":[100],"operator.":[101],"The":[102],"latter":[103],"allows":[104],"not":[105],"only":[106],"diversification":[107],"but":[108],"also":[109],"an":[110],"escaping":[111],"from":[112],"local":[113],"optima.":[114],"second":[117],"step,":[118],"performed":[120],"GAs":[121],"no":[122],"longer":[123],"have":[124],"same":[126],"cross-over":[127],"mutation":[129],"probabilities.":[130],"done":[133],"on":[134],"basis":[136],"NEO-DARWINISM":[138],"theory":[139],"nature":[142],"laws.":[143],"fact":[145],"let":[149],"species":[151],"able":[153],"count":[155],"their":[156],"parameters.":[158],"show":[162],"advantages,":[166],"experimental":[167],"comparison":[168],"with":[169],"GGA":[170],"provided.":[172]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}