Prototype Generation Using Multiobjective Particle Swarm Optimization for Nearest Neighbor Classification

Inverse-Designed Ultra-Compact Passive Phase Shifters for High-Performance Beam Steering

Ultra-compact passive phase shifters are inversely designed by the multi-objective particle swarm optimization algorithm. The wavelength-dependent phase difference between two output beams originates from the different distances of the input light passing through the 4 μm × 3.2 μm rectangular waveguide with random-distributed air-hole arrays. As the wavelength changes from 1535 to 1565 nm, a phase difference tuning range of 6.26 rad and 6.95 rad is obtained for TE and TM modes, respectively. Compared with the array waveguide grating counterpart, the phase shifters exhibit higher transmission with a much smaller footprint. By combining the inverse-designed phase shifter and random-grating emitter together, integrated beam-steering structures are built, which show a large scanning range of ±25.47° and ±27.85° in the lateral direction for TE and TM mode, respectively. This work may pave the way for the development of ultra-compact high-performance optical phased array LiDARs.

An effective dynamic immune optimization control for the wastewater treatment process

To resolve the conflict between multiple performance indicators in the complicated wastewater treatment process (WWTP), an effective optimization control scheme based on a dynamic multi-objective immune system (DMOIA-OC) is designed. A dynamic optimization control scheme is first developed in which the control process is divided into a dynamic layer and a tracking control layer. Based on the analysis of the WWTP performance, the energy consumption and effluent quality models are next established adaptively in response to the environment by an optimization layer. An adaptive dynamic immune optimization algorithm is then proposed to optimize the complex and conflicting performance indicators. In addition, a suitable preferred solution is selected from the numerous Pareto solutions to obtain the best set of values for the dissolved oxygen and nitrate nitrogen. Finally, the solution is evaluated on the benchmark simulation platform (BSM1). The results show that the DMOIA-OC method can solve the complex optimization problem for multiple performance indicators in WWTPs and has a competitive advantage in its control effect.

Dynamic MOPSO-Based Optimal Control for Wastewater Treatment Process

To achieve excellent treatment performance of complex and time-varying characteristics, the operation of wastewater treatment process (WWTP) has been considered as a dynamic multiobjective control problem. In this paper, an optimal controller, based on a dynamic multiobjective particle swarm optimization (DMOPSO) algorithm, is developed to deal with the dynamic multiple conflicting criteria [i.e., effluent quality (EQ), operation cost, and operation stability]. The novelties and advantages of this proposed DMOPSO-based optimal controller (DMOPSO-OC) include the following two aspects. First, an integrated optimization framework, where the multiple objectives not only conflict with each other but also change over time, is able to catch more characteristics of WWTP than the existing works. Second, a DMOPSO algorithm, with an adaptive global best selection mechanism, is designed to solve the multiobjective optimization problem (MOP) for the proposed optimal controller, thus leading to a significant improvement of optimal synthesis for performance. Finally, the proposed DMOPSO-OC is tested in the benchmark simulation model No. 1 (BSM1) and implemented in a real WWTP to evaluate its effectiveness. The experimental results demonstrate that this proposed DMOPSO-OC can achieve a significant improvement in optimal control performance and obey the requirement of multiple conflicting criteria.

Ensemble Decision for Spam Detection Using Term Space Partition Approach

This paper proposes an ensemble decision approach which combines global and local features of e-mails together to detect spam effectively. In the proposed method, a special feature construction method named term space partition (TSP) is utilized to divide the whole term space into several subspaces and adopt different feature construction strategies on each of them, respectively. This method can make each term play a distinct and important role when conducting detection. This method is utilized and extended by introducing the sliding window technique to extract local features from e-mails. The global classifier and local classifiers are constructed on a global feature vector set and local feature vector sets, respectively, and together make the ensemble decision by adopting the voting technique. The principles of the TSP-based approach and mechanism of the ensemble decision method are presented in detail. Five different and standard benchmark corpora are applied to experiments for performance evaluation of this proposed method. Comprehensive experimental results show that the proposed method brings significant performance improvement and better robustness on the basis of the TSP-based approach. In addition, the proposed method outperforms the current prevalent and state-of-the-art approaches, especially when a comprehensive consideration of performance, efficiency, and robustness is taken. This endows it with flexible capability and adaptivity in the real-world applications.

