Design of S-band photoinjector with high bunch charge and low emittance based on multi-objective genetic algorithm

High-brightness electron beams are required to drive LINAC-based free-electron lasers(FELs)and storage-ring-based synchrotron radiation light sources.The bunch charge and RMS bunch length at the exit of the LINAC play a crucial role in the peak current;the minimum transverse emittance is mainly determined by the injector of the LINAC.Thus,a photoin-jector with a high bunch charge and low emittance that can simultaneously provide high-quality beams for 4th generation synchrotron radiation sources and FELs is desirable.The design of a 1.6-cell S-band 2998-MHz RF gun and beam dynamics optimization of a relevant beamline are presented in this paper.Beam dynamics simulations were performed by combining ASTRA and the multi-objective genetic algorithm NSGA II.The effects of the laser pulse shape,half-cell length of the RF gun,and RF parameters on the output beam quality were analyzed and compared.The normalized transverse emittance was optimized to be as low as 0.65 and 0.92 mm·mrad when the bunch charge was as high as 1 and 2 nC,respectively.Finally,the beam stability properties of the photoinjector,considering misalignment and RF jitter,were simulated and analyzed.

Hydraulic Optimization of a Double-channel Pump's Impeller Based on Multi-objective Genetic Algorithm

Computational fluid dynamics（CFD） can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to improve such hydrodynamic performance. In this paper, a more convenient and effective approach is proposed by combined using of CFD, multi-objective genetic algorithm（MOGA） and artificial neural networks（ANN） for a double-channel pump＇s impeller, with maximum head and efficiency set as optimization objectives, four key geometrical parameters including inlet diameter, outlet diameter, exit width and midline wrap angle chosen as optimization parameters. Firstly, a multi-fidelity fitness assignment system in which fitness of impellers serving as training and comparison samples for ANN is evaluated by CFD, meanwhile fitness of impellers generated by MOGA is evaluated by ANN, is established and dramatically reduces the computational expense. Then, a modified MOGA optimization process, in which selection is performed independently in two sub-populations according to two optimization objectives, crossover and mutation is performed afterword in the merged population, is developed to ensure the global optimal solution to be found. Finally, Pareto optimal frontier is found after 500 steps of iterations, and two optimal design schemes are chosen according to the design requirements. The preliminary and optimal design schemes are compared, and the comparing results show that hydraulic performances of both pumps 1 and 2 are improved, with the head and efficiency of pump 1 increased by 5.7% and 5.2%, respectively in the design working conditions, meanwhile shaft power decreased in all working conditions, the head and efficiency of pump 2 increased by 11.7% and 5.9%, respectively while shaft power increased by 5.5%. Inner flow field analyses also show that the backflow phenomenon significantly diminishes at the entrance of the optimal impellers 1 and 2, both the area of vortex and intensity of vortex decreases in the whole flow channel. This paper provides a promising tool to solve the hydraulic optimization problem of pumps＇ impellers.

Sequencing Mixed-model Production Systems by Modified Multi-objective Genetic Algorithms

As two independent problems,scheduling for parts fabrication line and sequencing for mixed-model assembly line have been addressed respectively by many researchers.However,these two problems should be considered simultaneously to improve the efficiency of the whole fabrication/assembly systems.By far,little research effort is devoted to sequencing problems for mixed-model fabrication/assembly systems.This paper is concerned about the sequencing problems in pull production systems which are composed of one mixed-model assembly line with limited intermediate buffers and two flexible parts fabrication flow lines with identical parallel machines and limited intermediate buffers.Two objectives are considered simultaneously：minimizing the total variation in parts consumption in the assembly line and minimizing the total makespan cost in the fabrication/assembly system.The integrated optimization framework,mathematical models and the method to construct the complete schedules for the fabrication lines according to the production sequences for the first stage in fabrication lines are presented.Since the above problems are non-deterministic polynomial-hard（NP-hard）,a modified multi-objective genetic algorithm is proposed for solving the models,in which a method to generate the production sequences for the fabrication lines from the production sequences for the assembly line and a method to generate the initial population are put forward,new selection,crossover and mutation operators are designed,and Pareto ranking method and sharing function method are employed to evaluate the individuals＇ fitness.The feasibility and efficiency of the multi-objective genetic algorithm is shown by computational comparison with a multi-objective simulated annealing algorithm.The sequencing problems for mixed-model production systems can be solved effectively by the proposed modified multi-objective genetic algorithm.

