2 research outputs found

    Solving k

    Get PDF
    Coverage problem is a critical issue in wireless sensor networks for security applications. The k-barrier coverage is an effective measure to ensure robustness. In this paper, we formulate the k-barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sensor node to prolong the lifetime of the k-barrier coverage. A novel hybrid particle swarm optimization and gravitational search algorithm (PGSA) is proposed to solve this problem. The proposed PGSA adopts a k-barrier coverage generation strategy based on probability and integrates the exploitation ability in particle swarm optimization to update the velocity and enhance the global search capability and introduce the boundary mutation strategy of an agent to increase the population diversity and search accuracy. Extensive simulations are conducted to demonstrate the effectiveness of our proposed algorithm

    A Vector Grouping Learning Brain Storm Optimization Algorithm for Global Optimization Problems

    Get PDF
    The original brain storm optimization (BSO) method does not rationally compromise global exploration and local exploitation capability, which results in the premature convergence when solving complicated optimization problems like the shifted or shifted rotated functions. To address this problem, the paper develops a vector grouping learning BSO (VGLBSO) method. In VGLBSO, the individuals’ creation based on vector grouping learning (IC-VGL) scheme is first developed to improve the population diversity and compromise the global exploration and local exploitation capability. Moreover, a hybrid individuals’ update (H-IU) scheme is established by reasonably combing two different individuals’ update schemes, which further compromises the global exploration and local exploitation capability. Finally, the random grouping (RG) scheme, instead of K-means grouping is allowed to shrink the computational cost and maintain the diversity of the information exchange between different individuals. Twenty-eight popular benchmark functions are used to compare VGLBSO with 12 BSO and nine swarm intelligence methods. Experimental results present that VGLBSO achieves the best overall performance including the global search ability, convergence speed, and scalability amongst all the compared algorithms
    corecore