{"id":"https://openalex.org/W2606322318","doi":"https://doi.org/10.1109/cec.2017.7969424","title":"Tuning a Simulated Annealing metaheuristic for cross-domain search","display_name":"Tuning a Simulated Annealing metaheuristic for cross-domain search","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2606322318","doi":"https://doi.org/10.1109/cec.2017.7969424","mag":"2606322318"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2017.7969424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2017.7969424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://nottingham-repository.worktribe.com/output/871495","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068858464","display_name":"Warren G. Jackson","orcid":"https://orcid.org/0000-0002-5416-4460"},"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":"Warren G. Jackson","raw_affiliation_strings":["ASAP Research Group, University of Nottingham, Notingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ASAP Research Group, University of Nottingham, Notingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","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":["ASAP Research Group, University of Nottingham, Notingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ASAP Research Group, University of Nottingham, Notingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091177679","display_name":"Robert John","orcid":"https://orcid.org/0000-0002-2341-9993"},"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":"Robert I. John","raw_affiliation_strings":["ASAP Research Group, University of Nottingham, Notingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ASAP Research Group, University of Nottingham, Notingham, UK","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I142263535"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1055","last_page":"1062"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.8521660566329956},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7733829021453857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6980390548706055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6149358749389648},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.5989482998847961},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.49394065141677856},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.47401174902915955},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.44615912437438965},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4332778751850128},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4322882890701294},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.425856351852417},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38085609674453735},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.20818853378295898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18050062656402588}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8521660566329956},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7733829021453857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6980390548706055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6149358749389648},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.5989482998847961},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.49394065141677856},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.47401174902915955},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.44615912437438965},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4332778751850128},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4322882890701294},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.425856351852417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38085609674453735},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.20818853378295898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18050062656402588},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cec.2017.7969424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2017.7969424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.nottingham.ac.uk:41418","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/document/7969424/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402014","display_name":"Nottingham ePrints (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:nottingham-repository.worktribe.com:871495","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/871495","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:nottingham-repository.worktribe.com:871495","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/871495","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W74931915","https://openalex.org/W1485930605","https://openalex.org/W1829921621","https://openalex.org/W1925566585","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2038104061","https://openalex.org/W2040691271","https://openalex.org/W2043862089","https://openalex.org/W2047422346","https://openalex.org/W2056760934","https://openalex.org/W2063104570","https://openalex.org/W2072441740","https://openalex.org/W2090069860","https://openalex.org/W2108910404","https://openalex.org/W2118618548","https://openalex.org/W2120133173","https://openalex.org/W2156391157","https://openalex.org/W2238166365","https://openalex.org/W2559741365","https://openalex.org/W3123791793","https://openalex.org/W4249870550","https://openalex.org/W6637174430"],"related_works":["https://openalex.org/W1999617930","https://openalex.org/W3015341625","https://openalex.org/W2110546443","https://openalex.org/W1987473975","https://openalex.org/W2073588680","https://openalex.org/W2022341304","https://openalex.org/W3046481193","https://openalex.org/W2291893040","https://openalex.org/W90886653","https://openalex.org/W4312928368"],"abstract_inverted_index":{"Simulated":[0,82,108],"Annealing":[1,83,109],"is":[2,28,46,62,110,139],"a":[3,19,24,44,66,98,125],"well":[4],"known":[5],"local":[6,100],"search":[7,17,79,101],"metaheuristic":[8,45],"used":[9,29,123],"for":[10,35,69,86,129,147],"solving":[11,36,87],"computationally":[12],"hard":[13],"optimisation":[14,39],"problems.":[15,40],"Cross-domain":[16],"poses":[18],"higher":[20],"level":[21],"issue":[22],"where":[23],"single":[25,126],"solution":[26,127],"method":[27,128],"with":[30,153],"minor,":[31],"preferably":[32],"no":[33],"modification":[34],"characteristically":[37],"different":[38],"The":[41,103],"performance":[42,80,121],"of":[43,81],"often":[47],"dependant":[48],"on":[49],"its":[50],"initial":[51,115],"parameter":[52,60,116,137,149],"settings,":[53],"hence":[54],"detecting":[55],"the":[56,77,114,145],"best":[57],"configuration,":[58],"i.e.":[59],"tuning":[61,85,138,143],"crucial,":[63],"which":[64],"becomes":[65],"further":[67],"challenge":[68],"cross-domain":[70,78,130,136,154],"search.":[71,131,155],"In":[72],"this":[73],"paper,":[74],"we":[75,133],"investigate":[76],"via":[84],"six":[88],"problems,":[89],"ranging":[90],"from":[91],"personnel":[92],"scheduling":[93],"to":[94,113,119,141],"vehicle":[95],"routing":[96],"under":[97],"stochastic":[99],"framework.":[102],"empirical":[104],"results":[105],"show":[106],"that":[107,135],"extremely":[111],"sensitive":[112],"settings":[117],"leading":[118],"sub-standard":[120],"when":[122,151],"as":[124],"Moreover,":[132],"demonstrate":[134],"inferior":[140],"domain-level":[142],"highlighting":[144],"requirements":[146],"adaptive":[148],"configurations":[150],"dealing":[152]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}