Decomposition-based multi-objective evolutionary algorithms provide a good framework for static multi-objective optimization. Nevertheless, there are few studies on their use in dynamic optimization. To solve dynamic multi-objective optimization problems, this paper integrates the framework into dynamic multi-objective optimization and proposes a memory-enhanced dynamic multi-objective evolutionary algorithm based on $L_p$ decomposition (denoted by dMOEA/D- $L_p$ ). Specifically, dMOEA/D- $L_p$ decomposes a dynamic multi-objective optimization problem into a number of dynamic scalar optimization subproblems and coevolves them simultaneously, where the $L_p$ decomposition method is adopted for decomposition. Meanwhile, a subproblem-based bunchy memory scheme that stores good solutions from old environments and reuses them as necessary is designed to respond to environmental change. Experimental results verify the effectiveness of the $L_p$ decomposition method in dynamic multi-objective optimization. Moreover, the proposed dMOEA/D- $L_p$ achieves better performance than other popular memory-enhanced dynamic multi-objective optimization algorithms.

Synthesis of phase-only reconfigurable array aims at finding a common amplitude distribution and different phase distributions for the array to form different patterns. In this paper, the synthesis problem is formulated as a multiobjective optimization problem and solved by a new proposed algorithm MOEA/D-IWO. First, novel strategies are introduced in invasive weed optimization (IWO) to make original IWO fit for solving multiobjective optimization problems; then, the modified IWO is integrated into the framework of the recently well proved competitive multiobjective optimization algorithm MOEA/D to form a new competitive MOEA/D-IWO algorithm. At last, two sets of experiments are carried out to illustrate the effectiveness of MOEA/D-IWO. In addition, MOEA/D-IWO is compared with MOEA/D-DE, a new version of MOEA/D. The comparing results show the superiority of MOEA/D-IWO and indicate its potential for solving the antenna array synthesis problems.

Deep learning, such as convolutional neural networks, has been achieved great success in image processing, computer vision task, and image compression, and has achieved better performance. This paper designs a multiple description coding frameworks based on symmetric convolutional auto-encoder, which can achieve high-quality image reconstruction. First, the image is input into the convolutional auto-encoder, and the extracted features are obtained. Then, the extracted features are encoded by the multiple description coding and split into two descriptions for transmission to the decoder. We can get the side information by the side decoder and the central information by the central decoder. Finally, the side information and the central information are deconvolved by convolutional auto-encoder. The experimental results validate that the proposed scheme outperforms the state-of-the-art methods.