{"id":"https://openalex.org/W2032962269","doi":"https://doi.org/10.1142/s0218213099000257","title":"IMPROVING EVOLUTIONARY ALGORITHMS FOR EFFICIENT CONSTRAINT SATISFACTION","display_name":"IMPROVING EVOLUTIONARY ALGORITHMS FOR EFFICIENT CONSTRAINT SATISFACTION","publication_year":1999,"publication_date":"1999-12-01","ids":{"openalex":"https://openalex.org/W2032962269","doi":"https://doi.org/10.1142/s0218213099000257","mag":"2032962269"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213099000257","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213099000257","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","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/A5064839018","display_name":"Peter J. Stuckey","orcid":"https://orcid.org/0000-0003-2186-0459"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"PETER STUCKEY","raw_affiliation_strings":["Department of Computer Science, The University of Melbourne, Parkville 3052, Australia","Department of Computer Science, The University of Melbourne, Parkville 3052, Australia.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Melbourne, Parkville 3052, Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"Department of Computer Science, The University of Melbourne, Parkville 3052, Australia.#TAB#","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111997888","display_name":"Vincent Tam","orcid":null},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"VINCENT TAM","raw_affiliation_strings":["Department of Computer Science, The University of Melbourne, Parkville 3052, Australia","Department of Computer Science, The University of Melbourne, Parkville 3052, Australia.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Melbourne, Parkville 3052, Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"Department of Computer Science, The University of Melbourne, Parkville 3052, Australia.#TAB#","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064839018"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":2.5774,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89655172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"08","issue":"04","first_page":"363","last_page":"383"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9994999766349792,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9955999851226807,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7800878286361694},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7584850788116455},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.7088152170181274},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6978566646575928},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6242271065711975},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.614509642124176},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.5721296668052673},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5525732040405273},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5287011861801147},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5192742347717285},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.48888319730758667},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.4261641800403595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37494781613349915},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31428050994873047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15237325429916382}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7800878286361694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7584850788116455},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.7088152170181274},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6978566646575928},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6242271065711975},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.614509642124176},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.5721296668052673},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5525732040405273},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5287011861801147},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5192742347717285},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.48888319730758667},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4261641800403595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37494781613349915},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31428050994873047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15237325429916382},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218213099000257","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213099000257","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1526749820","https://openalex.org/W2153638045","https://openalex.org/W4386772582"],"related_works":["https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2737098235","https://openalex.org/W2017710358","https://openalex.org/W2148600103","https://openalex.org/W1492025412","https://openalex.org/W2252314269","https://openalex.org/W2992108460","https://openalex.org/W2382519087"],"abstract_inverted_index":{"Hard":[0],"or":[1,52],"large-scale":[2],"constraint":[3,66,82,121,155],"satisfaction":[4,67,83,122,156],"and":[5,13,76,85,137],"optimization":[6,54],"problems,":[7,84],"occur":[8],"widely":[9],"in":[10,49,64,73,90,112,117,149],"artificial":[11],"intelligence":[12],"operations":[14],"research.":[15],"These":[16],"problems":[17],"are":[18,41,78],"often":[19],"difficult":[20],"to":[21,114,119],"solve":[22],"with":[23],"global":[24],"search":[25,37,43,71],"methods,":[26,72],"but":[27],"many":[28],"of":[29,94,128,147,154],"them":[30],"can":[31,104,141],"be":[32],"efficiently":[33],"solved":[34],"by":[35,133],"local":[36,42,70],"methods.":[38],"Evolutionary":[39],"algorithms":[40,123],"methods":[44],"which":[45],"have":[46,59,86],"considerable":[47],"success":[48,89],"tackling":[50,65],"difficult,":[51],"ill-defined":[53],"problems.":[55,68,96,157],"In":[56,97],"contrast":[57],"they":[58],"not":[60],"been":[61],"so":[62,110],"successful":[63,111],"Other":[69],"particular":[74],"GENET":[75],"EGENET":[77,136,148],"designed":[79],"specifically":[80],"for":[81],"demonstrated":[87],"remarkable":[88],"solving":[91,150],"hard":[92,152],"examples":[93],"these":[95],"this":[98],"paper":[99],"we":[100,103],"examine":[101],"how":[102,139],"transfer":[105],"the":[106,145],"mechanisms":[107,134],"that":[108],"were":[109],"(E)GENET":[113],"evolutionary":[115,130],"algorithms,":[116],"order":[118],"tackle":[120],"efficiently.":[124],"An":[125],"empirical":[126],"comparison":[127],"our":[129],"algorithm":[131],"improved":[132],"from":[135],"shows":[138],"it":[140],"markedly":[142],"improve":[143],"on":[144],"efficiency":[146],"certain":[151],"instances":[153]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}