The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditional differential evolution (DE) algorithm has a tendency to suffer from premature convergence. In this paper, we proposed an improved DE based on dynamic mutation operator and opposition learning strategy. These mechanisms can expand the search area and is helpful to balance exploration and exploitation of DE. Numerical experiments demonstrate that our algorithm is effective.
We have developed an iterative method for solving absolute value equation Ax–|x| = b, where A ∈ Rn×n x ∈ Rn and b ∈ Rn. The convergence of the proposed method is argued. Some examples are given to illustrate the implementation and efficiency of the method.
In communication networks, the multi-constraint multicast communication is an important way to improve the efficiency of network operation and quality of service. Some heuristic algorithms are applied in solving multicast routing problem under multiple constraints, such as simulated annealing, genetic algorithm, ant colony algorithm and particle swarm optimization algorithm. However, these algorithms...
In this paper, a hybrid descent method, consisting of a genetic algorithm and the filled function method, is proposed. The genetic algorithm is used to locate descent points for previously converged local minima. The combined method has the decent property and the convergence is monotonic. To demonstrate the effectiveness of the proposed hybrid method, several multi-dimensional or non-convex optimization...
The suppression of fixed interference for uniform circular array using an improved binary coding method is investigated in this paper, which is based on Genetic Algorithm. The code lengths of the algorithm's least amplitude significant bits and least phase significant bits are analyzed and their impacts on performance are discussed. Finally, a general selection range of parameters is given and the...
We address the issue of stability and convergence of perturbed switched linear time-delay systems. By introducing the variation-of-constants formula, the conditions of the stability and convergence of perturbed switched linear systems with time-delay are established, and the difficulties caused by the interaction between the switchings and time-delay are conquered. Based on the general result of perturbed...
Algorithms based on game theory regard the equilibriums as the optimal solution for the cooperation in multi-agent system (MAS), especially the evolutionary stable equilibriums (ESE) had been studied because they can give a consistent optimal solution for the MAS and partly solve the equilibrium selection problem of game theory. However ESE is dynamic stable, so the strategy of every agent keeps on...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.