2021
DOI: 10.3390/machines9090196
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Design of Shift Point Strategy for DCT Based on Particle Swarm Optimization

Abstract: For a vehicle equipped with DCT, the vehicle model is established according to the existing experimental data. The traditional method is used to solve the law of economic and dynamic shift, respectively. Then, the dynamic objective function and economic objective function are designed. After normalization of the two functions, the weighted combination is carried out to get the comprehensive objective function. The traditional shift law obtained in the previous paper is regarded as the limit value of variable o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…Each particle has an initial speed and position, and a fitness value is determined by the fitness function. Each particle is given a memory function to remember the best position found; in addition, the speed of each particle determines the direction and distance of their flight so that the particle can search in the optimal solution space [35]. In each iteration of the optimization process, the particle updates its speed and position by comparing the fitness value and two extreme values: the optimal solution found by the particle itself (individual extreme value pbest) and the optimal solution found by the entire population (global extremum gbest).…”
Section: Psomentioning
confidence: 99%
“…Each particle has an initial speed and position, and a fitness value is determined by the fitness function. Each particle is given a memory function to remember the best position found; in addition, the speed of each particle determines the direction and distance of their flight so that the particle can search in the optimal solution space [35]. In each iteration of the optimization process, the particle updates its speed and position by comparing the fitness value and two extreme values: the optimal solution found by the particle itself (individual extreme value pbest) and the optimal solution found by the entire population (global extremum gbest).…”
Section: Psomentioning
confidence: 99%
“…It simulates the evolution of an artificial population with individuals containing genes (optimization variables) through the selection, crossover, and mutation process [34]. Finally, the genes of the optimal individual in the last generation are decoded to obtain the optimal solution to the optimization problem [35].…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Parameter optimization based on intelligent optimization algorithms is widely used in automotive engineering. For instance, the shift law of dual-clutch transmissions is optimized by the particle swarm optimization algorithm (PSO), and the results show that the dynamic performance and economy of optimized shifts have improved [9]. Compared to the PSO, the main benefit of the genetic algorithm is to avoid slipping into the local optimum solution; it has good global search capabilities, self-adaptability, and the ability to find a global optimal solution without relying on initial conditions [10].…”
Section: Introductionmentioning
confidence: 99%