{"id":"https://openalex.org/W7134990062","doi":"https://doi.org/10.1109/iiai-aai-winter69777.2025.00014","title":"A Greedy Algorithm for Priority-Based Vehicle Routing Problem","display_name":"A Greedy Algorithm for Priority-Based Vehicle Routing Problem","publication_year":2025,"publication_date":"2025-12-15","ids":{"openalex":"https://openalex.org/W7134990062","doi":"https://doi.org/10.1109/iiai-aai-winter69777.2025.00014"},"language":"en","primary_location":{"id":"doi:10.1109/iiai-aai-winter69777.2025.00014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iiai-aai-winter69777.2025.00014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 19th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI-Winter)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://uec.repo.nii.ac.jp/record/2001091/files/2431037.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128782722","display_name":"Yuchao Guo","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuchao Guo","raw_affiliation_strings":["The University of Electro-Communications,Graduate School of Informatics and Engineering,Dept. of Computer and Network Engineering,Chofu, Tokyo,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Electro-Communications,Graduate School of Informatics and Engineering,Dept. of Computer and Network Engineering,Chofu, Tokyo,Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113934718","display_name":"Masakazu Muramatsu","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masakazu Muramatsu","raw_affiliation_strings":["The University of Electro-Communications,Graduate School of Informatics and Engineering,Dept. of Computer and Network Engineering,Chofu, Tokyo,Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Electro-Communications,Graduate School of Informatics and Engineering,Dept. of Computer and Network Engineering,Chofu, Tokyo,Japan","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68735457,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.6761000156402588,"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.6761000156402588,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.08209999650716782,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.01889999955892563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.5480999946594238},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4169999957084656},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.37630000710487366},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.3612000048160553},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.2711000144481659}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5820000171661377},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5480999946594238},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4169999957084656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41370001435279846},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36309999227523804},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.3612000048160553},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.27469998598098755},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.26249998807907104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2558000087738037},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iiai-aai-winter69777.2025.00014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iiai-aai-winter69777.2025.00014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 19th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI-Winter)","raw_type":"proceedings-article"},{"id":"pmh:oai:irdb.nii.ac.jp:00931:0007385262","is_oa":true,"landing_page_url":"https://uec.repo.nii.ac.jp/records/2001091","pdf_url":"https://uec.repo.nii.ac.jp/record/2001091/files/2431037.pdf","source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"master thesis"}],"best_oa_location":{"id":"pmh:oai:irdb.nii.ac.jp:00931:0007385262","is_oa":true,"landing_page_url":"https://uec.repo.nii.ac.jp/records/2001091","pdf_url":"https://uec.repo.nii.ac.jp/record/2001091/files/2431037.pdf","source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"master thesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7134990062.pdf","grobid_xml":"https://content.openalex.org/works/W7134990062.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1510850782","https://openalex.org/W1601649239","https://openalex.org/W2059810217","https://openalex.org/W2921047495","https://openalex.org/W4404820955"],"related_works":[],"abstract_inverted_index":{"This":[0],"study":[1],"addresses":[2],"a":[3,29,37,57],"variant":[4],"of":[5,48],"the":[6,15,19],"Vehicle":[7],"Routing":[8],"Problem":[9],"(VRP)":[10],"with":[11],"customer":[12],"priorities.":[13],"In":[14],"variant,":[16],"we":[17,55],"assume":[18],"hard":[20],"priority":[21],"constraint":[22],"where":[23],"customers":[24],"should":[25],"be":[26],"served":[27],"in":[28],"predefined":[30],"order.":[31],"We":[32,42],"formulate":[33],"this":[34],"problem":[35],"into":[36],"mixed":[38],"integer":[39],"programming":[40],"problem.":[41],"then":[43],"prove":[44],"some":[45],"fundamental":[46],"properties":[47],"optimal":[49],"solutions.":[50],"Based":[51],"on":[52],"these":[53],"properties,":[54],"propose":[56],"novel":[58],"greedy":[59,66],"algorithm.":[60],"Numerical":[61],"experiments":[62],"show":[63],"that":[64],"our":[65],"algorithm":[67],"gives":[68],"reasonably":[69],"good":[70],"solutions,":[71],"while":[72],"its":[73],"running":[74],"time":[75],"is":[76],"almost":[77],"negligible.":[78]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-12T00:00:00"}