Search

Large-scale multiobjective optimization problems (LSMOPs) are challenging for existing approaches due to the complexity of objective functions and the massive volume of decision space. Some large-scale multiobjective evolutionary algorithms (LSMOEAs) have recently been proposed, which have shown their effectiveness in solving some benchmarks and real-world applications. They merely focus on handling the massive volume of decision space and ignore the complexity of LSMOPs in terms of objective functions. The complexity issue is also important since the complexity grows along with the increment in the number of decision variables. Our previous study proposed a framework to accelerate evolutionary large-scale multiobjective optimization via problem reformulation for handling large-scale decision variables. Here, we investigate the effectiveness of LSMOF combined with decomposition-based MOEA (MOEA/D), aiming to handle the complexity of LSMOPs in both the decision and objective spaces. Specifically, MOEA/D is embedded in LSMOF via two different strategies, and the proposed algorithm is tested on various benchmark LSMOPs. Experimental results indicate the encouraging performance improvement benefited from the solution of the complexity issue in large-scale multiobjective optimization.

Recently, Guti´errez-Naranjo and Leporati considered performing basic arithmetic operations on a new class of bioinspired computing devices -- spiking neural P systems (for short, SN P systems). However, the binary encoding mechanism used in their research looks like the encoding approach in electronic circuits, instead of the style of spiking neurons (in usual SN P systems, information are encoded as the time interval between spikes). In this work, three SN P systems are constructed as adder, subtracter and multiplier, respectively. In these devices, a number is inputted to the system as the interval of time elapsed between two spikes received by input neuron, the result of a computation is the time between the moments when the output neuron spikes.

Looking for small universal computing devices is a natural and well investigated topic in computer science. Recently, this topic started to be considered also in the framework of (synchronized) spiking neural P systems. In this work, it is focused on small universal spiking neural P systems working in a non-synchronized manner. Specifically, it is proved that there is an asynchronous spiking neural P system with 76 neurons that is equivalent to a universal register machine for computing functions. As generator of sets of numbers, a universal asynchronous spiking neural P system with 75 neurons is constructed.

In this paper, a new genetic algorithm for solving multi-constrained optimization problems based on KS function is proposed. Firstly, utilizing the agglomeration features of KS function, all constraints of optimization problems are agglomerated to only one constraint. Then, we use genetic algorithm to solve the optimization problem after the compression of constraints. Finally, the simulation results on benchmark functions show the efficiency of our algorithm.