Minimum Path Method Research Articles

Dynamic Optimal Configuration Method for Distribution Network Based on Multidimensional Reliability Improvement

The power supply company has invested a lot of money to enhance the reliability of the distribution network by improving the grid structure, increasing the level of distribution automation, and increasing the coverage of live operations. However, blind investment will cause a lot of waste of assets. In view of the current situation, this article firstly constructs a reliability calculation model based on the minimum path method, which considers the mutual influence of multiple methods. Then, from the perspective of the life cycle, a corresponding life cycle cost (LCC) model is established. Next, based on grid search, a multi-dimensional dynamic optimal configuration method of distribution network considering the full life cycle is presented. Finally, this paper takes a regional distribution network as an example, and verifies the validity of the model through simulation calculations. The research results can provide a theoretical basis for the investment of distribution network assets.

Management and evaluation system of sustainable development planning about green infrastructure

Green infrastructure is a network of interconnected natural areas and other open spaces. In the case of extremely limited urban space, how to effectively build an urban green infrastructure network and identify those network elements with critical landscape ecological functions is extremely important. In order to provide new modelling and analysis concepts for the construction and management of urban green infrastructure networks, taking the rapid urbanisation of Q city as an example, the MSPA method was used in conjunction with the landscape connectivity index to select the largest contribution to maintaining landscape connectivity. As the network centre of the green infrastructure network, the habitat patch of the site was used to construct the potential green infrastructure network. In the study, area using the minimum path method and the use of spatial syntax analysis to identify the priority of the green infrastructure network based on the structural optimisation perspective, to make the construction of green infrastructure networks more scientific. The research results can provide a research idea and method for the construction of green infrastructure networks in rapid urbanisation areas, and have certain reference significance for the priority evaluation of green infrastructure network elements.

Management and evaluation system of sustainable development planning about green infrastructure

Green infrastructure is a network of interconnected natural areas and other open spaces. In the case of extremely limited urban space, how to effectively build an urban green infrastructure network and identify those network elements with critical landscape ecological functions is extremely important. In order to provide new modelling and analysis concepts for the construction and management of urban green infrastructure networks, taking the rapid urbanisation of Q city as an example, the MSPA method was used in conjunction with the landscape connectivity index to select the largest contribution to maintaining landscape connectivity. As the network centre of the green infrastructure network, the habitat patch of the site was used to construct the potential green infrastructure network. In the study, area using the minimum path method and the use of spatial syntax analysis to identify the priority of the green infrastructure network based on the structural optimisation perspective, to make the construction of green infrastructure networks more scientific. The research results can provide a research idea and method for the construction of green infrastructure networks in rapid urbanisation areas, and have certain reference significance for the priority evaluation of green infrastructure network elements.

Research on the Optimization of Regional Green Infrastructure Network

With the rapid rate of urbanization, green infrastructure land is increasingly being converted to urban construction land, and the fragmentation of regional green infrastructure (GI) networks is intensifying. The connectivity of a GI network is of paramount importance for maintaining both regional biodiversity and regional ecosystem service capacity, among others. In this paper, an innovative approach to planning a GI network is presented. The proposed approach is based on the Morphological Spatial Pattern Analysis (MSPA) method, minimum path method, and circuit theory. Using the Zhengzhou–Kaifeng metropolitan area in China as a case study, we argue that the combination of the MSPA method and circuit theory can more fully and comprehensively identify the components of a GI network and its key areas. The methodology consists of three steps: (i) Identifying the cores and bridges of the GI by the MSPA method based on land use data, followed by determining the hubs of the GI network by assessing the connectivity of the core area; (ii) establishing potential connecting corridors between hubs by the minimum path method; (iii) identifying the “pinch point” area of the potential connecting corridors based on current density by applying circuit theory. This approach not only makes identification of the “hubs” and “links” in the green infrastructure network more scientific and comprehensive, but it also further identifies “pinch point” areas of the connecting corridors that require priority protection or recovery. The research results can be used as a practical reference for urban planners when planning urban land use.

最適航法の基礎研究-IV(日本航海学会第37回講演会)

There are three methods to solve the optimum routing problems ; graphical method, the method using kinematic equationa which consist of differential equations and minimum path method in the networks. However, if some nonlinear functions are used in the optimum routing problems, the author indicated minimum path method was the best way. In general, it will take enormous time if the method is used. According to his algorithm, it could obtain the solution of optimum routing problem within several minutes using high-speed computer.