Cargando…
A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings
Optimization of machining parameters is an important problem in the modern manufacturing world due to production efficiency and economics. This problem is well known to be complex and is regarded as a strongly nondeterministic polynomial (NP)-hard problem. To reduce the production cost of work-piece...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8890851/ https://www.ncbi.nlm.nih.gov/pubmed/35251149 http://dx.doi.org/10.1155/2022/4719266 |
_version_ | 1784661737194127360 |
---|---|
author | Huang, Xingwang He, Zongbao Chen, Yong Xie, Shutong |
author_facet | Huang, Xingwang He, Zongbao Chen, Yong Xie, Shutong |
author_sort | Huang, Xingwang |
collection | PubMed |
description | Optimization of machining parameters is an important problem in the modern manufacturing world due to production efficiency and economics. This problem is well known to be complex and is regarded as a strongly nondeterministic polynomial (NP)-hard problem. To reduce the production cost of work-pieces in computer numerical control (CNC) machining, a novel optimization algorithm based on a combination of the bat algorithm and a divide-and-conquer strategy is proposed. First, the basic bat algorithm (BA) is modified with the aim to avoid finding the local optimal solution. In addition, a Gaussian quantum bat algorithm with direction of mean best position is developed. Second, in order to reduce the complexity of the optimization problem, the whole optimization problem is divided into several subproblems by using a divide-and-conquer strategy according to the characteristic of multipass turning operations. Finally, under a large number of machining constraints, the cutting parameters of the two stages of roughing and finishing are simultaneously optimized. Simulation results show that the proposed algorithm can find better combinations of the machining parameters than other algorithms proposed previously to further reduce the production cost. In addition, the outcome of our work presents a novel way to solve the complex optimization problem of machining parameters with a combination of traditional mathematical methods and swarm intelligence algorithms. |
format | Online Article Text |
id | pubmed-8890851 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Hindawi |
record_format | MEDLINE/PubMed |
spelling | pubmed-88908512022-03-03 A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings Huang, Xingwang He, Zongbao Chen, Yong Xie, Shutong Comput Intell Neurosci Research Article Optimization of machining parameters is an important problem in the modern manufacturing world due to production efficiency and economics. This problem is well known to be complex and is regarded as a strongly nondeterministic polynomial (NP)-hard problem. To reduce the production cost of work-pieces in computer numerical control (CNC) machining, a novel optimization algorithm based on a combination of the bat algorithm and a divide-and-conquer strategy is proposed. First, the basic bat algorithm (BA) is modified with the aim to avoid finding the local optimal solution. In addition, a Gaussian quantum bat algorithm with direction of mean best position is developed. Second, in order to reduce the complexity of the optimization problem, the whole optimization problem is divided into several subproblems by using a divide-and-conquer strategy according to the characteristic of multipass turning operations. Finally, under a large number of machining constraints, the cutting parameters of the two stages of roughing and finishing are simultaneously optimized. Simulation results show that the proposed algorithm can find better combinations of the machining parameters than other algorithms proposed previously to further reduce the production cost. In addition, the outcome of our work presents a novel way to solve the complex optimization problem of machining parameters with a combination of traditional mathematical methods and swarm intelligence algorithms. Hindawi 2022-02-23 /pmc/articles/PMC8890851/ /pubmed/35251149 http://dx.doi.org/10.1155/2022/4719266 Text en Copyright © 2022 Xingwang Huang et al. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Article Huang, Xingwang He, Zongbao Chen, Yong Xie, Shutong A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings |
title | A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings |
title_full | A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings |
title_fullStr | A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings |
title_full_unstemmed | A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings |
title_short | A Divide-and-Conquer Bat Algorithm with Direction of Mean Best Position for Optimization of Cutting Parameters in CNC Turnings |
title_sort | divide-and-conquer bat algorithm with direction of mean best position for optimization of cutting parameters in cnc turnings |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8890851/ https://www.ncbi.nlm.nih.gov/pubmed/35251149 http://dx.doi.org/10.1155/2022/4719266 |
work_keys_str_mv | AT huangxingwang adivideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings AT hezongbao adivideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings AT chenyong adivideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings AT xieshutong adivideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings AT huangxingwang divideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings AT hezongbao divideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings AT chenyong divideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings AT xieshutong divideandconquerbatalgorithmwithdirectionofmeanbestpositionforoptimizationofcuttingparametersincncturnings |