2018
DOI: 10.17482/uumfd.476611
|View full text |Cite
|
Sign up to set email alerts
|

Di̇feransi̇yel Geli̇şi̇m Algori̇tmasi Kullanilarak Otomoti̇v Süspansi̇yon Yaylarinin Opti̇mum Tasarimi

Abstract: The automotive industry has been growing steadily and paying attention to develop technologies and production processes in the world. Automotive companies are facing great competition due to the increasing number of companies and the rapid increase in customer expectations as a result of developing technological products. In order to compete, automotive manufacturers need to meet the expectations of customers and governments, such as vehicle weight, collision safety, fuel emissions and vehicle comfort. In orde… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 19 publications
(17 reference statements)
0
1
0
Order By: Relevance
“…DE uses a simple operator, with classical operators such as crossover, mutation, and selection, to create new candidate solutions. Due to its effectiveness and simplicity, DE was used for production scheduling [35][36][37], manufacturing [38,39], production processes [40][41][42][43], and transportation [44][45][46] DE sometimes experiences problems in finding a good solution because it can easily get stuck in local optima. This problem can be avoided by restarting the algorithm, introducing a new random vector into the algorithm, and changing the neighborhood strategy to search for a new solution.…”
Section: Introductionmentioning
confidence: 99%
“…DE uses a simple operator, with classical operators such as crossover, mutation, and selection, to create new candidate solutions. Due to its effectiveness and simplicity, DE was used for production scheduling [35][36][37], manufacturing [38,39], production processes [40][41][42][43], and transportation [44][45][46] DE sometimes experiences problems in finding a good solution because it can easily get stuck in local optima. This problem can be avoided by restarting the algorithm, introducing a new random vector into the algorithm, and changing the neighborhood strategy to search for a new solution.…”
Section: Introductionmentioning
confidence: 99%