2005
DOI: 10.1016/j.ijmachtools.2005.03.009
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of multi-pass milling using parallel genetic algorithm and parallel genetic simulated annealing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 106 publications
(31 citation statements)
references
References 28 publications
(39 reference statements)
0
27
0
Order By: Relevance
“…The combination of these two methods overcomes their weaknesses and unites their strengths. 52,53 Besides the optimizing of production process parameters, it is possible to optimize the installation of the working machines in the production line by combining GA and greedy algorithms. The goal of this optimization may be to minimize the installation cost of the working machines.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The combination of these two methods overcomes their weaknesses and unites their strengths. 52,53 Besides the optimizing of production process parameters, it is possible to optimize the installation of the working machines in the production line by combining GA and greedy algorithms. The goal of this optimization may be to minimize the installation cost of the working machines.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Wang et al [21] presented the genetic simulated annealing (GSA) and parallel genetic simulated annealing (PGSA) based on the genetic algorithm and simulated annealing to find optimal machining parameters in milling operations. Baskar et al [22] compared the performance of four non-conventional methods: Ant Colony Algorithm, GA, PSO and Tabu Search.…”
Section: Multi Objective Optimizationmentioning
confidence: 99%
“…In the present study, simulated annealing (SA) was applied as the global optimization algorithm, because SA is known to be very well suited for solving highly nonlinear problems and, thus, effective in approaching the global optimum [8][9][10]. SA is based on the random evaluation of the objective function, in such a way that escape from a local minimum is possible.…”
Section: Optimization Proceduresmentioning
confidence: 99%