{"id":"https://openalex.org/W2784045338","doi":"https://doi.org/10.1109/icdim.2017.8244657","title":"Shortest path deliveries using density-based clustering","display_name":"Shortest path deliveries using density-based clustering","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2784045338","doi":"https://doi.org/10.1109/icdim.2017.8244657","mag":"2784045338"},"language":"en","primary_location":{"id":"doi:10.1109/icdim.2017.8244657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2017.8244657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","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/A5101156710","display_name":"Lixin Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I169335092","display_name":"University of North Carolina at Greensboro","ror":"https://ror.org/04fnxsj42","country_code":"US","type":"education","lineage":["https://openalex.org/I169335092"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lixin Fu","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Greensboro, USA, NC"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Greensboro, USA, NC","institution_ids":["https://openalex.org/I169335092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101156710"],"corresponding_institution_ids":["https://openalex.org/I169335092"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28176291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"180","issue":null,"first_page":"21","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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.9990000128746033,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9930999875068665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6994715929031372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6934406757354736},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6895967721939087},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6417737007141113},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5779353380203247},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5410264134407043},{"id":"https://openalex.org/keywords/destinations","display_name":"Destinations","score":0.5202676057815552},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5109919309616089},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43224242329597473},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42656630277633667},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.41094720363616943},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33671796321868896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2188158929347992},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16918325424194336},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15660545229911804},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.15631240606307983},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.133447527885437},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.12735265493392944},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09376475214958191},{"id":"https://openalex.org/keywords/tourism","display_name":"Tourism","score":0.06732320785522461}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6994715929031372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6934406757354736},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6895967721939087},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6417737007141113},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5779353380203247},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5410264134407043},{"id":"https://openalex.org/C2776687071","wikidata":"https://www.wikidata.org/wiki/Q5265193","display_name":"Destinations","level":3,"score":0.5202676057815552},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5109919309616089},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43224242329597473},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42656630277633667},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.41094720363616943},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33671796321868896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2188158929347992},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16918325424194336},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15660545229911804},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.15631240606307983},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.133447527885437},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.12735265493392944},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09376475214958191},{"id":"https://openalex.org/C18918823","wikidata":"https://www.wikidata.org/wiki/Q49389","display_name":"Tourism","level":2,"score":0.06732320785522461},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdim.2017.8244657","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdim.2017.8244657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W626292722","https://openalex.org/W1973415219","https://openalex.org/W1998191041","https://openalex.org/W2029681015","https://openalex.org/W2033320243","https://openalex.org/W2054083850","https://openalex.org/W2073588680","https://openalex.org/W2106378689","https://openalex.org/W2117226423","https://openalex.org/W2143704018","https://openalex.org/W2240814884","https://openalex.org/W2295788176","https://openalex.org/W2401610261","https://openalex.org/W2573853602","https://openalex.org/W6677426919"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215","https://openalex.org/W2102269193","https://openalex.org/W2776102956"],"abstract_inverted_index":{"In":[0,39],"e-commerce":[1],"customers":[2],"put":[3],"orders":[4],"online":[5],"and":[6,70,88,114],"goods":[7,27],"are":[8],"delivered":[9],"to":[10,20,28,63],"their":[11],"destinations.":[12],"The":[13],"shortest":[14],"path":[15],"deliveries":[16],"problem":[17],"(SPD)":[18],"is":[19,37,103],"compute":[21],"a":[22,44,61,116],"schedule":[23],"for":[24,53],"delivering":[25],"the":[26,30,34,65,68,73,80,86,90,100,107],"all":[29],"destinations":[31,69],"so":[32],"that":[33,99],"total":[35],"distance":[36,118],"minimal.":[38],"this":[40],"paper":[41],"we":[42,59,84],"developed":[43],"new":[45,101],"efficient":[46],"delivery":[47],"algorithm":[48,102,113],"called":[49],"DenCluSPD":[50],"(Density-based":[51],"Clustering":[52],"Shortest":[54],"Path":[55],"Deliveries).":[56],"More":[57],"specifically,":[58],"form":[60],"grid":[62],"hold":[64],"locations":[66],"of":[67,75],"then":[71],"create":[72],"clusters":[74,82],"various":[76],"densities.":[77],"By":[78],"visiting":[79],"densest":[81],"first":[83,111],"speedup":[85],"performance":[87],"achieve":[89],"approximately":[91],"optimal":[92],"schedule.":[93],"Our":[94],"comprehensive":[95],"experimentation":[96],"results":[97],"show":[98],"indeed":[104],"faster":[105],"than":[106],"popular":[108],"nearest":[109],"neighbor":[110],"(NNF)":[112],"covers":[115],"shorter":[117],"per":[119],"destination":[120],"initially.":[121]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}