2026-09-22T21:02:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13046 2026-09-05T07:44:20Z ddc:004 open_access

Multiple Resource Network Voronoi Diagram Qutbuddin, Ahmad Yang, KwangSoo Network Voronoi Diagram Resource Allocation Route Optimization Given a spatial network and a set of service center nodes from k different resource types, a Multiple Resource-Network Voronoi Diagram (MRNVD) partitions the spatial network into a set of Service Areas that can minimize the total cycle distances of graph-nodes to allotted k service center nodes with different resource types. The MRNVD problem is important for critical societal applications such as assigning essential survival supplies (e.g., food, water, gas, and medical assistance) to residents impacted by man-made or natural disasters. The MRNVD problem is NP-hard; it is computationally challenging due to the large size of the transportation network. Previous work is limited to a single or two different types of service centers, but cannot be generalized to deal with k different resource types. We propose a novel approach for MRNVD that can efficiently identify the best routes to obtain the k different resources. Experiments and a case study using real-world datasets demonstrate that the proposed approach creates MRNVD and significantly reduces the computational cost. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ahmad Qutbuddin and KwangSoo Yang 2020 Is Part Of LIPIcs, Volume 177, 11th International Conference on Geographic Information Science (GIScience 2021) - Part I (2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.GIScience.2021.I.11 urn:nbn:de:0030-drops-130463 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.I.11 eng https://creativecommons.org/licenses/by/3.0/legalcode