Research on Optimizing Intelligent Test Paper Forming Strategy Based on Improved Genetic Algorithms

Intelligent test paper generation problem is a multi-objective parameter optimization problem under certain constraints, which has been realized by many algorithms. However, the existing intelligent test paper generation mostly adopts a single algorithm, and each algorithm has its own shortcomings. Sometimes it is inevitable to fall into the defects of the single algorithm in the process of test paper generation. Therefore, a mathematical model of intelligent test paper generation is proposed, which combines the advantages of artificial fish swarm algorithm and genetic algorithm to form a hybrid intelligent algorithm. At the beginning of intelligent test paper generation, the artificial fish swarm algorithm is used to quickly approach the test paper goal. In the process of test paper generation, when the optimal individual has no change or extremely small change in consecutive iterations, the genetic algorithm is used to jump the artificial fish individual to improve the convergence speed. The simulation results show that the hybrid intelligent algorithm can effectively optimize the effect of intelligent test paper generation by using a single algorithm alone.

With the wide application of online examinations in colleges and universities, intelligent test paper generation technology has become a hot topic. In this paper, we propose an improved genetic simulated annealing algorithm (GSA) and apply it to the test paper generation process to improve the quality and speed of intelligent test paper generation. Firstly, we optimize the genetic operators in real number coding and introduce an adaptive adjustment strategy on the premise of maintaining individual diversity. Secondly, we apply simulated annealing to individuals of each generation. Finally, we conduct abundant experiments. The results show that the improved algorithm can promote the success rate of test paper generation and effectively enhance the quality of test paper.

In order to solve the problems such as blindfold search, slower convergence, and sometimes unsuccessfully search in the present genetic algorithms used for intelligent test paper generation, this paper introduces an improved genetic algorithm for intelligent test paper generation. This algorithm generates optimized initial chromosome group and controlling crossing and variation recurring to test paper parameters and randomization. Consequently, it can avoid the problems of blind search and slower convergence resulted by complete randomization controlling adopted by the present genetic algorithms. At last, this paper proves the improved genetic algorithm can better solve the intelligent test paper generation problem compared to present genetic algorithms mentioned in algorithm analysis section of this paper.

Conventional mathematics methods are extensively adopted in the most test paper generation systems, but these methods can't deal with multi-objective optimization question of more than one constrains effectively. This paper proposes an improved parallel GA(Genetic Algorithm) with good adaptability and universal applicability, which is used in test paper generation. The experiment results indicate that the algorithm is more adaptively and faster than conventional parallel GA, and improve the intelligent level of the test paper generation system effectively.

Intelligent test paper generation belongs to an important research topic in the field of computer-aided education. Among them, Genetic Algorithm (GA), as an algorithm with high efficiency and performance, is widely used in the intelligent test paper generating system. But generally speaking, traditional GA always has some problems, such as local optimal solution and prematurity. The traditional genetic algorithm is improved in the aspects of the initial population, fitness function and some genetic operators to make it more in line with the requirements of intelligent paper generation, improving the efficiency and success ratio.

Aiming at solving the low efficiency and low quality of the existing test paper generation algorithm, this paper proposes an improved particle swarm algorithm, a new algorithm for intelligent test paper generation. Firstly, the paper conducts mathematically modeling based on item response theory. Secondly, in the new algorithm, the inertia weight is expressed as functions of particle evolution velocity and particle aggregation by defining particle evolution velocity and particle aggregation so that the inertia weight has adaptability. At the same time, slowly varying function is introduced to the traditional location updating formula so that the local optimal solution can be effectively overcome. Finally, simulation results show that compared with the quantum-behaved particle swarm algorithm, the proposed algorithm has better performance in success rate and composing efficiency.

In this paper, in order to solve the problem of intelligent test paper, the author puts forward the improvement on chromosome coding, mutation algorithm and genetic operators of genetic algorithm after the study of genetic algorithm in theory and then proposes a multi-objective function optimization algorithm. By experimental simulation, it is concluded that, compared with the ordinary genetic algorithm, the average fitness value of the improved algorithm has increased, moreover the average number of iterations and the time consumption has reduced. What's more, when the improved algorithm is applied to the enterprise appraisal, it is proved by experiments that the advantage of low repetition rate to realize the intelligent test paper, the success rate of test paper is 100%, and the repetition rate is 0.9%. Thus the superiority of the improved algorithm is reflected very well.

