We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Moth flame optimization algorithm based on decomposition for placement of relay nodes in WSNs.
- Authors
Sapre, Saunhita; Mini, S.
- Abstract
Metaheuristic algorithms have popularly been used to solve a wide range of complex engineering optimization problems. In order to solve the problems with two or more objectives multi-objective algorithms (MOAs) are used. Application of MOAs to solve multiple conflicting objectives yields a Pareto-optimal solution set. In this paper, we propose a multi-objective decomposition-based moth flame optimization (MOMFO/D) algorithm, that decomposes the objectives into multiple single objectives which are optimized simultaneously. The algorithm is used to solve the relay node placement problem, that is modeled as a bi-objective problem with the goal of minimization of average intra-cluster distance and average hop-count to improve the network lifetime. The Pareto-optimal fronts obtained through the simulations are evaluated using three distinct quality indicators namely the Inverted Generational Distance, Spacing Metric and Maximum Spread in order to evaluate the performance. The obtained results considered over a number of runs are compared with other existing optimizers in the literature such as multi-objective non-dominated sorted moth flame optimizer, and multi-objective evolutionary algorithm based on decomposition. The results demonstrate the superiority in the performance of the proposed algorithm over others. The statistical analysis of the experimental work has been carried out by conducting Friedman's and Quade test.
- Subjects
PROCESS optimization; METAHEURISTIC algorithms; FLAME; METRIC spaces; EVOLUTIONARY algorithms; MOTHS
- Publication
Wireless Networks (10220038), 2020, Vol 26, Issue 2, p1473
- ISSN
1022-0038
- Publication type
Article
- DOI
10.1007/s11276-019-02213-1