乐胖代购免代理版

{"id":"https://openalex.org/W2076787556","doi":"https://doi.org/10.1109/ukci.2013.6651303","title":"Memetic algorithms for Cross-domain Heuristic Search","display_name":"Memetic algorithms for Cross-domain Heuristic Search","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2076787556","doi":"https://doi.org/10.1109/ukci.2013.6651303","mag":"2076787556"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2013.6651303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.cs.nott.ac.uk/~exo/docs/publications/ukci2013_MA_CHESC.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020026827","display_name":"Ender \u00d6zcan","orcid":"https://orcid.org/0000-0003-0276-1391"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ender Ozcan","raw_affiliation_strings":["Automated Scheduling, Optimisation & Planning Res. Group, Univ. of Nottingham, Nottingham, UK"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation & Planning Res. Group, Univ. of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003488448","display_name":"Shahriar Asta","orcid":"https://orcid.org/0000-0002-7733-2500"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shahriar Asta","raw_affiliation_strings":["Automated Scheduling, Optimisation & Planning Res. Group, Univ. of Nottingham, Nottingham, UK"],"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation & Planning Res. Group, Univ. of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004801465","display_name":"Cevriye Alt\u0131nta\u015f","orcid":null},"institutions":[{"id":"https://openalex.org/I175124709","display_name":"S\u00fcleyman Demirel University","ror":"https://ror.org/04fjtte88","country_code":"TR","type":"education","lineage":["https://openalex.org/I175124709"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Cevriye Altintas","raw_affiliation_strings":["Suleyman Demirel University, Isparta, Turkey;"],"affiliations":[{"raw_affiliation_string":"Suleyman Demirel University, Isparta, Turkey;","institution_ids":["https://openalex.org/I175124709"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.865,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":7,"citation_normalized_percentile":{"value":0.730427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":83,"max":84},"biblio":{"volume":null,"issue":null,"first_page":"175","last_page":"182"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998,"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.9998,"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.9994,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.65499514},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.64588785},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.62826467}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.691268},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.65499514},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.64588785},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.62826467},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.57653546},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5699473},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5263561},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.4914335},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.48864964},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4661808},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45856297},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.43102163},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41081145},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35355985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3368511},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3139542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22032231},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.10130289},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/ukci.2013.6651303","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.7308","pdf_url":"http://www.cs.nott.ac.uk/~exo/docs/publications/ukci2013_MA_CHESC.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.7308","pdf_url":"http://www.cs.nott.ac.uk/~exo/docs/publications/ukci2013_MA_CHESC.pdf","source":{"id":"https://openalex.org/S4306400349","display_name":"CiteSeer X (The Pennsylvania State University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130769515","host_organization_name":"Pennsylvania State University","host_organization_lineage":["https://openalex.org/I130769515"],"host_organization_lineage_names":["Pennsylvania State University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":45,"referenced_works":["https://openalex.org/W1257316017","https://openalex.org/W1481729573","https://openalex.org/W1520349147","https://openalex.org/W1527172735","https://openalex.org/W1543127209","https://openalex.org/W1551001158","https://openalex.org/W1567102157","https://openalex.org/W1691366073","https://openalex.org/W1745341198","https://openalex.org/W178264497","https://openalex.org/W1794976143","https://openalex.org/W1814515812","https://openalex.org/W1817244122","https://openalex.org/W18216792","https://openalex.org/W1829921621","https://openalex.org/W1857496909","https://openalex.org/W1918283942","https://openalex.org/W192263341","https://openalex.org/W1936224457","https://openalex.org/W197551278","https://openalex.org/W1987220363","https://openalex.org/W1989507398","https://openalex.org/W2008434012","https://openalex.org/W2023947722","https://openalex.org/W2026076687","https://openalex.org/W2026566141","https://openalex.org/W2031012845","https://openalex.org/W2035964608","https://openalex.org/W2039568841","https://openalex.org/W2056356393","https://openalex.org/W2056956492","https://openalex.org/W2060358758","https://openalex.org/W2072441740","https://openalex.org/W2098677716","https://openalex.org/W2104274529","https://openalex.org/W2112100376","https://openalex.org/W2114620686","https://openalex.org/W2122510010","https://openalex.org/W2126637747","https://openalex.org/W2134407235","https://openalex.org/W2151809174","https://openalex.org/W2154047522","https://openalex.org/W2164989062","https://openalex.org/W2624262714","https://openalex.org/W63064086"],"related_works":["https://openalex.org/W58921990","https://openalex.org/W4386269615","https://openalex.org/W4322703856","https://openalex.org/W4200104947","https://openalex.org/W3111117784","https://openalex.org/W2402589461","https://openalex.org/W2358427436","https://openalex.org/W2081821176","https://openalex.org/W2064794194","https://openalex.org/W1994919150"],"abstract_inverted_index":{"Hyper-heuristic":[0],"Flexible":[1],"Framework":[2],"(HyFlex)":[3],"is":[4,27],"an":[5],"interface":[6],"designed":[7],"to":[8,66,145],"enable":[9],"the":[10,34,46,76,81,114,127,130,134,148,154,172,196],"development,":[11],"testing":[12],"and":[13,110,174,180],"comparison":[14],"of":[15,36,40,52,88,103,129,150,153,161,177,195],"iterative":[16],"general-purpose":[17],"heuristic":[18],"search":[19,47],"algorithms,":[20],"particularly":[21],"selection":[22,25,78],"hyper-heuristics.":[23],"A":[24],"hyper-heuristic":[26,79,116,124],"a":[28,37,63,86,121,143,159],"high":[29],"level":[30,42,176],"methodology":[31],"that":[32],"coordinates":[33],"interaction":[35],"fixed":[38],"set":[39,87],"low":[41],"heuristics":[43],"(operators)":[44],"during":[45],"process.":[48],"The":[49],"Java":[50],"implementation":[51,98],"HyFlex":[53,135],"along":[54],"with":[55,80,188],"different":[56,92,101],"problem":[57,93,96,162,193],"domains":[58,163,194],"was":[59],"recently":[60],"used":[61,141],"in":[62],"competition,":[64],"referred":[65],"as":[67,120,142],"Cross-domain":[68],"Heuristic":[69],"Search":[70],"Challenge":[71],"(CHeSC2011).":[72],"CHeSC2011":[73,112,137,197],"sought":[74],"for":[75,123,164],"best":[77,82],"median":[83],"performance":[84,149,173],"over":[85],"instances":[89],"from":[90],"six":[91,192],"domains.":[94],"Each":[95],"domain":[97],"contained":[99],"four":[100],"types":[102],"operators,":[104],"namely":[105],"mutation,":[106],"ruin-recreate,":[107],"hill":[108,189],"climbing":[109,190],"crossover.":[111],"including":[113],"competing":[115],"methods":[117,157],"currently":[118],"serves":[119],"benchmark":[122,144],"research.":[125],"Considering":[126],"type":[128],"operators":[131],"implemented":[132],"under":[133],"framework,":[136],"could":[138],"also":[139],"be":[140],"empirically":[146],"compare":[147],"appropriate":[151],"variants":[152],"evolutionary":[155],"computation":[156],"across":[158,191],"variety":[160],"discrete":[165],"optimisation.":[166],"In":[167],"this":[168],"study,":[169],"we":[170],"investigate":[171],"generality":[175],"generic":[178],"steady-state":[179],"transgenerational":[181],"memetic":[182],"algorithms":[183,187],"which":[184],"hybridize":[185],"genetic":[186],"benchmark.":[198]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2076787556","counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-01-07T10:06:41.865621","created_date":"2016-06-24"}