2004
DOI: 10.1016/j.cam.2003.05.022
|View full text |Cite
|
Sign up to set email alerts
|

Application of genetic algorithms to lubrication pump stacking design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(7 citation statements)
references
References 4 publications
0
7
0
Order By: Relevance
“…Genetic algorithms are based on an abstraction of the natural evolutionary behavior which was originally proposed in [20]. They are a robust and flexible approach that can be applied to a wide range of optimization problems (see, for example, [21][22][23]). Main aim of GA is to achieve better results by removing bad results during production of population from current generation to next generation and using only good results to achieve the better results.…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Genetic algorithms are based on an abstraction of the natural evolutionary behavior which was originally proposed in [20]. They are a robust and flexible approach that can be applied to a wide range of optimization problems (see, for example, [21][22][23]). Main aim of GA is to achieve better results by removing bad results during production of population from current generation to next generation and using only good results to achieve the better results.…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Stochastic methods mainly follow three alternative approaches; genetic algorithms [49], and evolutionary strategies [50] mimic the evolutionary behavior of nature, while simulated annealing imitates the behavior of cooling fluids [51]. Stochastic algorithms have been already applied to pump stacking optimization in [52], and specifically to gerotor profiles in [53] and [54]. Several declinations of the evolutionary strategy for single-objective optimization are available in the literature [48], but they all share the same philosophy, based on the four base principles of the process of organic evolution: reproduction, mutation, competition, and selection [55].…”
Section: Stochastic Optimization Algorithmsmentioning
confidence: 99%
“…where d k+1 unmut1 and d k+1 unmut2 are the offspring's parameter vectors, d k p1 and d k p2 are the parents, and α is the crossover operator. The offspring are hence mutated by applying a random factor chosen from a standard distribution v centered in 0 with standard deviation σ(α), which is divided or multiplied by a factor α at the beginning of each iteration [52]:…”
Section: Stochastic Optimization Algorithmsmentioning
confidence: 99%
“…This algorithm makes the solution improved in the process of competition in order to obtain the satisfactory solution or the optimization solution [6]. It has widely used in many kinds of fields, such as function optimization [7,8], computer aid design [9], intelligent instrument design [10], scheduling optimization [11,12], steady-state operation optimization [13], robotic assembly line balancing problem [14], process planning [15], the two-dimensional assortment problem [16], intrusion detection [17], lubrication pump stacking design [18], electronic commerce [19], and so on. In this article, we use GA to solve the project scheduling problem with resource constraints so as to find out the optimal scheduling scheme.…”
Section: Introductionmentioning
confidence: 99%