{'fraction_non_alphanumeric': 0.0247074122236671, 'fraction_numerical': 0.0, 'mean_word_length': 5.963800904977376, '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}}
An efficient two‐stage method for optimal sensor placement using graph‐theoretical partitioning and evolutionary algorithms

This paper presents a two‐stage optimal sensor placement method for modal identification of structures. At the first stage, using a graph theoretical technique, the structure is partitioned into equal substructures. At the second stage, a preset number of triaxial sensors are proportionately allocated to the substructures. The location of sensors is determined using an evolutionary optimization algorithm, which optimizes the triaxial modal assurance criterion of the structure. The first stage leads to the even distribution of the sensors. This stage not only improves the mode shape visualization as the secondary criterion but also accelerates the optimization process by space reduction. Here, various graph‐theoretical methods including k‐means, k‐means++, and spectral partitioning are examined as the partitioning techniques. In addition, a dynamic version for quantum‐inspired evolutionary optimization algorithm (DQEA) is proposed and applied to find the placement of triaxial sensors, along with the standard version of quantum‐inspired evolutionary algorithm and genetic algorithm. In order to examine the efficiency of the methods, the bridge model of the University of Central Florida, USA, is considered as the benchmark structure. The results show that the proposed method efficiently satisfies both criteria. Moreover, the introduced optimization algorithm (DQEA) outperforms other algorithms.