{"id":"https://openalex.org/W2573332426","doi":"https://doi.org/10.1109/indin.2016.7819269","title":"Vehicle route planning for logistics network optimization via multiple spanning tree","display_name":"Vehicle route planning for logistics network optimization via multiple spanning tree","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2573332426","doi":"https://doi.org/10.1109/indin.2016.7819269","mag":"2573332426"},"language":"en","primary_location":{"id":"doi:10.1109/indin.2016.7819269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/indin.2016.7819269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 14th International Conference on Industrial Informatics (INDIN)","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/A5061195038","display_name":"Mingbo Zhao","orcid":"https://orcid.org/0000-0003-0381-4360"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Mingbo Zhao","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong S. A. R"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong S. A. R","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050716572","display_name":"Tommy W. S. Chow","orcid":"https://orcid.org/0000-0001-7051-0434"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"T. W. S. Chow","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong S. A. R"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong S. A. R","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037894365","display_name":"Kim Fung Tsang","orcid":"https://orcid.org/0000-0002-8332-227X"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"K. F. Tsang","raw_affiliation_strings":["Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong S. A. R"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong S. A. R","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.2134153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2016","issue":null,"first_page":"800","last_page":"805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9970999956130981,"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.9970999956130981,"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.991599977016449,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9848999977111816,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6829131245613098},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6631989479064941},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.5824993848800659},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5791451930999756},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5001730918884277},{"id":"https://openalex.org/keywords/boundary-spanning","display_name":"Boundary spanning","score":0.4933868944644928},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4869300127029419},{"id":"https://openalex.org/keywords/supply-chain","display_name":"Supply chain","score":0.4153561592102051},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.41069328784942627},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3696352243423462},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3291394114494324},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17494070529937744},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.1110253632068634},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11065813899040222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09531056880950928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.08060026168823242}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6829131245613098},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6631989479064941},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.5824993848800659},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5791451930999756},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5001730918884277},{"id":"https://openalex.org/C196067599","wikidata":"https://www.wikidata.org/wiki/Q4949972","display_name":"Boundary spanning","level":2,"score":0.4933868944644928},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4869300127029419},{"id":"https://openalex.org/C108713360","wikidata":"https://www.wikidata.org/wiki/Q1824206","display_name":"Supply chain","level":2,"score":0.4153561592102051},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.41069328784942627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3696352243423462},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3291394114494324},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17494070529937744},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.1110253632068634},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11065813899040222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09531056880950928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.08060026168823242},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","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/C56739046","wikidata":"https://www.wikidata.org/wiki/Q192060","display_name":"Knowledge management","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/indin.2016.7819269","is_oa":false,"landing_page_url":"https://doi.org/10.1109/indin.2016.7819269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 14th International Conference on Industrial Informatics (INDIN)","raw_type":"proceedings-article"},{"id":"mag:2750415011","is_oa":false,"landing_page_url":"http://jglobal.jst.go.jp/en/public/20090422/201702223627873178","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1965631072","https://openalex.org/W2006791619","https://openalex.org/W2009872775","https://openalex.org/W2014756888","https://openalex.org/W2023543407","https://openalex.org/W2026116120","https://openalex.org/W2052275185","https://openalex.org/W2061984238","https://openalex.org/W2062927576","https://openalex.org/W2065350252","https://openalex.org/W2066492608","https://openalex.org/W2079227753","https://openalex.org/W2086653644","https://openalex.org/W2090286482","https://openalex.org/W2097049026","https://openalex.org/W2126934378"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"Logistics":[0],"network":[1,14,25],"optimization":[2],"plays":[3],"a":[4,50,83,91],"critical":[5],"role":[6],"in":[7,67,104,115],"contemporary":[8],"logistics":[9,24],"planning":[10,20],"and":[11,16,34,73],"supply":[12],"chain":[13],"designs,":[15],"the":[17,54,68,94,98,112,123,126],"vehicle":[18,38,102],"route":[19,39,103],"is":[21],"essential":[22],"for":[23,37],"optimizations.":[26],"In":[27,60],"this":[28],"paper,":[29],"we":[30,80,108],"present":[31],"an":[32],"efficient":[33],"effective":[35],"approach":[36,43],"planning.":[40],"The":[41],"new":[42],"has":[44,121],"utilized":[45],"multiple":[46],"spanning":[47,78,95],"trees":[48],"as":[49],"criterion":[51],"to":[52,76],"categorize":[53],"customers":[55,66],"into":[56],"several":[57],"sub":[58,71,106,117],"areas.":[59,118],"addition,":[61],"by":[62],"iterative":[63],"choose":[64],"some":[65],"boundary":[69],"of":[70,101,125],"areas":[72],"resign":[74],"them":[75],"different":[77],"trees,":[79],"can":[81,109],"get":[82],"more":[84],"compact":[85],"ones":[86],"with":[87],"smaller":[88],"distances.":[89],"As":[90],"result,":[92],"since":[93],"tree":[96],"represent":[97],"lower":[99],"bound":[100],"all":[105],"areas,":[107],"also":[110],"conduct":[111],"vehicular":[113],"dispatching":[114],"each":[116],"Extensive":[119],"simulation":[120],"verified":[122],"effectiveness":[124],"proposed":[127],"methods.":[128]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}