Application of camera calibrating model to space manipulator with multi-objective genetic algorithm

The multi-objective genetic algorithm(MOGA) is proposed to calibrate the non-linear camera model of a space manipulator to improve its locational accuracy. This algorithm can optimize the camera model by dynamic balancing its model weight and multi-parametric distributions to the required accuracy. A novel measuring instrument of space manipulator is designed to orbital simulative motion and locational accuracy test. The camera system of space manipulator, calibrated by MOGA algorithm, is used to locational accuracy test in this measuring instrument. The experimental result shows that the absolute errors are [0.07, 1.75] mm for MOGA calibrating model, [2.88, 5.95] mm for MN method, and [1.19, 4.83] mm for LM method. Besides, the composite errors both of LM method and MN method are approximately seven times higher that of MOGA calibrating model. It is suggested that the MOGA calibrating model is superior both to LM method and MN method.

Workspace optimization of parallel robot by using multi-objective genetic algorithm

For the narrow workspace problem of the universal-prismatic-universal(UPU)parallel robotwith fixed orientation,a kind of multi-objective genetic algorithm is studied to optimize the robot’sworkspace.The concept of the effective workspace and its solution method are given.The effectiveworkspace height(EWH)and global condition number index(GCI)of Jacobi matrix are selected asthe optimized objective functions.Setting the robot in two different orientations,the geometric pa-rameters are optimized by the multi-objective genetic algorithm named non-dominated sorting geneticalgorithm II(NSGA-II),and a set of structural parameters is obtained.The optimization results areverified by four indicators with the robot’s moving platform at different orientations.The resultsshow that,after optimization,the fixed-orientation workspace volume,the effective workspace heightand the effective workspace volume increase by 32.4%,17.8%and 72.9%on average,respec-tively.GCI decreases by 6.8%on average.

Multi-Objective Genetic Algorithm to Design Manufacturing Process Line Including Feasible and Infeasible Solutions in Neighborhood

This paper treats multi-objective problem for manufacturing process design. A purpose of the process design is to decide combinations of work elements assigned to different work centers. Multiple work elements are ordinarily assigned to each center. Here, infeasible solutions are easily generated by precedence relationship of work elements in process design. The number of infeasible solutions generated is ordinarily larger than that of feasible solutions generated in the process. Therefore, feasible and infeasible solutions are located in any neighborhood in solution space. It is difficult to seek high quality Pareto solutions in this problem by using conventional multi-objective evolutional algorithms. We consider that the problem includes difficulty to seek high quality solutions by the following characteristics： （1） Since infeasible solutions are resemble to good feasible solutions, many infeasible solutions which have good values of objective functions are easily sought in the search process, （2） Infeasible solutions are useful to select new variable conditions generating good feasible solutions in search process. In this study, a multi-objective genetic algorithm including local search is proposed using these characteristics. Maximum value of average operation times and maximum value of dispersion of operation time in all work centers are used as objective functions to promote productivity. The optimal weighted coefficient is introduced to control the ratio of feasible solutions to all solutions selected in crossover and selection process in the algorithm. This paper shows the effectiveness of the proposed algorithm on simple model.

Optimal Test Points Selection Based on Multi-Objective Genetic Algorithm

A new approach to select anoptimal set of test points is proposed. The described method uses fault-wise table and multi-objective genetic algorithm to find the optimal set of test points. First, the fault-wise table is constructed whose entries are measurements associated with faults and test points. The selection of optimal test points is transformed to the selection of the columns that isolate the rows of the table. Then, four objectives are described according to practical test requirements. The multi-objective genetic algorithm is explained. Finally, the presented approach is illustrated by a practical example. The results indicate that the proposed method can efficiently and accurately find the optimal set of test points and is practical for large scale systems.

Satellite Constellation Design with Multi-Objective Genetic Algorithm for Regional Terrestrial Satellite Network

