Machining Parameters Optimization of Multi-Pass Face Milling Using a Chaotic Imperialist Competitive Algorithm with an Efficient Constraint-Handling Mechanism

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.

A Novel Two-Level Optimization Strategy for Multi-Debris Active Removal Mission in LEO

Recent studies of the space debris environment in Low Earth Orbit(LEO)have shown that the critical density of space debris has been reached in certain regions.The Active Debris Removal(ADR)mission,to mitigate the space debris density and stabilize the space debris environment,has been considered as a most effective method.In this paper,a novel two-level optimization strategy for multi-debris removal mission in LEO is proposed,which includes the low-level and high-level optimization process.To improve the overall performance of the multi-debris active removal mission and obtain multiple Pareto-optimal solutions,the ADR mission is seen as a Time-Dependant Traveling Salesman Problem(TDTSP)with two objective functions to minimize the total mission duration and the total propellant consumption.The problem includes the sequence optimization to determine the sequence of removal of space debris and the transferring optimization to define the orbital maneuvers.Two optimization models for the two-level optimization strategy are built in solving the multi-debris removal mission,and the optimal Pareto solution is successfully obtained by using the non-dominated sorting genetic algorithm II(NSGA-II).Two test cases are presented,which show that the low level optimization strategy can successfully obtain the optimal sequences and the initial solution of the ADR mission and the high level optimization strategy can efficiently and robustly find the feasible optimal solution for long duration perturbed rendezvous problem.

AN AUGMENTED LAGRANGIAN TRUST REGION METHOD WITH A BI-OBJECT STRATEGY

An augmented Lagrangian trust region method with a bi=object strategy is proposed for solving nonlinear equality constrained optimization, which falls in between penalty-type methods and penalty-free ones. At each iteration, a trial step is computed by minimizing a quadratic approximation model to the augmented Lagrangian function within a trust region. The model is a standard trust region subproblem for unconstrained optimization and hence can efficiently be solved by many existing methods. To choose the penalty parameter, an auxiliary trust region subproblem is introduced related to the constraint violation. It turns out that the penalty parameter need not be monotonically increasing and will not tend to infinity. A bi-object strategy, which is related to the objective function and the measure of constraint violation, is utilized to decide whether the trial step will be accepted or not. Global convergence of the method is established under mild assumptions. Numerical experiments are made, which illustrate the efficiency of the algorithm on various difficult situations.

A Line Search SQP-type Method with Bi-object Strategy for Nonlinear Semidefinite Programming

We propose a line search exact penalty method with bi-object strategy for nonlinear semidefinite programming.At each iteration,we solve a linear semidefinite programming to test whether the linearized constraints are consistent or not.The search direction is generated by a piecewise quadratic-linear model of the exact penalty function.The penalty parameter is only related to the information of the current iterate point.The line search strategy is a penalty-free one.Global and local convergence are analyzed under suitable conditions.We finally report some numerical experiments to illustrate the behavior of the algorithm on various degeneracy situations.