2011
DOI: 10.1007/s00170-011-3393-4
|View full text |Cite
|
Sign up to set email alerts
|

Constrained optimum surface roughness prediction in turning of X20Cr13 by coupling novel modified harmony search-based neural network and modified harmony search algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…However, many other previous works have focused on the determination of the optimal cutting conditions for different objectives [20][21][22][23][24][25][26][27]. Zuperl and Cus [20] described a method for optimizing multi-purpose turning cutting conditions with the help of neural networks aimed at increasing productivity and reducing costs, and providing an acceptable surface roughness.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, many other previous works have focused on the determination of the optimal cutting conditions for different objectives [20][21][22][23][24][25][26][27]. Zuperl and Cus [20] described a method for optimizing multi-purpose turning cutting conditions with the help of neural networks aimed at increasing productivity and reducing costs, and providing an acceptable surface roughness.…”
Section: Introductionmentioning
confidence: 99%
“…Optimal processing parameters were selected using the Pareto chart. Zinati and Razfar [22] derived prediction models for cutting conditions that ensure minimal surface roughness for longitudinal turning (turning long parts) of X20Cr13. Jafarian et al [23] investigated three separate neural networks in order to minimize the surface roughness and maximize tool life in the turning.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, incorporating the fractional concept with the HSA algorithm enhances the iteration speed for the polyphase code design. The FHSA uses the properties of the fractional theory (Pires et al , 2010; Ren-Qiang et al , 2009; Mahata et al , 2016; Pu, 2016) and the HSA (Sergio et al , 2012; Geem et al , 2001; Reza et al , 2012; Yi et al , 2016; Gil-Lopez et al , 2011).…”
Section: Proposed Methodology: Optimal Polyphase Code Design Using Th...mentioning
confidence: 99%
“…Harmony search (HS) is a novel heuristic optimization algorithm proposed by Geem et al [19] in 2001, which has attracted much public attention and was successfully applied in solving economic load dispatch problem [20], the switch location problem (SLP) [21], the design of steel frames [22], clustering [23], multicast routing [24], predicting the optimal cutting conditions [25], and the optimization of energy efficient network migration [26], while using HS algorithm to solve ASP problems has been rarely studied yet. To find a better way for solving ASP problems, an improved harmony search (IHS) is introduced here.…”
Section: Introductionmentioning
confidence: 99%