Journal Article10.1109/TEVC.2017.2690446
A Similarity-Based Multiobjective Evolutionary Algorithm for Deployment Optimization of Near Space Communication System
40
TL;DR: A similarity-based MOEA based on decomposition to optimize the deployment of the airships considering path loss, user demand, and inner structure and outperforms the other algorithms significantly in detecting hotspots, tracking multiple hotspots and safely deploying airships for most cases.
read more
Abstract: The deployment of the airships plays a key role in maximizing the performance of the near space communication system. The main problem is how to strike a balance between the conflicting network speed and coverage for complex user distribution. In this paper, we propose a multiobjective deployment optimization model considering path loss, user demand, and inner structure. Under the framework of the multiobjective evolutionary algorithm (MOEA) based on decomposition (MOEA/D), we propose a similarity-based MOEA to optimize this problem. The proposed algorithm is motivated by the population’s perception on the decision variable space. The proposed algorithm perceives the decision variable space by deploying airships to latent regions. The perceptions of different solutions are related by the similarity between their deployments and utilized differently by crossover and mutation. The proposed algorithm is tested on five designed problems compared with MOEA/D with the other popular reproduction operators. We also test the proposed scheme integrated with another two popular algorithms. The experimental results show that the similarity-based MOEA/D outperforms the other algorithms significantly in detecting hotspots, tracking multiple hotspots and safely deploying airships for most cases. The proposed scheme also works well with the other algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Handling Constrained Multiobjective Optimization Problems With Constraints in Both the Decision and Objective Spaces
Zhi-Zhong Liu,Yong Wang +1 more
TL;DR: A simple and efficient two-phase framework, named ToP, is proposed in this paper to enhance current CMOEAs’ performance on DOC, the first attempt to consider both the decision and objective constraints simultaneously in the design of artificial CMOPs.
348
Evolutionary Constrained Multiobjective Optimization: Test Suite Construction and Performance Comparisons
Zhongwei Ma,Yong Wang +1 more
TL;DR: This paper proposes a new constraint construction method to facilitate the systematic design of test problems and designs a new test suite consisting of 14 instances, which covers diverse characteristics extracted from real-world CMOPs and can be divided into four types.
294
Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
TL;DR: It is of utmost importance to use a correct tool for measuring the performance of the diverse set of metaheuristic algorithms to derive an appropriate judgment on the superiority of the algorithms and also to validate the claims raised by researchers for their specific objectives.
201
Dynamic Selection Preference-Assisted Constrained Multiobjective Differential Evolution
TL;DR: A dynamic selection preference-assisted constrained multiobjective differential evolutionary (DE) algorithm that exhibits superior or at least competitive performance, in comparison with other well-established methods.
148
A cluster based PSO with leader updating mechanism and ring-topology for multimodal multi-objective optimization
TL;DR: A new cluster based particle swarm optimization algorithm (PSO) with leader updating mechanism and ring-topology for solving MMOPs is presented and leader updating strategy is introduced to identify the best leaders in PSO.
118
References
A fast and elitist multiobjective genetic algorithm: NSGA-II
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Qingfu Zhang,Hui Li +1 more
TL;DR: Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
A high-throughput path metric for multi-hop wireless routing
Douglas S. J. De Couto,Daniel Aguayo,John Bicket,Robert Morris +3 more
- 14 Sep 2003
TL;DR: Measurements taken from a 29-node 802.11b test-bed demonstrate the poor performance of minimum hop-count, illustrate the causes of that poor performance, and confirm that ETX improves performance.
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Hui Li,Qingfu Zhang +1 more
TL;DR: The experimental results indicate that MOEA/D could significantly outperform NSGA-II on these test instances, and suggests that decomposition based multiobjective evolutionary algorithms are very promising in dealing with complicated PS shapes.
2.4K
A Note on a Simple Transmission Formula
H.T. Friis
- 01 May 1946
TL;DR: In this paper, a simple transmission formula for a radio circuit is derived, and the utility of the formula is emphasized and its limitations are discussed, as well as its utility and limitations.
2.3K