Single Objective Guided Multiobjective Optimization Algorithm

Author(s):  
Jiahai Wang ◽  
Chenglin Zhong ◽  
Ying Zhou
2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Jun Huang ◽  
Liqian Xu ◽  
Cong-cong Xing ◽  
Qiang Duan

The design of wireless sensor networks (WSNs) in the Internet of Things (IoT) faces many new challenges that must be addressed through an optimization of multiple design objectives. Therefore, multiobjective optimization is an important research topic in this field. In this paper, we develop a new efficient multiobjective optimization algorithm based on the chaotic ant swarm (CAS). Unlike the ant colony optimization (ACO) algorithm, CAS takes advantage of both the chaotic behavior of a single ant and the self-organization behavior of the ant colony. We first describe the CAS and its nonlinear dynamic model and then extend it to a multiobjective optimizer. Specifically, we first adopt the concepts of “nondominated sorting” and “crowding distance” to allow the algorithm to obtain the true or near optimum. Next, we redefine the rule of “neighbor” selection for each individual (ant) to enable the algorithm to converge and to distribute the solutions evenly. Also, we collect the current best individuals within each generation and employ the “archive-based” approach to expedite the convergence of the algorithm. The numerical experiments show that the proposed algorithm outperforms two leading algorithms on most well-known test instances in terms of Generational Distance, Error Ratio, and Spacing.


2021 ◽  
Vol 9 ◽  
Author(s):  
Zhaoxing Li ◽  
Qionghai Liu ◽  
Li Chen

A complex network can crash down due to disturbances which significantly reduce the network’s robustness. It is of great significance to study on how to improve the robustness of complex networks. In the literature, the network rewire mechanism is one of the most widely adopted methods to improve the robustness of a given network. Existing network rewire mechanism improves the robustness of a given network by re-connecting its nodes but keeping the total number of edges or by adding more edges to the given network. In this work we propose a novel yet efficient network rewire mechanism which is based on multiobjective optimization. The proposed rewire mechanism simultaneously optimizes two objective functions, i.e., maximizing network robustness and minimizing edge rewire operations. We further develop a multiobjective discrete partite swarm optimization algorithm to solve the proposed mechanism. Compared to existing network rewire mechanisms, the developed mechanism has two advantages. First, the proposed mechanism does not require specific constraints on the rewire mechanism to the studied network, which makes it more feasible for applications. Second, the proposed mechanism can suggest a set of network rewire choices each of which can improve the robustness of a given network, which makes it be more helpful for decision makings. To validate the effectiveness of the proposed mechanism, we carry out experiments on computer-generated Erdős–Rényi and scale-free networks, as well as real-world complex networks. The results demonstrate that for each tested network, the proposed multiobjective optimization based edge rewire mechanism can recommend a set of edge rewire solutions to improve its robustness.


2020 ◽  
Vol 2020 ◽  
pp. 1-21
Author(s):  
Hao Chen ◽  
Weikun Li ◽  
Weicheng Cui

Nature-inspired computing has attracted huge attention since its origin, especially in the field of multiobjective optimization. This paper proposes a disruption-based multiobjective equilibrium optimization algorithm (DMOEOA). A novel mutation operator named layered disruption method is integrated into the proposed algorithm with the aim of enhancing the exploration and exploitation abilities of DMOEOA. To demonstrate the advantages of the proposed algorithm, various benchmarks have been selected with five different multiobjective optimization algorithms. The test results indicate that DMOEOA does exhibit better performances in these problems with a better balance between convergence and distribution. In addition, the new proposed algorithm is applied to the structural optimization of an elastic truss with the other five existing multiobjective optimization algorithms. The obtained results demonstrate that DMOEOA is not only an algorithm with good performance for benchmark problems but is also expected to have a wide application in real-world engineering optimization problems.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Huan Zhang ◽  
Rennong Yang ◽  
Changyue Sun ◽  
Haiyan Han

For the problem of multiaircraft cooperative suppression interference array (MACSIA) against the enemy air defense radar network in electronic warfare mission planning, firstly, the concept of route planning security zone is proposed and the solution to get the minimum width of security zone based on mathematical morphology is put forward. Secondly, the minimum width of security zone and the sum of the distance between each jamming aircraft and the center of radar network are regarded as objective function, and the multiobjective optimization model of MACSIA is built, and then an improved multiobjective particle swarm optimization algorithm is used to solve the model. The decomposition mechanism is adopted and the proportional distribution is used to maintain diversity of the new found nondominated solutions. Finally, the Pareto optimal solutions are analyzed by simulation, and the optimal MACSIA schemes of each jamming aircraft suppression against the enemy air defense radar network are obtained and verify that the built multiobjective optimization model is corrected. It also shows that the improved multiobjective particle swarm optimization algorithm for solving the problem of MACSIA is feasible and effective.


Sign in / Sign up

Export Citation Format

Share Document