Constellations design for regional terrestrial-satellite network can strengthen the coverage for incomplete terrestrial cellular network. In this paper, a regional satellite constellation design scheme with multiple feature points and multiple optimization indicators is proposed by comprehensively considering multi-objective optimization and genetic algorithm, and "the Belt and Road" model is presented in the way of dividing over 70 nations into three regular target areas. Following this, we formulate the optimization model and devise a multi-objective genetic algorithm suited for the regional area with the coverage rate under simulating, computing and determining. Meanwhile, the total number of satellites in the constellation is reduced by calculating the ratio of actual coverage of a single-orbit constellation and the area of targets. Moreover, the constellations' performances of the proposed scheme are investigated with the connection of C++ and Satellite Tool Kit(STK). Simulation results show that the designed satellite constellations can achieve a good coverage of the target areas.

Performance optimization of electric power steering based on multi-objective genetic algorithm

The vehicle model of the recirculating ball-type electric power steering (EPS) system for the pure electric bus was built. According to the features of constrained optimization for multi-variable function, a multi-objective genetic algorithm (GA) was designed. Based on the model of system, the quantitative formula of the road feel, sensitivity, and operation stability of the steering were induced. Considering the road feel and sensitivity of steering as optimization objectives, and the operation stability of steering as constraint, the multi-objective GA was proposed and the system parameters were optimized. The simulation results show that the system optimized by multi-objective genetic algorithm has better road feel, steering sensibility and steering stability. The energy of steering road feel after optimization is 1.44 times larger than the one before optimization, and the energy of portability after optimization is 0.4 times larger than the one before optimization. The ground test was conducted in order to verify the feasibility of simulation results, and it is shown that the pure electric bus equipped with the recirculating ball-type EPS system can provide better road feel and better steering portability for the drivers, thus the optimization methods can provide a theoretical basis for the design and optimization of the recirculating ball-type EPS system.

Multi-objective genetic algorithm for the optimization of road surface cleaning process

The parameters affecting road surface cleaning using waterjets were researched and a fuzzy neural network method of calculating cleaning rate was provided. A genetic algorithm was used to configure the cleaning parameters of pressure, standoff distance, traverse rate and angle of nozzles for the optimization of the cleaning effectiveness, efficiency, energy and water con-sumption, and a multi-objective optimization model was established. After calculation, the optimized results and the trend of variation of cleaning effectiveness, efficiency, energy and water consumption in different weighting factors were analyzed.

A Hybrid Parallel Multi-Objective Genetic Algorithm for 0/1 Knapsack Problem

In this paper a hybrid parallel multi-objective genetic algorithm is proposed for solving 0/1 knapsack problem. Multi-objective problems with non-convex and discrete Pareto front can take enormous computation time to converge to the true Pareto front. Hence, the classical multi-objective genetic algorithms (MOGAs) (i.e., non- Parallel MOGAs) may fail to solve such intractable problem in a reasonable amount of time. The proposed hybrid model will combine the best attribute of island and Jakobovic master slave models. We conduct an extensive experimental study in a multi-core system by varying the different size of processors and the result is compared with basic parallel model i.e., master-slave model which is used to parallelize NSGA-II. The experimental results confirm that the hybrid model is showing a clear edge over master-slave model in terms of processing time and approximation to the true Pareto front.

Optimization of FX-70 refrigerant evaporative heat transfer and fluid flow characteristics inside the corrugated tubes using multi-objective genetic algorithm

In this study,the heat transfer optimization(evaporation)and the specification of the FX-70 zeotropic refrigerant flow inside a corrugated pipe have been investigated.Despite the low HTC(HTC),this type of refrigerant is highly applicable in low or medium temperature engineering systems during the evaporation process.To eliminate this defect,high turbulence and proper mixing are required.Therefore,using heat transfer(HT)augmentation methods will be necessary and effective.In order to find the most favorable operating conditions that lead to the optimum combination of pressure drop(PD)and HTC,empirical data,neural networks,and genetic algorithms(GA)for multi-objective(MO)(NSGA II)are used.To investigate the mentioned cases,the geometric parameters of corrugated pipes,vapor quality,and mass velocity of refrigerant were studied.The results showed that with vapor quality higher than 0.8 and corrugation depth and pitch of 1.5 and 7 mm,respectively,we would achieve the desired optimum design.

A Multi-Objective Genetic Algorithm for Optimal Portfolio Problems

