This article deals with social infrastructure planning problems in urban city. Each facility must serve minimum pre-specified level of demand. The objective is to minimize the distance traveled by users to reach the f...
详细信息
ISBN:
(纸本)9780769549637;9781467356534
This article deals with social infrastructure planning problems in urban city. Each facility must serve minimum pre-specified level of demand. The objective is to minimize the distance traveled by users to reach the facilities this means also to maximize the accessibility to facilities. A location model that captures the above features is formulated and different solution methods are tested. clustering in spatial data mining is to group similar objects based on their connectivity, distance, or their relative density in space. In real word, there exist many physical obstacles such as rivers, lakes, highways and mountains, and their presence may affect the result of clustering significantly. In this paper, we study the problem of clustering in the presence of obstacles to solve location of public service facility problem. In this paper, CSPOD-dbscanalgorithm (clustering with short path Obstructed Distance - Density-Based Spatial clustering of Applications with Noise) is developed in the spirit of dbscan clustering algorithms. This algorithm is Density-based clusteringalgorithm using Dijkstra algorithm to calculate obstructed short path distance. The application of this algorithm is illustrated through a case study involving the location of schools in the districts of Mecca in Saudi Arabia.
clustering in spatial data mining is to group similar objects based on their distance, connectivity, or their relative density in space. In real word, there exist many physical obstacles such as rivers, lakes, highway...
详细信息
ISBN:
(纸本)9789898425799
clustering in spatial data mining is to group similar objects based on their distance, connectivity, or their relative density in space. In real word, there exist many physical obstacles such as rivers, lakes, highways and mountains, and their presence may affect the result of clustering substantially. Today existing telephone networks nearing saturation and demand for wire and wireless services continuing to grow, telecommunication engineers are looking at technologies that will deliver sites and can satisfy the required demand and grade of service constraints while achieving minimum possible costs. In this paper, we study the problem of clustering in the presence of obstacles to solve network planning problem. In this paper, COD-dbscanalgorithm (clustering with Obstructed Distance-Density-Based Spatial clustering of Applications with Noise) is developed in the spirit of dbscan clustering algorithms. We studied also the problem determine the place of Multi Service Access Node (MSAN) due to the presence of obstacles in area complained of the existence of many mountains such as in Saudi Arabia. This algorithm is Density-based clusteringalgorithm using BSP-tree and Visibility Graph to calculate obstructed distance. Experimental results and analysis indicate that the COD-dbscanalgorithm is both efficient and effective.
With existing telephone networks nearing saturation and demand for wire and wireless services continuing to grow, telecommunication engineers are looking at technologies that will deliver sites and can satisfy the req...
详细信息
ISBN:
(纸本)9781424453849
With existing telephone networks nearing saturation and demand for wire and wireless services continuing to grow, telecommunication engineers are looking at technologies that will deliver sites and can satisfy the required demand and grade of service constraints while achieving minimum possible costs. The city data is given as a map of streets, intersection nodes coordinates, distribution of the subscribers' loads within the city and the location of base station in mobile network in this city. The available cable sizes, the cost per unit for each size and the maximum distance of wire that satisfied the allowed grade of service. Net Plan (Network Planning package) is developed in the spirit of dbscan and Agglomerative clusteringalgorithms. In this paper we studied the problem of congestion in Multi Service Access Node (MSAN) due to the increasing the number of subscribers which cause degradation in grade of service and in some time impossible to add new subscribers. The Net Plan algorithm is introduced to solve this problem. This algorithm is Density-based clusteringalgorithm using physical shortest paths available routes and the subscriber loads. In other hand decreasing the cost also is our deal in this paper so in the second phase in clustering process we modify the agglomerative algorithm that merge the neighboring cluster which satisfying certain condition. Experimental results and analysis indicate that the combination to algorithms was effective, leads to minimum costs for network construction and make the best grade of service.
暂无评论