Memetic Cuckoo-Search-Based Optimization in Machining Galvanized Iron

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F20%3A10245461" target="_blank" >RIV/61989100:27230/20:10245461 - isvavai.cz</a>
Result on the web
<a href="http://hhttp://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=D3IM4vg87ulX5tzUhCZ&page=1&doc=2" target="_blank" >http://hhttp://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=D3IM4vg87ulX5tzUhCZ&page=1&doc=2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/ma13143047" target="_blank" >10.3390/ma13143047</a>

Result language
angličtina
Original language name
Memetic Cuckoo-Search-Based Optimization in Machining Galvanized Iron
Original language description
In this article, an improved variant of the cuckoo search (CS) algorithm named Coevolutionary Host-Parasite (CHP) is used for maximizing the metal removal rate in a turning process. The spindle speed, feed rate and depth of cut are considered as the independent parameters that describe the metal removal rate during the turning operation. A data-driven second-order polynomial regression approach is used for this purpose. The training dataset is designed using an L16 orthogonal array. The CHP algorithm is effective in quickly locating the global optima. Furthermore, CHP is seen to be sufficiently robust in the sense that it is able to identify the optima on independent reruns. The CHP predicted optimal solution presents +/- 10% deviations in the optimal process parameters, which shows the robustness of the optimal solution.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20300 - Mechanical engineering

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)