2020
DOI: 10.3390/su12030767
|View full text |Cite
|
Sign up to set email alerts
|

A Compact Pigeon-Inspired Optimization for Maximum Short-Term Generation Mode in Cascade Hydroelectric Power Station

Abstract: Pigeon-inspired optimization (PIO) is a new type of intelligent algorithm. It is proposed that the algorithm simulates the movement of pigeons going home. In this paper, a new pigeon herding algorithm called compact pigeon-inspired optimization (CPIO) is proposed. The challenging task for multiple algorithms is not only combining operations, but also constraining existing devices. The proposed algorithm aims to solve complex scientific and industrial problems with many data packets, including the use of classi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
39
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
6
3

Relationship

4
5

Authors

Journals

citations
Cited by 77 publications
(39 citation statements)
references
References 36 publications
0
39
0
Order By: Relevance
“…The Pigeon-inspired optimization algorithm is a new meta-heuristic algorithm. PIO was proposed in 2014 and was inspired by the behavior of pigeons returning home [48]. Pigeons can find their home with tools that help them to return home, the tools include magnetic fields, the sun, and landmarks.…”
Section: Pigeon-inspired Optimizationmentioning
confidence: 99%
“…The Pigeon-inspired optimization algorithm is a new meta-heuristic algorithm. PIO was proposed in 2014 and was inspired by the behavior of pigeons returning home [48]. Pigeons can find their home with tools that help them to return home, the tools include magnetic fields, the sun, and landmarks.…”
Section: Pigeon-inspired Optimizationmentioning
confidence: 99%
“…In [17], a novel adaptation of the multi-group quasi-affine transformation evolutionary algorithm for global optimization was proposed. In [18], a compact pigeon-inspired optimization algorithm was proposed to solve complex scientific and industrial problems with many data packets, including the use of classical optimization problems and the ability to find optimal solutions in many solution spaces with limited hardware resources. Those studies provide a feasible solution to the problem under acceptable computational time and space, and the solution cannot be predicted in advance [19].…”
Section: 'Pso-infotaxis' Algorithm-based Exploration Of Cooperative Usvsmentioning
confidence: 99%
“…P t g = argmax P sh t r j (18) Here, P t r j is the probability of source position estimated in USV i's t-th iteration, and P sh t r j is the sharing probability of source position estimated in the multiple USVs' t-th iteration.…”
Section: 'Infotaxis' Algorithm Of Multi-usv Exploration Based On Imprmentioning
confidence: 99%
“…Intelligent computing has been paid more and more attention by researchers because of its excellent performance in solving optimization problems, such as Artificial Bee Colony (ABC) [8][9][10], Particle Swarm Optimization (PSO) [11][12][13][14], Genetic Algorithm (GA) [15], Ant Colony Optimization (ACO) [16][17][18], Cat Swarm Optimization (CSO) [19][20][21], Difference Evolution (DE) [22][23][24], Multi-Verse Optimizer [25,26], Symbiotic Organism Search Algorithm [27,28], QUATRE [29][30][31] and et al To improve the optimization efficiency, many methods have been put forward. For example, a compact method is implemented to achieve better performance based on the memory of a single individual [32][33][34][35][36][37]. The simulation of the benchmark function can also effectively improve the speed and sear-ability of the original algorithm [38].…”
Section: Introductionmentioning
confidence: 99%