IMECH-IR  > 流固耦合系统力学重点实验室
A novel CACOR-SVR multi-objective optimization approach and its application in aerodynamic shape optimization of high-speed train
Zhang Y; Guo DL(郭迪拢); Sun ZX(孙振旭); Chen DW
Corresponding AuthorYang, Guo Wei(gwyang@imech.ac.cn)
Source PublicationSOFT COMPUTING
2019-07-01
Volume23Issue:13Pages:5035-5051
ISSN1432-7643
AbstractA chaos ant colony optimization algorithm for continuous domain is proposed based on chaos optimization theory and ant colony optimization algorithm. The searching abilities of optimization algorithms with different coding methods are compared, and the results indicate that the proposed algorithm has better performance than genetic algorithm and particle swarm optimization algorithm. Based on the non-dominated sorting concept and niching method, a multi-objective chaos ant colony optimization algorithm is also constructed and numerical results show that the improved algorithm performs well at solving multi-objective optimization problems. An optimal support vector regression model based on radial basis kernel function is developed for the small sample size and nonlinear characteristics of streamlined head optimization. On the basis of the above work, a multi-objective optimization design for the aerodynamic head shape of high-speed train is developed using a modified vehicle modeling function parametric approach. The optimization results demonstrate that the new optimization design method has exceptional searching abilities and high prediction accuracy. After optimization, the aerodynamic drag of the simplified train with three carriages is reduced by 10.52% and the aerodynamic lift of the tail car is reduced by 35.70%. The optimization approach proposed in the present paper is simple yet efficient and sheds light on the engineering design of aerodynamic shape of high-speed trains.
KeywordChaos ant colony optimization Support vector machine Multi-objective optimization Vehicle modeling function High-speed trains
DOI10.1007/s00500-018-3172-3
Indexed BySCI
Language英语
WOS IDWOS:000469418900031
WOS KeywordALGORITHMS
WOS Research AreaComputer Science
WOS SubjectComputer Science, Artificial Intelligence ; Computer Science, Interdisciplinary Applications
Funding ProjectStrategic Priority Research Program of the Chinese Academy of Sciences (class B)[XDB22020000] ; National Key Research & Development Projects[2017YFB0202800] ; Computing Facility for Computational Mechanics Institute of Mechanics at the Chinese Academy of Sciences
Funding OrganizationStrategic Priority Research Program of the Chinese Academy of Sciences (class B) ; National Key Research & Development Projects ; Computing Facility for Computational Mechanics Institute of Mechanics at the Chinese Academy of Sciences
Classification二类
Ranking1
Citation statistics
Document Type期刊论文
Identifierhttp://dspace.imech.ac.cn/handle/311007/79326
Collection流固耦合系统力学重点实验室
Recommended Citation
GB/T 7714
Zhang Y,Guo DL,Sun ZX,et al. A novel CACOR-SVR multi-objective optimization approach and its application in aerodynamic shape optimization of high-speed train[J]. SOFT COMPUTING,2019,23(13):5035-5051.
APA Zhang Y,郭迪拢,孙振旭,&Chen DW.(2019).A novel CACOR-SVR multi-objective optimization approach and its application in aerodynamic shape optimization of high-speed train.SOFT COMPUTING,23(13),5035-5051.
MLA Zhang Y,et al."A novel CACOR-SVR multi-objective optimization approach and its application in aerodynamic shape optimization of high-speed train".SOFT COMPUTING 23.13(2019):5035-5051.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang Y]'s Articles
[郭迪拢]'s Articles
[孙振旭]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang Y]'s Articles
[郭迪拢]'s Articles
[孙振旭]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang Y]'s Articles
[郭迪拢]'s Articles
[孙振旭]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.