{"id":"https://openalex.org/W2997067626","doi":"https://doi.org/10.1109/anzcc47194.2019.8945670","title":"Generalized Simulated Annealing with Sequentially Modified Cost Function for Combinatorial optimization Problems","display_name":"Generalized Simulated Annealing with Sequentially Modified Cost Function for Combinatorial optimization Problems","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W2997067626","doi":"https://doi.org/10.1109/anzcc47194.2019.8945670","mag":"2997067626"},"language":"en","primary_location":{"id":"doi:10.1109/anzcc47194.2019.8945670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/anzcc47194.2019.8945670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Australian & New Zealand Control Conference (ANZCC)","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/A5101464065","display_name":"Jiayin Chen","orcid":"https://orcid.org/0000-0003-0452-2618"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jiayin Chen","raw_affiliation_strings":["School of Electrical Engineering and Telecommunications, UNSW Australia, Sydney"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Telecommunications, UNSW Australia, Sydney","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064534342","display_name":"Hendra I. Nurdin","orcid":"https://orcid.org/0000-0002-5588-4259"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Hendra I. Nurdin","raw_affiliation_strings":["School of Electrical Engineering and Telecommunications, UNSW Australia, Sydney"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Telecommunications, UNSW Australia, Sydney","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"48","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980000257492065,"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.9980000257492065,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9952999949455261,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8492535948753357},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7859901189804077},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.7706506252288818},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6655083894729614},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5279972553253174},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4898357093334198},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4868270754814148},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.465997576713562},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.44538867473602295},{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"Quantum annealing","score":0.42178159952163696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38373851776123047},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36054468154907227},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.2034190595149994},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.17077264189720154}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8492535948753357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7859901189804077},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.7706506252288818},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6655083894729614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5279972553253174},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4898357093334198},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4868270754814148},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.465997576713562},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.44538867473602295},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.42178159952163696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38373851776123047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36054468154907227},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.2034190595149994},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.17077264189720154},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/anzcc47194.2019.8945670","is_oa":false,"landing_page_url":"https://doi.org/10.1109/anzcc47194.2019.8945670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Australian & New Zealand Control Conference (ANZCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1532995108","https://openalex.org/W1553069021","https://openalex.org/W1568345435","https://openalex.org/W1979359313","https://openalex.org/W2002532127","https://openalex.org/W2005228957","https://openalex.org/W2013923357","https://openalex.org/W2024060531","https://openalex.org/W2027960705","https://openalex.org/W2034307786","https://openalex.org/W2042986967","https://openalex.org/W2095172966","https://openalex.org/W2128193809","https://openalex.org/W2136835942","https://openalex.org/W2137212056","https://openalex.org/W2138309709","https://openalex.org/W2165469059","https://openalex.org/W2165616866","https://openalex.org/W2326740504","https://openalex.org/W2751862591","https://openalex.org/W2781738013","https://openalex.org/W3100931082","https://openalex.org/W6634007516"],"related_works":["https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W4283765137","https://openalex.org/W4317496694","https://openalex.org/W3174749984","https://openalex.org/W2887485518","https://openalex.org/W1655912143","https://openalex.org/W2560221187","https://openalex.org/W4287021660","https://openalex.org/W2143668930"],"abstract_inverted_index":{"Recent":[0],"efforts":[1],"to":[2,33,78,94,125,166],"develop":[3],"hybrid":[4],"quantum-classical":[5],"algorithms":[6,19],"for":[7,23,29],"solving":[8],"combinatorial":[9,34],"problems":[10,35],"have":[11],"rekindled":[12],"interest":[13],"in":[14,55,75,109],"revisiting":[15],"heuristic":[16],"classical":[17,69,88,102],"optimization":[18],"and":[20,105,128],"exploring":[21],"possibilities":[22],"improving":[24],"them.":[25],"A":[26],"popular":[27],"approach":[28],"finding":[30],"good":[31],"solutions":[32],"is":[36,48,91,113,163],"local":[37,50,57],"search.":[38],"In":[39,97],"spite":[40],"of":[41,87,133,160],"its":[42,82,181],"efficiency,":[43],"if":[44],"the":[45,60,111,134,140,150,158,167,172],"search":[46,51,64],"space":[47],"rugged,":[49],"often":[52,92],"gets":[53],"trapped":[54],"unsatisfactory":[56],"optima.":[58,80],"On":[59],"other":[61],"hand,":[62],"global":[63,79,126],"meta-heuristic":[65],"algorithms,":[66],"such":[67],"as":[68],"simulated":[70,89,103],"annealing,":[71],"guarantee":[72],"asymptotic":[73,123],"convergence":[74,124],"probability":[76],"distribution":[77],"Despite":[81],"theoretical":[83],"appeal,":[84],"practical":[85],"performance":[86,159],"annealing":[90,104,112],"sensitive":[93],"implementation":[95],"details.":[96],"this":[98,144,161],"paper,":[99],"we":[100],"revisit":[101],"propose":[106],"a":[107,116,175],"generalization":[108],"which":[110],"guided":[114],"by":[115],"sequentially":[117],"modified":[118,135,146],"cost":[119,136,147],"function.":[120,137],"We":[121,138],"prove":[122],"optima":[127],"give":[129],"an":[130],"example":[131,145],"choice":[132],"test":[139],"proposed":[141],"algorithm":[142],"with":[143],"function":[148],"on":[149],"traveling":[151],"salesman":[152],"problem.":[153],"Numerical":[154],"results":[155],"suggest":[156],"that":[157],"method":[162,173],"more":[164],"robust":[165],"initial":[168],"temperature":[169],"choice.":[170],"Furthermore,":[171],"demonstrates":[174],"significant":[176],"efficiency":[177],"gain":[178],"without":[179],"compromising":[180],"performance.":[182]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}