{'fraction_non_alphanumeric': 0.02669902912621359, 'fraction_numerical': 0.0016181229773462784, 'mean_word_length': 5.185, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Charging Pile Siting with Group Multirole Assignment

Oil resources are becoming increasingly scarce. Pure electric vehicles have huge advantages, in terms of energy efficiency and emission reduction. In cities, the locations of required charging stations and the number of required charging piles are determined according to the traffic flow on a road. Unreasonable allocation not only creates safety problems due to high electrical loads, but also increases the cost of the placements. Such allocations will involve the many-to-many (M2M) assignment in the process, which is necessary to establish an optimal model for distributing. Thus, this paper formalizes the charging pile siting problem (CPSP) via the group multirole assignment (GMRA) model, which is one of the most important methods to deal with the M2M problem. Based on GMRA, this paper proposes a role negotiation method by using a spectral clustering K-Means++ Algorithm based on location. The formalization of GMRA makes it easy to find a solution using the IBM ILOG CPLEX optimization package (CPLEX) via the Integer Programming (IP). All the proposed approaches are verified by simulation experiments, which have been proved to be efficient, feasible and practicable.