Optimal μPMU Placement in Distribution Network Using Binary Carnivorous Plant Algorithm

Mukherjee, Manas; Roy, Biman Kumar Saha

doi:10.1109/stpec52385.2021.9718699

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CPA is a swarm intelligence-based optimization algorithm inspired by the survival skills of carnivorous plants, first proposed in 2021 [24], and has been proven to be effective and robust in addressing continuous problems and engineering design problems. Then M. Mukherjee [25] presented an improved binary CPA, which exhibits strong exploration and exploitation ability and address the optimal micro-PMU placement problem in the distribution network successfully. To the best of our knowledge, CPA in the existing literature applied to solve TSP has not been detected.…”

Section: Introductionmentioning

confidence: 99%

A Carnivorous Plant Algorithm With Heuristic Decoding Method for Traveling Salesman Problem

et al. 2022

View full text Add to dashboard Cite

The traveling salesman problem (TSP) is one of the most extensively studied problems in the combinatorial optimization area and still presents unsolved challenges due to its NP-hard attribute. Although many real-coded algorithms are available for TSP, they still have some performance challenges in the switch from continuous space to discrete space and perform at low convergence speed. This paper proposes a real-coded carnivorous plant algorithm with a heuristic decoding method (CPA-HDM) to solve the traveling salesman problem (TSP), which exhibits good convergence speed and solution accuracy. In this improved method, a new heuristic decoding method (HDM) is designed, which helps to map continuous variables to discrete ones without losing information, maintain population diversity, and enhance the solution quality after decoding. To balance the algorithm's search capability and enhance the probability of preferable individuals generated, an adaptive attraction probability (AAP), an improved growth model of carnivorous plants (IGMOCP), and a position update method of prey (IPUMOP) are developed. Aiming to reduce the probability of premature and prevent search stagnation, an improved reproduction strategy (IRS) and an adaptive combination perturbation are reconstructed. Finally, a local search algorithm is employed to improve the exploitation capability. To verify its validation, CPA-HDM is compared with six algorithms, for solving 28 TSP instances. The simulation results and statistical analyses demonstrate the superior performance of the proposed algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%