The cost of a new ship design heavily depends on the principal dimensions of the ship; however, dimensions minimization often conflicts with the minimum oil outflow (in the event of an accidental spill). This study demonstrates one rational methodology for selecting the optimal dimensions and coefficients of form of tankers via the use of a genetic algorithm. Therein, a multi-objective optimization problem was formulated by using two objective attributes in the evaluation of each design, specifically, total cost and mean oil outflow. In addition, a procedure that can be used to balance the designs in terms of weight and useful space is proposed. A genetic algorithm was implemented to search for optimal design parameters and to identify the nondominated Pareto frontier. At the end of this study, three real ships are used as case studies.

Genetic Algorithm (GA) is a very popular evolutionary technique that has been used for single and multi-objective optimization problems. MATLAB, a widely used technical computing language, has its own variant of these algorithms included along with its optimization toolbox. Since this allows for easy implementation, it has been widely used to solve various engineering problems. The performances of the inbuilt single and multi-objective algorithms of GA at default settings are studied on a total of 29 benchmark functions. The single objective ga is tested on a set of fourteen popularly used single objective benchmark functions whereas the multi-objective gamultiobj is tested on five of the Zitzler-Deb-Thiele's (ZDT) problems and the ten unconstrained problems from the CEC2009 algorithm competition.

This paper presents a new multi-objective optimization method, which is inspired from the idea of non-dominated sorting genetic algorithm (NSGA) and genetic quantum algorithm (GQA). The GQA has been tested on well known test beds in single objective optimization and compared with the genetic algorithm (GA) in the lead author’s previous work [22]. This paper aims to apply the idea of GQA to multi-objective optimization (MOO). The developed method is called non-dominated sorting genetic quantum algorithm (NSGQA). The developed method is tested with benchmark problems collected from literature, which have characteristics representing various aspects of a MOO problem. Test results show that NSGQA has better performance on most benchmark problems than currently popular MOO methods such as the NSGA. The integration of GQA with MOO, and the systematic comparison with other MOO methods on benchmark problems, should be of general interest to researchers on MOO and to practitioners using MOO methods in design.

Due to the conflict between reducing cost and improving water supply performance, how to select the appropriate pipe diameter is a current challenge. In this paper, the problem is transformed into a multi-objective optimization problem, and the evolutionary genetic optimization algorithm is used to solve the problem to determine the optimal selection of pipe diameter in the pipe network. To solve this problem, the evolutionary genetic algorithm was coupled with EPANET hydraulic simulation software in Python environment. The results show that NSGA-II and NSGA-III perform better in two typical case tests. Moreover, the increase of the objective functions will lead to an increase in the amount of data in the optimal solution set, and will affect the optimal value of each objective function. That shows that the balance between the economy and reliability of water supply can be successfully found by coupling the hydraulic model and the multi-objective optimization algorithm, which can provide an auxiliary decision for enterprises.

Genetic algorithm based multi-objective reliability optimization in interval environment