This paper concerns with modeling and design of an algorithm for the portfolio selection problems with fixed transaction costs and minimum transaction lots. A mean-variance model for the portfolio selection problem is proposed, and the model is formulated as a non-smooth and nonlinear integer programming problem with multiple objective functions. As it has been proven that finding a feasible solution to the problem only is already NP-hard, based on NSGA-II and genetic algorithm for numerical optimization of constrained problems (Genocop), a multi-objective genetic algorithm (MOGA) is designed to solve the model. Its features comprise integer encoding and corresponding operators, and special treatment of constraints conditions. It is illustrated via a numerical example that the genetic algorithm can efficiently solve portfolio selection models proposed in this paper. This approach offers promise for the portfolio problems in practice.

The Use of Multi-Objective Genetic Algorithm Based Approach to Create Ensemble of ANN for Intrusion Detection

Due to our increased dependence on Internet and growing number of intrusion incidents, building effective intrusion detection systems are essential for protecting Internet resources and yet it is a great challenge. In literature, many researchers utilized Artificial Neural Networks (ANN) in supervised learning based intrusion detection successfully. Here, ANN maps the network traffic into predefined classes i.e. normal or specific attack type based upon training from label dataset. However, for ANN-based IDS, detection rate (DR) and false positive rate (FPR) are still needed to be improved. In this study, we propose an ensemble approach, called MANNE, for ANN-based IDS that evolves ANNs by Multi Objective Genetic algorithm to solve the problem. It helps IDS to achieve high DR, less FPR and in turn high intrusion detection capability. The procedure of MANNE is as follows: firstly, a Pareto front consisting of a set of non-dominated ANN solutions is created using MOGA, which formulates the base classifiers. Subsequently, based upon this pool of non-dominated ANN solutions as base classifiers, another Pareto front consisting of a set of non-dominated ensembles is created which exhibits classification tradeoffs. Finally, prediction aggregation is done to get final ensemble prediction from predictions of base classifiers. Experimental results on the KDD CUP 1999 dataset show that our proposed ensemble approach, MANNE, outperforms ANN trained by Back Propagation and its ensembles using bagging & boosting methods in terms of defined performance metrics. We also compared our approach with other well-known methods such as decision tree and its ensembles using bagging & boosting methods.

Study on Optimization of Urban Rail Train Operation Control Curve Based on Improved Multi-Objective Genetic Algorithm

A multi-objective improved genetic algorithm is constructed to solve the train operation simulation model of urban rail train and find the optimal operation curve.In the train control system,the conversion point of operating mode is the basic of gene encoding and the chromosome composed of multiple genes represents a control scheme,and the initial population can be formed by the way.The fitness function can be designed by the design requirements of the train control stop error,time error and energy consumption.the effectiveness of new individual can be ensured by checking the validity of the original individual when its in the process of selection,crossover and mutation,and the optimal algorithm will be joined all the operators to make the new group not eliminate on the best individual of the last generation.The simulation result shows that the proposed genetic algorithm comparing with the optimized multi-particle simulation model can reduce more than 10%energy consumption,it can provide a large amount of sub-optimal solution and has obvious optimization effect.

Two Multi-Objective Genetic Algorithms for Finding Optimum Design of an I-beam

Many engineering design problems are characterized by presence of several conflicting objectives. This requires efficient search of the feasible design region for optimal solutions which simultaneously satisfy multiple design objectives. Genetic algorithm optimization (GAO) is a powerful search technique with faster convergence rates than traditional evolutionary algorithms. This paper applies two GAO-based approaches to multi-objective engineering design and finds design variables through the feasible space. To demonstrate the utility of the proposed methods, the multi-objective design of an I-beam will be presented.

MOALG: A Metaheuristic Hybrid of Multi-Objective Ant Lion Optimizer and Genetic Algorithm for Solving Design Problems

