A Fast Optimization Algorithm for K-Coverage Problem

2017 ◽  
pp. 703-714
Author(s):  
Jingwen Pei ◽  
Maomao ◽  
Jiayin Wang
Keyword(s):  
Optimization Algorithm ◽  
Coverage Problem ◽  
Fast Optimization

Constrained shadowed sets and fast optimization algorithm

2019 ◽  
Vol 34 (10) ◽  
pp. 2655-2675 ◽  
Author(s):  
Jie Zhou ◽  
Can Gao ◽  
Witold Pedrycz ◽  
Zhihui Lai ◽  
Xiaodong Yue
Keyword(s):  
Optimization Algorithm ◽  
Fast Optimization ◽  
Shadowed Sets

Fast Optimization Algorithm for Evanescent-Mode Cavity Tuner Optimization and Timing Reduction in Software-Defined Radar Implementation

2020 ◽  
Vol 56 (4) ◽  
pp. 2762-2778 ◽  
Author(s):  
Angelique Dockendorf ◽  
Austin Egbert ◽  
Ellie Langley ◽  
Caleb Calabrese ◽  
Jose Alcala-Medel ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Evanescent Mode ◽  
Fast Optimization

scholarly journals Solving Point Coverage Problem in Wireless Sensor Networks Using Whale Optimization Algorithm

2021 ◽  
Author(s):  
Mahnaz Toloueiashtian ◽  
Mehdi Golsorkhtabaramiri ◽  
Seyed Yaser Bozorgi Rad
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Energy Use ◽  
Whale Optimization Algorithm ◽  
Wireless Sensor ◽  
Dynamic Power Management ◽  
Coverage Problem ◽  
Whale Optimization ◽  
Point Coverage

Todays, dynamic power management methods that decrease the energy use of sensor networks after their design and deployment are of paramount importance. In Wireless Sensor Networks (WSN), coverage and detection quality are one aspect of service quality and power consumption reduction aspect. The aim of the coverage problem is to monitor at least one node at each point in the targeted area and is divided into three categories: border, area, and point coverage. In point coverage, which is our interest, the problem is to cover specific points of the environment scattered on the surface of the environment; their position is decided on and called the goal. In this paper, a new metaheuristic algorithm based on Whale Optimization Algorithm (WOA) is proposed. The proposed algorithm tries to find the Best Solution (BS) based on three operations exploration, spiral attack, and siege attack. Several scenarios, including medium, hard and complex problems, are designed to evaluate the proposed technique, and it is compared to Genetic Algorithm (GA) and Ant Colony Optimization (ACO) based on time complexity criteria in providing a suitable coverage, network lifetime, energy consumption. The simulation results show that the proposed algorithm performs better than the compared ones in most scenarios.

scholarly journals A fast optimization algorithm for multicriteria intensity modulated proton therapy planning

2010 ◽  
Vol 37 (9) ◽  
pp. 4938-4945 ◽  
Author(s):  
Wei Chen ◽  
David Craft ◽  
Thomas M. Madden ◽  
Kewu Zhang ◽  
Hanne M. Kooy ◽  
...  
Keyword(s):  
Proton Therapy ◽  
Optimization Algorithm ◽  
Therapy Planning ◽  
Intensity Modulated Proton Therapy ◽  
Intensity Modulated ◽  
Fast Optimization

An Improved Artificial Plant Optimization Algorithm for Coverage Problem in WSN

2012 ◽  
Vol 10 (8) ◽  
pp. 1874-1878 ◽  
Author(s):  
Jun Li ◽  
Zhihua Cui ◽  
Zhongzhi Shi
Keyword(s):  
Optimization Algorithm ◽  
Coverage Problem ◽  
Plant Optimization

Social Emotional Optimization Algorithm with Gaussian Distribution for Optimal Coverage Problem

2013 ◽  
Vol 11 (2) ◽  
pp. 259-263 ◽  
Author(s):  
Zhihua Cui ◽  
Shujing Fan ◽  
Zhongzhi Shi
Keyword(s):  
Gaussian Distribution ◽  
Optimization Algorithm ◽  
Coverage Problem ◽  
Social Emotional
Sign in / Sign up

Export Citation Format

Share Document