Improving Metaheuristic Algorithms With Information Feedback Models

In most metaheuristic algorithms, the updating process fails to make use of information available from individuals in previous iterations. If this useful information could be exploited fully and used in the later optimization process, the quality of the succeeding solutions would be improved significantly. This paper presents our method for reusing the valuable information available from previous individuals to guide later search. In our approach, previous useful information was fed back to the updating process. We proposed six information feedback models. In these models, individuals from previous iterations were selected in either a fixed or random manner. Their useful information was incorporated into the updating process. Accordingly, an individual at the current iteration was updated based on the basic algorithm plus some selected previous individuals by using a simple fitness weighting method. By incorporating six different information feedback models into ten metaheuristic algorithms, this approach provided a number of variants of the basic algorithms. We demonstrated experimentally that the variants outperformed the basic algorithms significantly on 14 standard test functions and 10 CEC 2011 real world problems, thereby, establishing the value of the information feedback models.

Adaptive Gradient Multiobjective Particle Swarm Optimization

An adaptive gradient multiobjective particle swarm optimization (AGMOPSO) algorithm, based on a multiobjective gradient (stocktickerMOG) method and a self-adaptive flight parameters mechanism, is developed to improve the computation performance in this paper. In this AGMOPSO algorithm, the stocktickerMOG method is devised to update the archive to improve the convergence speed and the local exploitation in the evolutionary process. Meanwhile, the self-adaptive flight parameters mechanism, according to the diversity information of the particles, is then established to balance the convergence and diversity of AGMOPSO. Attributed to the stocktickerMOG method and the self-adaptive flight parameters mechanism, this AGMOPSO algorithm not only has faster convergence speed and higher accuracy, but also its solutions have better diversity. Additionally, the convergence is discussed to confirm the prerequisite of any successful application of AGMOPSO. Finally, with regard to the computation performance, the proposed AGMOPSO algorithm is compared with some other multiobjective particle swarm optimization algorithms and two state-of-the-art multiobjective algorithms. The results demonstrate that the proposed AGMOPSO algorithm can find better spread of solutions and have faster convergence to the true Pareto-optimal front.

An Adaptive Multiobjective Particle Swarm Optimization Based on Multiple Adaptive Methods

Multiobjective particle swarm optimization (MOPSO) algorithms have attracted much attention for their promising performance in solving multiobjective optimization problems (MOPs). In this paper, an adaptive MOPSO (AMOPSO) algorithm, based on a hybrid framework of the solution distribution entropy and population spacing (SP) information, is developed to improve the search performance in terms of convergent speed and precision. First, an adaptive global best (gBest) selection mechanism, based on the solution distribution entropy, is introduced to analyze the evolutionary tendency and balance the diversity and convergence of nondominated solutions in the archive. Second, an adaptive flight parameter adjustment mechanism, using the population SP information, is proposed to obtain the distribution of particles with suitable diversity and convergence, which can balance the global exploration and local exploitation abilities of the particles. Third, based on the gBest selection mechanism and the adaptive flight parameter mechanism, this proposed AMOPSO algorithm not only has high accuracy, but also attain a set of optimal solutions with better diversity. Finally, the performance of the proposed AMOPSO algorithm is validated and compared with other five state-of-the-art algorithms on a number of benchmark problems and water distribution system. The experimental results validate the effectiveness of the proposed AMOPSO algorithm, as well as demonstrate that AMOPSO outperforms other MOPSO algorithms in solving MOPs.