The selection of machining parameters directly affects the production time,quality,cost,and other process performance measures for multi-pass milling.Optimization of machining parameters is of great significance.Howev...The selection of machining parameters directly affects the production time,quality,cost,and other process performance measures for multi-pass milling.Optimization of machining parameters is of great significance.However,it is a nonlinear constrained optimization problem,which is very difficult to obtain satisfactory solutions by traditional optimization methods.A new optimization technique combined chaotic operator and imperialist competitive algorithm(ICA)is proposed to solve this problem.The ICA simulates the competition between the empires.It is a population-based meta-heuristic algorithm for unconstrained optimization problems.Imperialist development operator based on chaotic sequence is introduced to improve the local search of ICA,while constraints handling mechanism is introduced and an imperialist-colony transformation policy is established.The improved ICA is called chaotic imperialist competitive algorithm(CICA).A case study of optimizing machining parameters for multi-pass face milling operations is presented to verify the effectiveness of the proposed method.The case is to optimize parameters such as speed,feed,and depth of cut in each pass have yielded a minimum total product ion cost.The depth of cut of optimal strategy obtained by CICA are 4 mm,3 mm,1 mm for rough cutting pass 1,rough cutting pass 1 and finish cutting pass,respectively.The cost for each pass are$0.5366 US,$0.4473 US and$0.3738 US.The optimal solution of CICA for various strategies with at=8 mm is$1.3576 US.The results obtained with the proposed schemes are better than those of previous work.This shows the superior performance of CICA in solving such problems.Finally,optimization of cutting strategy when the width of workpiece no smaller than the diameter of cutter is discussed.Conclusion can be drawn that larger tool diameter and row spacing should be chosen to increase cutting efficiency.展开更多
The particle swarm optimization(PSO)algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and sh.PSO is essentially an unconstrained algorithm...The particle swarm optimization(PSO)algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and sh.PSO is essentially an unconstrained algorithm and requires constraint handling techniques(CHTs)to solve constrained optimization problems(COPs).For this purpose,we integrate two CHTs,the superiority of feasibility(SF)and the violation constraint-handling(VCH),with a PSO.These CHTs distinguish feasible solutions from infeasible ones.Moreover,in SF,the selection of infeasible solutions is based on their degree of constraint violations,whereas in VCH,the number of constraint violations by an infeasible solution is of more importance.Therefore,a PSO is adapted for constrained optimization,yielding two constrained variants,denoted SF-PSO and VCH-PSO.Both SF-PSO and VCH-PSO are evaluated with respect to ve engineering problems:the Himmelblau’s nonlinear optimization,the welded beam design,the spring design,the pressure vessel design,and the three-bar truss design.The simulation results show that both algorithms are consistent in terms of their solutions to these problems,including their different available versions.Comparison of the SF-PSO and the VCHPSO with other existing algorithms on the tested problems shows that the proposed algorithms have lower computational cost in terms of the number of function evaluations used.We also report our disagreement with some unjust comparisons made by other researchers regarding the tested problems and their different variants.展开更多
基金supported by the National Natural Science Foundation of China under grant no.51705182.
文摘The selection of machining parameters directly affects the production time,quality,cost,and other process performance measures for multi-pass milling.Optimization of machining parameters is of great significance.However,it is a nonlinear constrained optimization problem,which is very difficult to obtain satisfactory solutions by traditional optimization methods.A new optimization technique combined chaotic operator and imperialist competitive algorithm(ICA)is proposed to solve this problem.The ICA simulates the competition between the empires.It is a population-based meta-heuristic algorithm for unconstrained optimization problems.Imperialist development operator based on chaotic sequence is introduced to improve the local search of ICA,while constraints handling mechanism is introduced and an imperialist-colony transformation policy is established.The improved ICA is called chaotic imperialist competitive algorithm(CICA).A case study of optimizing machining parameters for multi-pass face milling operations is presented to verify the effectiveness of the proposed method.The case is to optimize parameters such as speed,feed,and depth of cut in each pass have yielded a minimum total product ion cost.The depth of cut of optimal strategy obtained by CICA are 4 mm,3 mm,1 mm for rough cutting pass 1,rough cutting pass 1 and finish cutting pass,respectively.The cost for each pass are$0.5366 US,$0.4473 US and$0.3738 US.The optimal solution of CICA for various strategies with at=8 mm is$1.3576 US.The results obtained with the proposed schemes are better than those of previous work.This shows the superior performance of CICA in solving such problems.Finally,optimization of cutting strategy when the width of workpiece no smaller than the diameter of cutter is discussed.Conclusion can be drawn that larger tool diameter and row spacing should be chosen to increase cutting efficiency.
基金The authors thank the Higher Education Commission,Pakistan,for supporting this research under the project NRPU-8925(M.A.J.and H.U.K.),https://www.hec.gowpk/。
文摘The particle swarm optimization(PSO)algorithm is an established nature-inspired population-based meta-heuristic that replicates the synchronizing movements of birds and sh.PSO is essentially an unconstrained algorithm and requires constraint handling techniques(CHTs)to solve constrained optimization problems(COPs).For this purpose,we integrate two CHTs,the superiority of feasibility(SF)and the violation constraint-handling(VCH),with a PSO.These CHTs distinguish feasible solutions from infeasible ones.Moreover,in SF,the selection of infeasible solutions is based on their degree of constraint violations,whereas in VCH,the number of constraint violations by an infeasible solution is of more importance.Therefore,a PSO is adapted for constrained optimization,yielding two constrained variants,denoted SF-PSO and VCH-PSO.Both SF-PSO and VCH-PSO are evaluated with respect to ve engineering problems:the Himmelblau’s nonlinear optimization,the welded beam design,the spring design,the pressure vessel design,and the three-bar truss design.The simulation results show that both algorithms are consistent in terms of their solutions to these problems,including their different available versions.Comparison of the SF-PSO and the VCHPSO with other existing algorithms on the tested problems shows that the proposed algorithms have lower computational cost in terms of the number of function evaluations used.We also report our disagreement with some unjust comparisons made by other researchers regarding the tested problems and their different variants.