Electric Bus Charging Station’s Location and Capacity Based on Routes and Grid AP Clustering Algorithm

Author(s):  
Yanhong FAN ◽  
Chunhui HE ◽  
Danxiong FEI ◽  
Jiu GU ◽  
Da XIE
2021 ◽  
Vol 13 (16) ◽  
pp. 8957
Author(s):  
Yajun Zhang ◽  
Jie Deng ◽  
Kangkang Zhu ◽  
Yongqiang Tao ◽  
Xiaolin Liu ◽  
...  

With the escalating contradiction between the growing demand for electric buses and limited supporting resources of cities to deploy electric charging infrastructure, it is a great challenge for decision-makers to synthetically plan the location and decide on the expansion sequence of electric charging stations. In light of the location decisions of electric charging stations having long-term impacts on the deployment of electric buses and the layout of city traffic networks, a comprehensive framework for planning the locations and deciding on the expansion of electric bus charging stations should be developed simultaneously. In practice, construction or renovation of a new charging station is limited by various factors, such as land resources, capital investment, and power grid load. Thus, it is necessary to develop an evaluation structure that combines these factors to provide integrated decision support for the location of bus charging stations. Under this background, this paper develops a gridded affinity propagation (AP) clustering algorithm that combines the superiorities of the AP clustering algorithm and the map gridding rule to find the optimal candidate locations for electric bus charging stations by considering multiple impacting factors such as land cost, traffic conditions, and so on. Based on the location results of the candidate stations, the expansion sequence of these candidate stations is proposed. In particular, a sequential expansion rule for planning the charging stations is proposed that considers the development trends of the charging demand. To verify the performance of the gridded AP clustering and the effectiveness of the proposed sequential expansion rule, an empirical investigation of Guiyang City, the capital of Guizhou province in China, is conducted. The results of the empirical investigation demonstrate that the proposed framework that helps find optimal locations for electric bus charging stations and the expansion sequence of these locations are decided with less capital investment pressure. This research shows that the combination of gridded AP clustering and the proposed sequential expansion rule can systematically solve the problem of finding the optimal locations and deciding on the best expansion sequence for electric bus charging stations, which denotes that the proposed structure is pretty pragmatic and would benefit the government for long-term investment in electric bus station deployment.


2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Tianjin Zhang ◽  
Zongrui Yi ◽  
Jinta Zheng ◽  
Dong C. Liu ◽  
Wai-Mai Pang ◽  
...  

The two-dimensional transfer functions (TFs) designed based on intensity-gradient magnitude (IGM) histogram are effective tools for the visualization and exploration of 3D volume data. However, traditional design methods usually depend on multiple times of trial-and-error. We propose a novel method for the automatic generation of transfer functions by performing the affinity propagation (AP) clustering algorithm on the IGM histogram. Compared with previous clustering algorithms that were employed in volume visualization, the AP clustering algorithm has much faster convergence speed and can achieve more accurate clustering results. In order to obtain meaningful clustering results, we introduce two similarity measurements: IGM similarity and spatial similarity. These two similarity measurements can effectively bring the voxels of the same tissue together and differentiate the voxels of different tissues so that the generated TFs can assign different optical properties to different tissues. Before performing the clustering algorithm on the IGM histogram, we propose to remove noisy voxels based on the spatial information of voxels. Our method does not require users to input the number of clusters, and the classification and visualization process is automatic and efficient. Experiments on various datasets demonstrate the effectiveness of the proposed method.


2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Cheng Lu ◽  
Shiji Song ◽  
Cheng Wu

The Affinity Propagation (AP) algorithm is an effective algorithm for clustering analysis, but it can not be directly applicable to the case of incomplete data. In view of the prevalence of missing data and the uncertainty of missing attributes, we put forward a modified AP clustering algorithm based onK-nearest neighbor intervals (KNNI) for incomplete data. Based on an Improved Partial Data Strategy, the proposed algorithm estimates the KNNI representation of missing attributes by using the attribute distribution information of the available data. The similarity function can be changed by dealing with the interval data. Then the improved AP algorithm can be applicable to the case of incomplete data. Experiments on several UCI datasets show that the proposed algorithm achieves impressive clustering results.


2017 ◽  
Vol 17 (04) ◽  
pp. 1750024 ◽  
Author(s):  
Qianwen Li ◽  
Zhihua Wei ◽  
Cairong Zhao

Region of interest (ROI) is the most important part of an image that expresses the effective content of the image. Extracting regions of interest from images accurately and efficiently can reduce computational complexity and is essential for image analysis and understanding. In order to achieve the automatic extraction of regions of interest and obtain more accurate regions of interest, this paper proposes Optimized Automatic Seeded Region Growing (OASRG) algorithm. The algorithm uses the affinity propagation (AP) clustering algorithm to extract the seeds automatically, and optimizes the traditional region growing algorithm by regrowing strategy to obtain the regions of interest where target objects are contained. Experimental results show that our algorithm can automatically locate seeds and produce results as good as traditional region growing with seeds selected manually. Furthermore, the precision is improved and the extraction effect is better after the optimization with regrowing strategy.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Fei Zhang ◽  
Liecheng Jia ◽  
Weizhen Han

The industrial product-service system (iPSS) is a kind of system engineering methodology, integration scheme, and business model to realize service value by adding intangible services in the whole life cycle. However, the design of the system involves many difficulties such as uncertain customer demands, strong subjectivity of the experience design, and long debugging times. Methods for solving upper problems are therefore essential. This paper presents a design model that integrates an improved affinity propagation (AP) clustering algorithm, quality function development (QFD), and axiomatic design (AD). The entire process of designing an iPSS can be split into three steps. First, uncertain customer demands is determined and standardized. Second, the functions of the product-service system are investigated. Finally, the structures of the system are determined. This paper examines the example of the control service of an iPSS for a water heater tank capping press. An improved AP clustering algorithm is used to determine standardized customer demands, the proposed QFD, and an AD integration model to initially establish a mapping between the customer demands domain and the function domain and clarify the design focus. Next, a QFD- and AD-integrated model is constructed to establish a mapping between the function domain and the structure domain and optimize the control scheme through the quality of its risk prediction. Finally the paper verifies that the upper process and methods can guide the design process effectively in production applications.


Sign in / Sign up

Export Citation Format

Share Document