{"id":"https://openalex.org/W4391308021","doi":"https://doi.org/10.1109/smc53992.2023.10394613","title":"A Learning-Based Framework for Constrained Shortest Path Problems","display_name":"A Learning-Based Framework for Constrained Shortest Path Problems","publication_year":2023,"publication_date":"2023-10-01","ids":{"openalex":"https://openalex.org/W4391308021","doi":"https://doi.org/10.1109/smc53992.2023.10394613"},"language":"en","primary_location":{"id":"doi:10.1109/smc53992.2023.10394613","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/smc53992.2023.10394613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5040131467","display_name":"Xuefeng Jin","orcid":"https://orcid.org/0000-0002-4602-3107"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuefeng Jin","raw_affiliation_strings":["School of Computer Science and Engineering, Sun Yat-sen University,Guangzhou,China","School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University,Guangzhou,China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100768971","display_name":"Shun\u2010Zheng Yu","orcid":"https://orcid.org/0000-0002-7797-9224"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shunzheng Yu","raw_affiliation_strings":["School of Computer Science and Engineering, Sun Yat-sen University,Guangzhou,China","School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University,Guangzhou,China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18553988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"62","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9876999855041504,"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"}},"topics":[{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9876999855041504,"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9855999946594238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7513993978500366},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6552203297615051},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6452680826187134},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6218647956848145},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5534895062446594},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5324968099594116},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.49929308891296387},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48910409212112427},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.44626256823539734},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42414596676826477},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4068596661090851},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3967961072921753},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2989964485168457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13654088973999023}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7513993978500366},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6552203297615051},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6452680826187134},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6218647956848145},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5534895062446594},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5324968099594116},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.49929308891296387},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48910409212112427},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.44626256823539734},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42414596676826477},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4068596661090851},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3967961072921753},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2989964485168457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13654088973999023},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc53992.2023.10394613","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/smc53992.2023.10394613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1677182931","https://openalex.org/W1879678483","https://openalex.org/W1995415305","https://openalex.org/W2008620264","https://openalex.org/W2014852559","https://openalex.org/W2017597147","https://openalex.org/W2024060531","https://openalex.org/W2036900823","https://openalex.org/W2069667928","https://openalex.org/W2099742000","https://openalex.org/W2107941094","https://openalex.org/W2119717200","https://openalex.org/W2130775539","https://openalex.org/W2154929945","https://openalex.org/W2171682056","https://openalex.org/W2194775991","https://openalex.org/W2295174014","https://openalex.org/W2594963174","https://openalex.org/W2747329762","https://openalex.org/W2964915865","https://openalex.org/W3023540311","https://openalex.org/W3027146252","https://openalex.org/W3047863327","https://openalex.org/W3170112077","https://openalex.org/W3201572672","https://openalex.org/W3202775986","https://openalex.org/W4231449374","https://openalex.org/W4288419263","https://openalex.org/W4292083457","https://openalex.org/W4307561361","https://openalex.org/W4385245566"],"related_works":["https://openalex.org/W4306904969","https://openalex.org/W2138720691","https://openalex.org/W4362501864","https://openalex.org/W4380318855","https://openalex.org/W2031695474","https://openalex.org/W2024136090","https://openalex.org/W4391331176","https://openalex.org/W2586732548","https://openalex.org/W3049728571","https://openalex.org/W2964765435"],"abstract_inverted_index":{"The":[0],"doubly":[1],"resource":[2],"constrained":[3],"elementary":[4],"shortest":[5],"path":[6,85],"problem":[7],"(DRCESPP)":[8],"has":[9],"important":[10],"applications":[11],"in":[12,128],"intelligent":[13],"network":[14,48,63],"scenarios.":[15],"For":[16],"solving":[17],"this":[18],"strong":[19],"NP-hard":[20],"problem,":[21],"we":[22],"introduce":[23],"learning-based":[24],"techniques":[25],"and":[26,37,50,102,133],"present":[27],"a":[28,60,77,98,103],"solution":[29,94,131],"framework":[30,119],"integrating":[31],"preprocessing,":[32],"graph":[33,61],"neural":[34],"networks":[35,69,90],"(GNNs)":[36],"deep":[38],"reinforcement":[39,109],"learning":[40,110],"(DRL).":[41],"First,":[42],"the":[43,47,56,67,83,87,108,117],"preprocessing":[44],"procedure":[45],"reduces":[46],"size":[49],"provides":[51],"initial":[52],"feasible":[53],"paths.":[54],"Then,":[55],"classifier,":[57],"implemented":[58],"by":[59],"attention":[62],"(GAT),":[64],"filters":[65],"out":[66],"reduced":[68,89],"where":[70],"better":[71,121],"paths":[72],"exist":[73],"after":[74],"preprocessing.":[75],"Finally,":[76],"DRL-based":[78],"heuristic":[79,126],"attempts":[80],"to":[81],"construct":[82],"optimal":[84],"for":[86,107],"filtered":[88],"with":[91,124],"an":[92],"end-to-end":[93],"paradigm.":[95],"We":[96],"devise":[97],"crafted":[99],"reward":[100],"function":[101],"shared":[104],"low-variance":[105],"baseline":[106],"optimization":[111],"algorithm.":[112],"Our":[113],"experiments":[114],"suggest":[115],"that":[116],"proposed":[118],"achieves":[120],"performance":[122],"compared":[123],"competitive":[125],"algorithms":[127],"terms":[129],"of":[130],"quality":[132],"computational":[134],"efficiency.":[135]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}