{"id":"https://openalex.org/W2018526027","doi":"https://doi.org/10.1145/1066677.1066772","title":"The shortest route cut and fill problem in linear topological structure","display_name":"The shortest route cut and fill problem in linear topological structure","publication_year":2005,"publication_date":"2005-03-13","ids":{"openalex":"https://openalex.org/W2018526027","doi":"https://doi.org/10.1145/1066677.1066772","mag":"2018526027"},"language":"en","primary_location":{"id":"doi:10.1145/1066677.1066772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","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/A5030328330","display_name":"Songshan","orcid":null},"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":"Songshan","raw_affiliation_strings":["Sun Yat-sen (Zhongshan) University, Guangzhou, China","Sun Yat-sen (Zhongshan) University, Guangzhou, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sun Yat-sen (Zhongshan) University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"Sun Yat-sen (Zhongshan) University, Guangzhou, China#TAB#","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007406426","display_name":"Guo Weixing Li","orcid":null},"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":"Guo Weixing Li","raw_affiliation_strings":["Sun Yat-sen (Zhongshan) University, Guangzhou, China","Sun Yat-sen (Zhongshan) University, Guangzhou, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sun Yat-sen (Zhongshan) University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"Sun Yat-sen (Zhongshan) University, Guangzhou, China#TAB#","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102741528","display_name":"Andrew Lim","orcid":"https://orcid.org/0000-0003-0510-8080"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Andrew Lim","raw_affiliation_strings":["The Hong Kong University of Science and Technology, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019759501","display_name":"Fan Wang","orcid":"https://orcid.org/0000-0003-3273-0203"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Fan Wang","raw_affiliation_strings":["The Hong Kong University of Science and Technology, Kowloon, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"409","last_page":"410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9939000010490417,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9919000267982483,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.5898112058639526},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5692073106765747},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5516560673713684},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5242761969566345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4946131408214569},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4607475996017456},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.44251155853271484},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.440125435590744},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4119041860103607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3741408586502075},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3189900517463684},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22845995426177979},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16628223657608032},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07583171129226685}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5898112058639526},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5692073106765747},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5516560673713684},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5242761969566345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4946131408214569},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4607475996017456},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.44251155853271484},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.440125435590744},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4119041860103607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3741408586502075},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3189900517463684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22845995426177979},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16628223657608032},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07583171129226685},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1066677.1066772","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066677.1066772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2005 ACM symposium on Applied computing","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":1,"referenced_works":["https://openalex.org/W1969606507"],"related_works":["https://openalex.org/W2807251790","https://openalex.org/W2799406489","https://openalex.org/W3118505512","https://openalex.org/W2049792449","https://openalex.org/W2349797546","https://openalex.org/W191849398","https://openalex.org/W986251431","https://openalex.org/W2359578922","https://openalex.org/W563727013","https://openalex.org/W2107423006"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,36,40,48,64,79,86],"Shortest":[6],"Route":[7],"Cut":[8],"and":[9,24,31,46,51],"Fill":[10],"(SRCF)":[11],"problem":[12,50],"where":[13],"a":[14,53,70],"fleet":[15,41],"of":[16,39,56,88],"vehicles":[17],"with":[18,60],"fixed":[19],"capacities":[20],"travel":[21,37],"between":[22],"cut":[23,30],"fill":[25,32],"points":[26],"to":[27,77],"finish":[28],"all":[29],"requirements":[33],"so":[34],"that":[35],"time":[38,83,95],"is":[42,75],"minimized.":[43],"We":[44],"state":[45],"classify":[47],"SRCF":[49,80],"present":[52],"complete":[54],"view":[55],"its":[57],"computational":[58],"complexities":[59],"NP-hardness":[61],"proof":[62],"for":[63,85],"basic":[65],"linear":[66,82,92],"topological":[67],"structure.":[68],"Moreover,":[69],"simple":[71],"cycle-based":[72],"optimization":[73],"method":[74],"proposed":[76],"solve":[78],"in":[81,91],"complexity,":[84],"version":[87],"single":[89],"vehicle":[90],"structure":[93],"without":[94],"window":[96],"constraint.":[97]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}