{"id":"https://openalex.org/W4392248358","doi":"https://doi.org/10.1109/icce59016.2024.10444239","title":"FPGA Implementation of Minimum Spanning Tree Calculation Towards Application for Capacitated Vehicle Routing Problems","display_name":"FPGA Implementation of Minimum Spanning Tree Calculation Towards Application for Capacitated Vehicle Routing Problems","publication_year":2024,"publication_date":"2024-01-06","ids":{"openalex":"https://openalex.org/W4392248358","doi":"https://doi.org/10.1109/icce59016.2024.10444239"},"language":"en","primary_location":{"id":"doi:10.1109/icce59016.2024.10444239","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icce59016.2024.10444239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Consumer Electronics (ICCE)","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/A5047158702","display_name":"J.H. Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Jiheng Wang","raw_affiliation_strings":["University of Tsukuba,Japan","University of Tsukuba, Japan"],"affiliations":[{"raw_affiliation_string":"University of Tsukuba,Japan","institution_ids":["https://openalex.org/I146399215"]},{"raw_affiliation_string":"University of Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061513481","display_name":"Kenji Kanazawa","orcid":"https://orcid.org/0000-0001-8028-6392"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kenji Kanazawa","raw_affiliation_strings":["University of Tsukuba,Japan","University of Tsukuba, Japan"],"affiliations":[{"raw_affiliation_string":"University of Tsukuba,Japan","institution_ids":["https://openalex.org/I146399215"]},{"raw_affiliation_string":"University of Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103470416","display_name":"Moritoshi Yasunaga","orcid":null},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Moritoshi Yasunaga","raw_affiliation_strings":["University of Tsukuba,Japan","University of Tsukuba, Japan"],"affiliations":[{"raw_affiliation_string":"University of Tsukuba,Japan","institution_ids":["https://openalex.org/I146399215"]},{"raw_affiliation_string":"University of Tsukuba, Japan","institution_ids":["https://openalex.org/I146399215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047158702"],"corresponding_institution_ids":["https://openalex.org/I146399215"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02796935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"1","last_page":"3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9969000220298767,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9968000054359436,"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/computer-science","display_name":"Computer science","score":0.7656503319740295},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7415948510169983},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.7031166553497314},{"id":"https://openalex.org/keywords/field-programmable-gate-array","display_name":"Field-programmable gate array","score":0.6993089914321899},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6783373355865479},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.532655656337738},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4657491147518158},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.44973695278167725},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4146963059902191},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3329550623893738},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.2940084934234619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2033400535583496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13498252630233765}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7656503319740295},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7415948510169983},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7031166553497314},{"id":"https://openalex.org/C42935608","wikidata":"https://www.wikidata.org/wiki/Q190411","display_name":"Field-programmable gate array","level":2,"score":0.6993089914321899},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6783373355865479},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.532655656337738},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4657491147518158},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.44973695278167725},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4146963059902191},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3329550623893738},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.2940084934234619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2033400535583496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13498252630233765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icce59016.2024.10444239","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icce59016.2024.10444239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Consumer Electronics (ICCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W173577600","https://openalex.org/W1596059437","https://openalex.org/W1995274002","https://openalex.org/W2017927472","https://openalex.org/W2111581650","https://openalex.org/W2117226423","https://openalex.org/W2508029414"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"Finding":[0],"minimum":[1],"spanning":[2],"tree":[3],"(MST)":[4],"occurs":[5],"in":[6,12,15],"many":[7],"practical":[8],"applications,":[9],"which":[10],"is":[11,29,36],"particular":[13],"essential":[14],"solving":[16],"the":[17,51,58,78,86,121],"travelling":[18],"salesman":[19],"problems":[20],"(TSP)":[21],"efficiently.":[22],"The":[23],"capacitated":[24],"vehicle":[25],"routing":[26],"problem":[27],"(CVRP)":[28],"an":[30],"application":[31],"of":[32,60,81,85,97],"TSP,":[33],"whose":[34],"objective":[35],"to":[37,76,119],"visit":[38],"all":[39],"customers":[40],"for":[41,123],"delivering":[42],"items":[43],"using":[44,104,109],"multiple":[45],"vehicles":[46,87],"with":[47],"limited":[48],"capacity":[49,59],"minimizing":[50],"total":[52],"distance":[53],"travelled":[54],"while":[55],"not":[56],"exceeding":[57],"each":[61],"vehicle.":[62],"Solving":[63],"large-scale":[64],"CVRP":[65,72,114],"involves":[66],"finding":[67],"numerous":[68],"small-scale":[69],"MSTs":[70],"because":[71],"can":[73],"be":[74],"reduced":[75],"as":[77,83],"same":[79],"number":[80],"TSPs":[82],"that":[84],"used.":[88],"In":[89],"this":[90],"paper,":[91],"we":[92],"demonstrate":[93],"a":[94],"parallel":[95],"implementation":[96,122],"calculating":[98],"MST":[99],"based":[100],"on":[101],"Prim\u2019s":[102],"algorithm":[103],"FPGA,":[105],"evaluate":[106],"its":[107],"performance":[108,125],"TSP":[110],"suites":[111],"generated":[112],"from":[113],"instances,":[115],"and":[116],"discuss":[117],"how":[118],"improve":[120],"further":[124],"gain.":[126]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}