Download presentation

Published byIrving Ewers Modified over 4 years ago

1
**CAPACITY CONSTRAINED NETWORK VORONOI DIAGRAM (CCNVD)**

Presented by: GROUP 7 Gayathri Gandhamuneni & Yumeng Wang

2
**AGENDA Synonyms Definition Historical Background**

Scientific Fundamentals Key Applications Future Direction & References

3
SYNONYMS CCNVD – None Voronoi Diagram - Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation

4
FORMAL DEFINITION Capacity Constrained Network Voronoi Diagram (CCNVD): Partitions graph into set of contiguous service areas that honor service center capacities and minimize the sum of distances from graph-nodes allotted service centers.

5
**SIGNIFICANCE & APPLICATIONS**

Critical Societal applications Examples: Assigning consumers to gas stations in the aftermath of a disaster Assigning evacuees to shelters Assigning patients to hospitals Assigning students to school districts CCNVD Finite Spaces Continuous Spaces References for CCNVD in Finite Spaces and Continuous Spaces – Not discussing due to time constraint

6
**PROBLEM STATEMENT Input: Objective: Constraints: Output:**

A transportation network G – (Nodes N, Edges E) Set of service centers Constraints on the service centers Real weights on the edges. Objective: Minimize the sum of distances from graph-nodes to their allotted service centers while satisfying the constraints of the network. Constraints: Nodes - Assumed to be contiguous The effective paths can be calculated (maximum coverage and shortest paths) Output: Capacity Constrained Network Voronoi Diagram (CCNVD)

7
**HISTORICAL BACKGROUND**

Voronoi Diagram: Way of dividing space into a number of regions A set of points (called seeds, sites, or generators) is specified beforehand For each seed, there will be a corresponding region consisting of all points closer to that seed than to any other Regions are called “Voronoi cells” One of the early applications of Voronoi diagrams was implemented by John Snow to study the 1854 Broad Street cholera outbreak in Soho, England. He showed the correlation between areas on the map of London using a particular water pump, and the areas with most deaths due to the outbreak.

8
RELATED WORK Minimizing sum of distances between graph nodes and their allotted service centers Honoring service center capacity constraints Service Area Contiguity Min-cost flow approaches CCNVD Network Voronoi Diagrams (NVD)

9
**RELATED WORK ILLUSTRATION WITH DIAGRAMS**

Every edge is associated with a distance (e.g., travel time), Every graph-node has unit demand. Every service center has a capacity to serve 5 graph units. NVD allots every graph-node to the nearest service center – No account for load balance, which may lead to congestion and delay at service centers Input NVD

10
**RELATED WORK ILLUSTRATION WITH DIAGRAMS**

Min-cost flow: minimizes the sum of distances from graph-nodes to their allotted service centers. Although it achieves its goal (min-sum), service areas for Y and Z violate SA contiguity. CCNVD: load is balanced, service areas are contiguous for all service centers. Min-Cost Flow without SA contiguity (min-sum=30)(Output) CCNVD (min-sum=30) (Output) – Pressure Equalizer Approach

11
**CHALLENGES Large size of the transportation network**

Uneven distribution - Service centers & Customers Constraint: Service areas must be contiguous in graph to simplify communication of allotments NP Hard

12
**FUTURE DIRECTION More factors of the problem into account**

Factors related to capacity of service centers, Example: Number and distance of neighboring nodes Service quality of the service center. Factors related to weight of each node Number of consumers The level of importance

13
REFERENCES [1] KwangSoo Yang, Apurv Hirsh Shekhar, Dev Oliver, Shashi Shekhar: Capacity-Constrained Network-Voronoi Diagram: A Summary of Results. SSTD 2013: [2] Advances in Spatial and Temporal Databases - 13th International Symposium, SSTD 2013 Munich, Germany, August 2013 Proceedings [3] [4] Ahuja, R., Magnanti, T., Orlin, J.: Network flows: theory, algorithms, and applications, Prentice Hall [5] Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research 15(3), 430–466 (1990) [6] Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Science 14(3), 205–220 (1967) [7] Erwig, M.: The graph voronoi diagram with applications. Networks 36(3), 156–163 (2000) [8] Okabe, A., Satoh, T., Furuta, T., Suzuki, A., Okano, K.: Generalized network voronoi diagrams: Concepts, computational methods, and applications. International Journal of Geographical Information Science 22(9), 965–994 (2008)

14
QUESTIONS?

15
THANK YOU

Similar presentations

OK

Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.

Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google