2021
DOI: 10.1155/2021/5526127
|View full text |Cite
|
Sign up to set email alerts
|

Compact Sine Cosine Algorithm with Multigroup and Multistrategy for Dispatching System of Public Transit Vehicles

Abstract: This paper studies the problem of intelligence optimization, a fundamental problem in analyzing the optimal solution in a wide spectrum of applications such as transportation and wireless sensor network (WSN). To achieve better optimization capability, we propose a multigroup Multistrategy Compact Sine Cosine Algorithm (MCSCA) by using the compact strategy and grouping strategy, which makes the initialized randomly generated value no longer an individual in the population and avoids falling into the local opti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 49 publications
0
13
0
Order By: Relevance
“…In this experiment, MPPE was compared with PPE, PSO, SCA, and MCSCA [53]. In the search process, all algorithms find their current optimal solutions through each iteration.…”
Section: Mppe Applicating In Iot Electric Bus Schedulingmentioning
confidence: 99%
“…In this experiment, MPPE was compared with PPE, PSO, SCA, and MCSCA [53]. In the search process, all algorithms find their current optimal solutions through each iteration.…”
Section: Mppe Applicating In Iot Electric Bus Schedulingmentioning
confidence: 99%
“…en, many researchers improve the parallel method based on Chang's theory. For example, Yang et al [31] and Zhu et al [19] proposed a parallel strategy of multiple groups and multiple strategies. Each population will update according to its own communication strategy.…”
Section: Parallel Strategymentioning
confidence: 99%
“…ese algorithms have been successfully applied to different fields of medical industry [17], image processing [18], transportation [19], and the like. However, according to the No Free Lunch eorem (NFL) [20], there is no metaheuristic algorithm suitable for handling all types of optimization problems.…”
Section: Introductionmentioning
confidence: 99%
“…5 and |E| ≥ 0.5 then Update the vector X i using Equations ( 4)-( 6); end else if r ≥ 0.5 and |E| < 0.5 then Update the vector X i using Equation ( 7); end else if r < 0.5 and E |≥ 0.5 Update the vector X i using Equations ( 8)- (11); end else if r < 0.5and |E| < 0.5 Update the vector X i using Equations ( 12) and ( 13); end end end Optimal neighborhood disturbance using Equations ( 27) and ( 28…”
Section: Algorithm 1: Cshho Algorithmmentioning
confidence: 99%
“…Heuristic algorithms are dedicated to customizing algorithms through intuitive experience and problem information, but are often difficult to generalize due to their specialized nature. Compared to these two algorithms, meta-heuristic algorithms are more general and do not require deep adaptation to the problem, and although they do not guarantee optimal solutions, they can generally obtain optimal solutions under acceptable spatial and temporal conditions, although the degree of deviation from the optimal solution is difficult to estimate [8][9][10][11][12].…”
Section: Introductionmentioning
confidence: 99%