This study proposes a hybridization of two efficient algorithm’s Multi-objective Ant Lion Optimizer Algorithm(MOALO)which is a multi-objective enhanced version of the Ant Lion Optimizer Algorithm(ALO)and the Genetic Algorithm(GA).MOALO version has been employed to address those problems containing many objectives and an archive has been employed for retaining the non-dominated solutions.The uniqueness of the hybrid is that the operators like mutation and crossover of GA are employed in the archive to update the solutions and later those solutions go through the process of MOALO.A first-time hybrid of these algorithms is employed to solve multi-objective problems.The hybrid algorithm overcomes the limitation of ALO of getting caught in the local optimum and the requirement of more computational effort to converge GA.To evaluate the hybridized algorithm’s performance,a set of constrained,unconstrained test problems and engineering design problems were employed and compared with five well-known computational algorithms-MOALO,Multi-objective Crystal Structure Algorithm(MOCryStAl),Multi-objective Particle Swarm Optimization(MOPSO),Multi-objective Multiverse Optimization Algorithm(MOMVO),Multi-objective Salp Swarm Algorithm(MSSA).The outcomes of five performance metrics are statistically analyzed and the most efficient Pareto fronts comparison has been obtained.The proposed hybrid surpasses MOALO based on the results of hypervolume(HV),Spread,and Spacing.So primary objective of developing this hybrid approach has been achieved successfully.The proposed approach demonstrates superior performance on the test functions,showcasing robust convergence and comprehensive coverage that surpasses other existing algorithms.

An Improved Multi-Objective Hybrid Genetic-Simulated Annealing Algorithm for AGV Scheduling under Composite Operation Mode

This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aims to minimize the maximum completion time,the total distance covered by AGVs,and the distance traveled while empty-loaded.The improved hybrid algorithm combines the improved genetic algorithm(GA)and the simulated annealing algorithm(SA)to strengthen the local search ability of the algorithm and improve the stability of the calculation results.Based on the characteristics of the composite operation mode,the authors introduce the combined coding and parallel decoding mode and calculate the fitness function with the grey entropy parallel analysis method to solve the multi-objective problem.The grey entropy parallel analysis method is a combination of the grey correlation analysis method and the entropy weighting method to solve multi-objective solving problems.A task advance evaluation strategy is proposed in the process of crossover and mutation operator to guide the direction of crossover and mutation.The computational experiments results show that the improved hybrid algorithm is better than the GA and the genetic algorithm with task advance evaluation strategy(AEGA)in terms of convergence speed and solution results,and the effectiveness of the multi-objective solution is proved.All three objectives are optimized and the proposed algorithm has an optimization of 7.6%respectively compared with the GA and 3.4%compared with the AEGA in terms of the objective of maximum completion time.

Multi-Objective Optimization of VBHF in Deep Drawing Based on the Improved QO-Jaya Algorithm

Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of deep drawing.The variable blank holder force(VBHF)varying with the drawing stage can overcome this problem at an extent.The optimization of VBHF is to determine the optimal BHF in every deep drawing stage.In this paper,a new heuristic optimization algorithm named Jaya is introduced to solve the optimization efficiently.An improved“Quasi-oppositional”strategy is added to Jaya algorithm for improving population diversity.Meanwhile,an innovated stop criterion is added for better convergence.Firstly,the quality evaluation criteria for wrinkling and tearing are built.Secondly,the Kriging models are developed to approximate and quantify the relation between VBHF and forming defects under random sampling.Finally,the optimization models are established and solved by the improved QO-Jaya algorithm.A VBHF optimization example of component with complicated shape and thin wall is studied to prove the effectiveness of the improved Jaya algorithm.The optimization results are compared with that obtained by other algorithms based on the TOPSIS method.

Multi-Strategy Assisted Multi-Objective Whale Optimization Algorithm for Feature Selection

In classification problems,datasets often contain a large amount of features,but not all of them are relevant for accurate classification.In fact,irrelevant features may even hinder classification accuracy.Feature selection aims to alleviate this issue by minimizing the number of features in the subset while simultaneously minimizing the classification error rate.Single-objective optimization approaches employ an evaluation function designed as an aggregate function with a parameter,but the results obtained depend on the value of the parameter.To eliminate this parameter’s influence,the problem can be reformulated as a multi-objective optimization problem.The Whale Optimization Algorithm(WOA)is widely used in optimization problems because of its simplicity and easy implementation.In this paper,we propose a multi-strategy assisted multi-objective WOA(MSMOWOA)to address feature selection.To enhance the algorithm’s search ability,we integrate multiple strategies such as Levy flight,Grey Wolf Optimizer,and adaptive mutation into it.Additionally,we utilize an external repository to store non-dominant solution sets and grid technology is used to maintain diversity.Results on fourteen University of California Irvine(UCI)datasets demonstrate that our proposed method effectively removes redundant features and improves classification performance.The source code can be accessed from the website:https://github.com/zc0315/MSMOWOA.