{"id":"https://openalex.org/W4403675904","doi":"https://doi.org/10.1109/case59546.2024.10711754","title":"Simulated Hill Climbing Search for the Solutions of k-Vertex Cut Problems","display_name":"Simulated Hill Climbing Search for the Solutions of k-Vertex Cut Problems","publication_year":2024,"publication_date":"2024-08-28","ids":{"openalex":"https://openalex.org/W4403675904","doi":"https://doi.org/10.1109/case59546.2024.10711754"},"language":"en","primary_location":{"id":"doi:10.1109/case59546.2024.10711754","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/case59546.2024.10711754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 20th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-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/A5071839367","display_name":"Yangming Zhou","orcid":"https://orcid.org/0000-0002-4254-6517"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yangming Zhou","raw_affiliation_strings":["Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University,Shanghai,China,200030"],"affiliations":[{"raw_affiliation_string":"Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University,Shanghai,China,200030","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011681810","display_name":"Zhibin Jiang","orcid":"https://orcid.org/0000-0002-9241-0212"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhibin Jiang","raw_affiliation_strings":["Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University,Shanghai,China,200030"],"affiliations":[{"raw_affiliation_string":"Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University,Shanghai,China,200030","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105789027","display_name":"MengChu Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MengChu Zhou","raw_affiliation_strings":["New Jersey Institute of Technology,Department of Electrical and Computer Engineering,Newark,USA,NJ07102"],"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology,Department of Electrical and Computer Engineering,Newark,USA,NJ07102","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071839367"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2670977,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1729","last_page":"1734"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9930999875068665,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9930999875068665,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9761999845504761,"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/hill-climbing","display_name":"Hill climbing","score":0.6866214871406555},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.645431399345398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5319063663482666},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3850864768028259},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3564729392528534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3374525308609009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3317951560020447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3016655445098877},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09400767087936401}],"concepts":[{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.6866214871406555},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.645431399345398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5319063663482666},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3850864768028259},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3564729392528534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3374525308609009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3317951560020447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3016655445098877},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09400767087936401}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case59546.2024.10711754","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/case59546.2024.10711754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE 20th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1964488715","https://openalex.org/W2013281124","https://openalex.org/W2044757908","https://openalex.org/W2121035174","https://openalex.org/W2792824988","https://openalex.org/W2890368053","https://openalex.org/W2963130633","https://openalex.org/W2964998526","https://openalex.org/W3046197868","https://openalex.org/W3047863327","https://openalex.org/W3125629652","https://openalex.org/W3137007432","https://openalex.org/W4310068862","https://openalex.org/W4322730947","https://openalex.org/W4386092063","https://openalex.org/W4398226177"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2343247866","https://openalex.org/W4237368524","https://openalex.org/W1232705","https://openalex.org/W2347288419","https://openalex.org/W2476121495","https://openalex.org/W2091546382","https://openalex.org/W2460653416","https://openalex.org/W2980963558","https://openalex.org/W3111310291"],"abstract_inverted_index":{"A":[0],"k-vertex":[1],"cut":[2],"problem":[3,38],"aims":[4],"to":[5,25,57,85],"find":[6],"a":[7,15,48],"minimum":[8],"subset":[9],"of":[10,28,62,79,100,109],"nodes":[11],"whose":[12],"removal":[13],"decomposes":[14],"graph":[16],"into":[17],"at":[18],"least":[19],"k":[20],"connected":[21],"components,":[22],"which":[23],"belongs":[24],"the":[26,95,110],"family":[27],"critical":[29],"node":[30],"detection":[31],"problems.":[32],"It":[33],"is":[34],"an":[35],"important":[36],"NP-hard":[37],"with":[39],"various":[40],"real-world":[41],"applications.":[42],"In":[43],"this":[44],"paper,":[45],"we":[46],"propose":[47],"simple":[49],"and":[50,71,104],"effective":[51],"simulated":[52],"hill":[53],"climbing":[54],"search":[55,65,70],"(SHCS)":[56],"solve":[58],"it.":[59],"SHCS":[60],"consists":[61],"three":[63],"complementary":[64],"phases:":[66],"forward":[67],"search,":[68],"stagnation":[69],"backward":[72],"search.":[73],"Extensive":[74],"experiments":[75],"on":[76,107],"two":[77],"groups":[78],"widely-used":[80],"benchmark":[81],"instances":[82],"are":[83],"conducted":[84],"evaluate":[86],"performance.":[87],"The":[88],"results":[89],"show":[90],"that":[91],"it":[92],"significantly":[93],"outperforms":[94],"state-of-the-art":[96],"algorithms":[97],"in":[98],"terms":[99],"both":[101],"solution":[102],"quality":[103],"computational":[105],"time":[106],"most":[108],"instances.":[111]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}