Although various optimization methods for solving single-objective problems have been developed in the last few decades, these methods have lost their eligibility due to the fact that today’s engineering problems are toward multiple objective optimization problems, in real applications. For single-objective optimization problems, for example, in case of a minimization problem, this value is the decision vector giving the smallest objective that can be achieved within the specified constraints. Hence the minimum decision vector within all possible (feasible) solution vectors is the so-called optimal solution and/or optimal design. However, in multi-objective optimization problems, since a different objective value is generated against each decision vector, the superiority of the solutions over each other is determined by considering the trade-off among the objective values. Therefore, the solution of multi-objective optimization problems, unlike single-objective problems, is a set of vectors rather than a single decision vector. In multi-objective optimization problems, especially if there are intricate objectives, the computational cost of the problem increases. In other words, while synchronously trying to maximize one of the objectives and to minimize another one makes it difficult to find the global optimum design. One of the important techniques used in multi-objective optimization problems is Pareto optimality which enables to select the global optimum solution taking into account the trade-off among all objectives. In this context, using of derivative-based methods has decreased, but the use of metaheuristic methods has increased due to the rapid availability of global optimum solution. This is because the improvements in the field of optimization are progressing in proportion to technology and varying according to the needs. In this chapter, one of the recent metaheuristic optimization methods based on swarm intelligence that is so-called a Pareto-based bat algorithm inspired by the behavior of determining the direction and distance of an object using the echo of the sound called the echolocation of bats is used in order to obtain optimum solutions for multi-objective engineering design problems. In this regard, a four-bar planar truss, a real-sized welded steel beam as well as a multi-layer radar absorber are selected as multi-objective engineering design optimization problems. In case the obtained results (optimal designs) are examined, the potency and the reliability of the proposed multi-objective Pareto-based bat algorithm are demonstrated.

The aim of the work is to create a scenario modeling technique based on adaptation of metaheuristic multi-objective optimization algorithms to construct Pareto-optimal investment portfolios taking into account multiple restrictions on the company's portfolio. Investment portfolio is a tool for company's resources management. The process of portfolio construction through a combination of individual investment projects aims to optimize available resources utilization. Currently, there is no single approach to determining the optimal portfolio, since portfolio requirements depend on a particular company. Due to its simplicity in terms of implementation, approaches based on the ranking of projects according to individual technical and economic indicators are widely used. However, if a company needs to take into account several indicators, then this approach is not applicable. An effective solution to this problem is to create a technique that allows to find Pareto-optimal portfolios. In this work, the problem statement and analysis of existing solving approaches were carried out. Based on that, methodology of scenario modeling of a company's portfolio was created. The posed problem belongs to the class of NP-hard problems and for its efficient solving it is necessary to use metaheuristic algorithms. These algorithms include genetic algorithms, variable neighborhood search, bees algorithm, etc. Genetic algorithm NSGA-II is widely used for solving multi-objective optimization problems due to its high performance and ease of use. This algorithm was adapted to solve proposed problem. Based on it, a methodology was developed for the formation of Pareto-optimal investment portfolios, taking into account financial and infrastructural restrictions. Testing of the methodology was carried out on a dataset of synthetic projects simulating real investment projects. Various combinations of this projects simulated investment portfolios. The optimization objectives were maximization of net present value (NPV), maximization of cumulative oil production and minimization of total investments. In order to control the quality of the results obtained using genetic algorithm, the problem was also solved by using variable neighborhood search. However, the quality of the results obtained using genetic algorithm was higher. Analysis of the results allows us to consider the use of multi-objective optimization as a tool for forming a pool of investment portfolios, which provides flexible company management. In the proposed work, it is shown that the problem of scenario-based modeling of company's investment portfolio can be considered as a multi-objective optimization problem. Based on the existing metaheuristic algorithms, a Pareto-optimal investment portfolio search methodology has been developed. Proposed methodology can effectively solve the problem of managing company resources.

This paper considers the combined use of a hybrid numerical method for the modeling of acoustic mufflers and a genetic algorithm for multiobjective optimization. The hybrid numerical method provides accurate modeling of sound propagation in uniform waveguides with non-uniform obstructions. It is based on coupling a wave based modal solution in the uniform sections of the waveguide to a finite element solution in the non-uniform component. Finite element method provides flexible modeling of complicated geometries, varying material parameters, and boundary conditions, while the wave based solution leads to accurate treatment of non-reflecting boundaries and straightforward computation of the transmission loss (TL) of the muffler. The goal of optimization is to maximize TL at multiple frequency ranges simultaneously by adjusting chosen shape parameters of the muffler. This task is formulated as a multiobjective optimization problem with the objectives depending on the solution of the simulation model. NSGA-II genetic algorithm is used for solving the multiobjective optimization problem. Genetic algorithms can be easily combined with different simulation methods, and they are not sensitive to the smoothness properties of the objective functions. Numerical experiments demonstrate the accuracy and feasibility of the model-based optimization method in muffler design.