Skip to main content
SpringerLink
Log in

Weighted Node Network Voronoi Diagram and its application to optimization of chain stores layout

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

A better layout which can make a system of chain stores more competitive is a precondition for finding new sites of stores. Layout optimizations based on Weighted Node Voronoi Diagrams which are effective tools to investigate dominance regions in a grid road system or in a radial-circular road model are important ways to configure a new store-site. The position of every store can be seen as a node in the road network, and weights of nodes are used to indicate reality factors relating to stores such as the scale and effectiveness. The nodes with weight values are considered as generators which can be different types of functions. Since each generator represents a set of varied weight values, it is difficult to exactly determine the optimal position and its corresponding influence range. This paper presents a new method of layout optimization based on Weighted Node Voronoi Diagrams, which is in accordance with the traditional discrete construction methodologies. It is demonstrated that algorithm proposed in this paper is superior to the similar traditional techniques because the algorithm does not require the structures or other additional information of nodes. Examples show the effectiveness of our methodology in optimization of chain store layout.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23

Similar content being viewed by others

References

  1. Chen S (1999) Urbanization and urban GIS [M]. Science Press, Beijing

    Google Scholar 

  2. Alliez P, Cohen-Steiner D, Devillers O, Lévy B, Desbrun M (2003) Anisotropic polygonal remeshing. ACM Trans Graph (TOG) [C] 22(3):485–493

    Article  Google Scholar 

  3. Okabe A, Boots B, Sugihara K (1994) Nearest neighborhood operations with generalized Voronoi Diagram [J]. Int J Geogr Inf Syst 8:43–71

    Article  Google Scholar 

  4. Boissonnat J-D, Oudot S (2006) Provably good sampling and meshing of Lipschitz surfaces. In: Proceedings of the twenty-second annual symposium on computational geometry [C], Sedona

  5. Tan Y, Zhao Y, Wang Y (2012) Power network Voronoi Diagram and dynamic construction [J]. J Netw 7(4):675–682

    Google Scholar 

  6. Edetsbrunner H (1995) Smooth surfaces for multiscale shape representation. In: Proceedings of the 15th conference on foundations of software technology and theoretical computer science, Bangalore, pp 391–412

  7. Bommes D, Zimmer H, Kobbelt L (2009) Mixed-integer quadrangulation. ACM Trans Graph (TOG) [C] 28(3):77-1–77-10

    Google Scholar 

  8. Yao Z, Hu B, Xie Y et al (2015) A review of structural and functional brain networks: small world and atlas [J]. Brain Inform 2(1):45–52

    Article  Google Scholar 

  9. Xuan K, Zhao G, Taniar D, Srinivasan B, Safar M, Gavrilova M (2009) Node Voronoi Diagram based range search. In: Proceedings of the 2009 international conference on advanced information nodeing and applications [C], pp 741–748

  10. Rosi GA, Walker AM, Rival DE (2015) Lagrangian coherent structure identification using a Voronoi tessellation-based networking algorithm [J]. Exp Fluids 56(10):1–14

    Article  Google Scholar 

  11. Chen Z, Shen HT, Zhou X, Zheng Y, Xie X (2010) Searching trajectories by locations: an efficiency study. In: Proceedings of the 2010 international conference on management of data [C], Indianapolis

  12. Qinghong Z, Ye Z (2012) Dynamic construction of network Voronoi diagram for lines. J Converg Inf Technol [C] 7(22):245–253

  13. Mozosa OM, Boleab JA, Ferrandezc JM, Ahneltd PK, Fernandez E (2010) V-proportion: a method based on the Voronoi diagram to study spatial relations in neuronal mosaics of the retina [C], pp 1165–1174

  14. Liu Y, Wang W, Lévy B, Sun F, Yan D-M, Lu L, Yang C (2009) On centroidal Voronoi tessellation—energy smoothness and fast computation. ACM Trans Graph (TOG) [C] 28(4):1–17

  15. Zhao Y, Zhang Y (2009) Dynamic construction of Voronoi diagram for figures. In: Proceeding 2009 IEEE 10th international conference on computer-aided industrial design and conceptual design: E-business, creative design, manufacturing-CAID & CD [C], pp 2189–2192

  16. Zhao Y, Liu S, Tan Y (2010) Discrete construction of order-k Voronoi diagram. In: Proceedings of the first international conference on information computing and applications (ICICA’10). Springer, Berlin

  17. Zhao Y, Zhang Y-J, Zhang Q-H (2010) Discrete construction of Voronoi diagrams for cross generators. In: 2010 international conference on machine learning and cybernetics, (ICMLC’10) [C], vol 3, pp 1556–1559

  18. Ran W, Zhao Y (2010) Discrete construction of node Voronoi diagram. In: ICMCI’10 [C], pp 630–632

  19. Prasad JR, Kulkarni U (2015) Gujrati character recognition using weighted k-NN and mean χ2 distance measure. Int J Mach Learn Cybern [J] 6:69–82

  20. Zhang L, Qiao L (2015) A graph optimization method for dimensionality reduction with pairwise constraints. Int J Mach Learn Cybern [J] 9:1–7

  21. Yang Y, Wang G, Yang Y (2014) Parameters optimization of polygonal fuzzy neural networks based on GA-BP hybrid algorithm. Int J Mach Learn Cybern [J] 5:815–822

Download references

Acknowledgments

This paper is supported by the National Natural Science Foundation of China (Grant Nos. 61300121, 51274144, 61170107,), by Natural Science Foundation of Hebei Province (Nos. A2014210140, A2013208175), by Training Program for Leading Talents of Innovation Teams in the Universities of Hebei Province (LJRC022), the Hebei Educational Committee Foundation (Z2013113).

Author information

Authors and Affiliations

  1. College of Electrical and Electronics Engineering, Shijiazhuang Tiedao University, Shijiazhuang, 050043, Hebei, China

    Jingna Liu & Xiaoyun Sun

  2. College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, 050016, Hebei, China

    Shujuan Liu

Authors
  1. Jingna Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoyun Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shujuan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoyun Sun.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, J., Sun, X. & Liu, S. Weighted Node Network Voronoi Diagram and its application to optimization of chain stores layout. Int. J. Mach. Learn. & Cyber. 7, 679–688 (2016). https://doi.org/10.1007/s13042-015-0491-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-015-0491-x

Keywords

Search

Navigation