2022
DOI: 10.1016/j.egyr.2022.10.352
|View full text |Cite
|
Sign up to set email alerts
|

Research on user-side flexible load scheduling method based on greedy algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 3 publications
0
1
0
Order By: Relevance
“…After crossover and mutation operations, obvious infeasible solutions can be quickly eliminated according to the power and energy constraints. From the comparison, it can be seen that the method proposed in this paper was significantly faster than the binary particle swarm optimization [32], the differential evolution algorithm [33], the simulated annealing algorithm [34], and the traversal solving algorithm [35], of which the results obtained using the traversal solving algorithm could be regarded as the benchmark. Through comparison, it was found that the algorithm proposed in this paper can find a solution very close to the optimal solution in a relatively short period of time.…”
Section: Island Partition Schemementioning
confidence: 99%
“…After crossover and mutation operations, obvious infeasible solutions can be quickly eliminated according to the power and energy constraints. From the comparison, it can be seen that the method proposed in this paper was significantly faster than the binary particle swarm optimization [32], the differential evolution algorithm [33], the simulated annealing algorithm [34], and the traversal solving algorithm [35], of which the results obtained using the traversal solving algorithm could be regarded as the benchmark. Through comparison, it was found that the algorithm proposed in this paper can find a solution very close to the optimal solution in a relatively short period of time.…”
Section: Island Partition Schemementioning
confidence: 99%
“…The Pearson correlation coefficient plays a pivotal role in the optimization of the K-means clustering algorithm, particularly by quantifying linear relationships, enhancing K-means clustering, and optimizing cluster representation. Calculate the Pearson correlation coefficient of the selected daily wind power output data, and use the Greedy Algorithm to find the output curve with the lowest correlation as the clustering center [19]. Then, use K-means for clustering and repeat several times to find the clustering result corresponding to the maximum silhouette coefficient [12].…”
mentioning
confidence: 99%