APPLICATION OF INTEGER CODING ACCELERATING GENETIC ALGORITHM IN RECTANGULAR CUTTING STOCK PROBLEM

An improved genetic algorithm and its application to resolve cutting stock problem arc presented. It is common to apply simple genetic algorithm （SGA） to cutting stock problem, but the huge amount of computing of SGA is a serious problem in practical application. Accelerating genetic algorithm （AGA） based on integer coding and AGA＇s detailed steps are developed to reduce the amount of computation, and a new kind of rectangular parts blank layout algorithm is designed for rectangular cutting stock problem. SGA is adopted to produce individuals within given evolution process, and the variation interval of these individuals is taken as initial domain of the next optimization process, thus shrinks searching range intensively and accelerates the evaluation process of SGA. To enhance the diversity of population and to avoid the algorithm stagnates at local optimization result, fixed number of individuals are produced randomly and replace the same number of parents in every evaluation process. According to the computational experiment, it is observed that this improved GA converges much sooner than SGA, and is able to get the balance of good result and high efficiency in the process of optimization for rectangular cutting stock problem.

Improved Hungarian algorithm for assignment problems of serial-parallel systems

In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.

AN SQP ALGORITHM WITH NONMONOTONE LINE SEARCHFOR GENERAL NONLINEAR CONSTRAINED OPTIMIZATION PROBLEM

In this paper, an SQP type algorithm with a new nonmonotone line search technique for general constrained optimization problems is presented. The new algorithm does not have to solve the second order correction subproblems for each iterations, but still can circumvent the so-called Maratos effect. The algorithm's global convergence and superlinear convergent rate have been proved. In addition, we can prove that, after a few iterations, correction subproblems need not be solved, so computation amount of the algorithm will be decreased much more. Numerical experiments show that the new algorithm is effective.

Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm

Based on the uncertainty theory, this paper is devoted to the redundancy allocation problem in repairable parallel-series systems with uncertain factors, where the failure rate, repair rate and other relative coefficients involved are considered as uncertain variables. The availability of the system and the corresponding designing cost are considered as two optimization objectives. A crisp multiobjective optimization formulation is presented on the basis of uncertainty theory to solve this resultant problem. For solving this problem efficiently, a new multiobjective artificial bee colony algorithm is proposed to search the Pareto efficient set, which introduces rank value and crowding distance in the greedy selection strategy, applies fast non-dominated sort procedure in the exploitation search and inserts tournament selection in the onlooker bee phase. It shows that the proposed algorithm outperforms NSGA-II greatly and can solve multiobjective redundancy allocation problem efficiently. Finally, a numerical example is provided to illustrate this approach.

An Effective Hybridization of Quantum-based Avian Navigation and Bonobo Optimizers to Solve Numerical and Mechanical Engineering Problems

Hybrid metaheuristic algorithms play a prominent role in improving algorithms' searchability by combining each algorithm's advantages and minimizing any substantial shortcomings. The Quantum-based Avian Navigation Optimizer Algorithm (QANA) is a recent metaheuristic algorithm inspired by the navigation behavior of migratory birds. Different experimental results show that QANA is a competitive and applicable algorithm in different optimization fields. However, it suffers from shortcomings such as low solution quality and premature convergence when tackling some complex problems. Therefore, instead of proposing a new algorithm to solve these weaknesses, we use the advantages of the bonobo optimizer to improve global search capability and mitigate premature convergence of the original QANA. The effectiveness of the proposed Hybrid Quantum-based Avian Navigation Optimizer Algorithm (HQANA) is assessed on 29 test functions of the CEC 2018 benchmark test suite with different dimensions, 30, 50, and 100. The results are then statistically investigated by the Friedman test and compared with the results of eight well-known optimization algorithms, including PSO, KH, GWO, WOA, CSA, HOA, BO, and QANA. Ultimately, five constrained engineering optimization problems from the latest test suite, CEC 2020 are used to assess the applicability of HQANA to solve complex real-world engineering optimization problems. The experimental and statistical findings prove that the proposed HQANA algorithm is superior to the comparative algorithms.