{"id":"https://openalex.org/W2056413289","doi":"https://doi.org/10.1109/tase.2009.2012434","title":"$K$ Constrained Shortest Path Problem","display_name":"$K$ Constrained Shortest Path Problem","publication_year":2009,"publication_date":"2009-05-11","ids":{"openalex":"https://openalex.org/W2056413289","doi":"https://doi.org/10.1109/tase.2009.2012434","mag":"2056413289"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2009.2012434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2009.2012434","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-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/A5050674712","display_name":"Ning Shi","orcid":"https://orcid.org/0000-0003-1854-6354"},"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":true,"raw_author_name":"Ning Shi","raw_affiliation_strings":["School of Business, Sun Yat-sen University, Guangzhou, China","(School of Business, Sun Yat\u2010Sen University, Guangzhou, China)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Business, Sun Yat-sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"(School of Business, Sun Yat\u2010Sen University, Guangzhou, China)","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050674712"],"corresponding_institution_ids":["https://openalex.org/I157773358"],"apc_list":null,"apc_paid":null,"fwci":1.0687,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.78741461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"1","first_page":"15","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9951000213623047,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.744170606136322},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6892287731170654},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6878024339675903},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6034218668937683},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4940057396888733},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49151620268821716},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4381728172302246},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.42630481719970703},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42397454380989075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37624168395996094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37058526277542114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2250102460384369},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19704535603523254}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.744170606136322},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6892287731170654},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6878024339675903},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6034218668937683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4940057396888733},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49151620268821716},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4381728172302246},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.42630481719970703},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42397454380989075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37624168395996094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37058526277542114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2250102460384369},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19704535603523254},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2009.2012434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2009.2012434","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W648957760","https://openalex.org/W1871367359","https://openalex.org/W1969097955","https://openalex.org/W1977545325","https://openalex.org/W1994048062","https://openalex.org/W2010945917","https://openalex.org/W2011282943","https://openalex.org/W2036900823","https://openalex.org/W2052120747","https://openalex.org/W2053389894","https://openalex.org/W2089845007","https://openalex.org/W2101234060","https://openalex.org/W2112643276","https://openalex.org/W2124626211","https://openalex.org/W2131058166","https://openalex.org/W2170060541"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2360981904","https://openalex.org/W2198982833","https://openalex.org/W2375775343","https://openalex.org/W2366342492","https://openalex.org/W2388654557","https://openalex.org/W2030169809","https://openalex.org/W2161960576","https://openalex.org/W2347245430","https://openalex.org/W2562562750"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"a":[2,6,28,34,59,69,79,97],"real":[3],"project":[4],"for":[5,100],"sophisticated":[7],"automated":[8],"storage":[9],"and":[10,105,121],"retrieval":[11],"system":[12],"(AS/RS),":[13],"we":[14,95],"study":[15],"the":[16,40,50,55,84],"problem":[17,41,73],"of":[18,30,52],"generating":[19],"K":[20],"shortest":[21,71],"paths":[22],"that":[23,38,115],"are":[24],"required":[25],"to":[26,109],"satisfy":[27,78],"set":[29],"constraints.":[31],"We":[32],"propose":[33,96],"structural":[35],"branching":[36,93],"procedure":[37],"decomposes":[39],"into":[42,68],"at":[43],"most":[44],"K|N|":[45],"subproblems,":[46],"where":[47,103],"|N|":[48],"is":[49,118],"number":[51],"nodes":[53],"in":[54],"network.":[56],"By":[57],"using":[58],"Network":[60],"Modification":[61],"procedure,":[62,94],"each":[63],"subproblem":[64,85],"can":[65,86],"be":[66,87,110],"transformed":[67],"constrained":[70],"path":[72],"(CSP).":[74],"When":[75],"these":[76],"constraints":[77,107],"so":[80],"called":[81],"separable":[82],"property,":[83],"further":[88],"simplified.":[89],"Based":[90],"on":[91],"this":[92],"specific":[98],"algorithm":[99,117],"an":[101],"application":[102],"resource":[104],"loopless":[106],"have":[108],"respected.":[111],"Numerical":[112],"results":[113],"show":[114],"our":[116],"very":[119],"efficient":[120],"robust.":[122]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}