scholarly journals Multiswarm Multiobjective Particle Swarm Optimization with Simulated Annealing for Extracting Multiple Tests

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Toan Bui ◽  
Tram Nguyen ◽  
Huy M. Huynh ◽  
Bay Vo ◽  
Jerry Chun-Wei Lin ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm ◽  
Test Duration ◽  
Swarm Optimization ◽  
Multiple Tests ◽  
Multiple Choice Tests ◽  
Multiobjective Particle Swarm Optimization ◽  
Choice Tests ◽  
Single Objective

Education is mandatory, and much research has been invested in this sector. An important aspect of education is how to evaluate the learners’ progress. Multiple-choice tests are widely used for this purpose. The tests for learners in the same exam should come in equal difficulties for fair judgment. Thus, this requirement leads to the problem of generating tests with equal difficulties, which is also known as the specific case of generating tests with a single objective. However, in practice, multiple requirements (objectives) are enforced while making tests. For example, teachers may require the generated tests to have the same difficulty and the same test duration. In this paper, we propose the use of Multiswarm Multiobjective Particle Swarm Optimization (MMPSO) for generating k tests with multiple objectives in a single run. Additionally, we also incorporate Simulated Annealing (SA) to improve the diversity of tests and the accuracy of solutions. The experimental results with various criteria show that our approaches are effective and efficient for the problem of generating multiple tests.

scholarly journals Multi-Swarm Single-Objective Particle Swarm Optimization to Extract Multiple-Choice Tests

2019 ◽  
Vol 06 (02) ◽  
pp. 147-161 ◽  
Author(s):  
Tram Nguyen ◽  
Toan Bui ◽  
Bay Vo
Keyword(s):  
Particle Swarm Optimization ◽  
Multiple Choice ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Difficulty Level ◽  
Swarm Optimization ◽  
Multiple Choice Tests ◽  
Choice Tests ◽  
Time Standard ◽  
Number Of Particles

This paper proposes the use of multi-swarm method in particle swarm optimization (PSO) algorithm to generate multiple-choice tests based on assumed objective levels of difficulty. The method extracts an abundance of tests at the same time with the same levels of difficulty and approximates the difficulty-level requirement given by the users. The experimental results show that the proposed method can generate many tests from question banks satisfying predefined levels of difficulty. Additionally, the proposed method is also shown to be effective in terms of many criteria when compared with other methods such as manually extracted tests, random methods and PSO-based methods in terms of execution time, standard deviation, the number of particles per swarm and the number of swarms.

scholarly journals Knowledge-guided multiobjective particle swarm optimization with fusion learning strategies

2021 ◽  
Author(s):  
Wei Li ◽  
Xiang Meng ◽  
Ying Huang ◽  
Soroosh Mahmoodi
Keyword(s):  
Particle Swarm Optimization ◽  
Learning Strategies ◽  
Learning Strategy ◽  
Particle Swarm ◽  
Population Diversity ◽  
Selection Strategy ◽  
Rapid Loss ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization

AbstractMultiobjective particle swarm optimization (MOPSO) algorithm faces the difficulty of prematurity and insufficient diversity due to the selection of inappropriate leaders and inefficient evolution strategies. Therefore, to circumvent the rapid loss of population diversity and premature convergence in MOPSO, this paper proposes a knowledge-guided multiobjective particle swarm optimization using fusion learning strategies (KGMOPSO), in which an improved leadership selection strategy based on knowledge utilization is presented to select the appropriate global leader for improving the convergence ability of the algorithm. Furthermore, the similarity between different individuals is dynamically measured to detect the diversity of the current population, and a diversity-enhanced learning strategy is proposed to prevent the rapid loss of population diversity. Additionally, a maximum and minimum crowding distance strategy is employed to obtain excellent nondominated solutions. The proposed KGMOPSO algorithm is evaluated by comparisons with the existing state-of-the-art multiobjective optimization algorithms on the ZDT and DTLZ test instances. Experimental results illustrate that KGMOPSO is superior to other multiobjective algorithms with regard to solution quality and diversity maintenance.

scholarly journals Asteroid Rendezvous Mission Design Using Multiobjective Particle Swarm Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Ya-zhong Luo ◽  
Li-ni Zhou
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Mission Design ◽  
Trajectory Design ◽  
Time Transfer ◽  
Pareto Solution ◽  
Swarm Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Asteroid Mission

A new preliminary trajectory design method for asteroid rendezvous mission using multiobjective optimization techniques is proposed. This method can overcome the disadvantages of the widely employed Pork-Chop method. The multiobjective integrated launch window and multi-impulse transfer trajectory design model is formulated, which employes minimum-fuel cost and minimum-time transfer as two objective functions. The multiobjective particle swarm optimization (MOPSO) is employed to locate the Pareto solution. The optimization results of two different asteroid mission designs show that the proposed approach can effectively and efficiently demonstrate the relations among the mission characteristic parameters such as launch time, transfer time, propellant cost, and number of maneuvers, which will provide very useful reference for practical asteroid mission design. Compared with the PCP method, the proposed approach is demonstrated to be able to provide much more easily used results, obtain better propellant-optimal solutions, and have much better efficiency. The MOPSO shows a very competitive performance with respect to the NSGA-II and the SPEA-II; besides a proposed boundary constraint optimization strategy is testified to be able to improve its performance.

A New Methodology for the Reliability Based Particle Swarm Optimization with Simulated Annealing

2011 ◽  
Vol 274 ◽  
pp. 101-111 ◽  
Author(s):  
Norelislam Elhami ◽  
Rachid Ellaia ◽  
Mhamed Itmi
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Numerical Models ◽  
Limit State ◽  
Particle Swarm ◽  
Geometrical Parameters ◽  
Rectangular Plates ◽  
Swarm Optimization ◽  
Reliability Methods ◽  
State Functions

This paper presents a new methodology for the Reliability Based Particle Swarm Optimization with Simulated Annealing. The reliability analysis procedure couple traditional and modified first and second order reliability methods, in rectangular plates modelled by an Assumed Modes approach. Both reliability methods are applicable to the implicit limit state functions through numerical models, like those based on the Assumed Mode Method. For traditional reliability approaches, the algorithms FORM and SORM use a Newton-Raphson procedure for estimate design point. In modified approaches, the algorithms are based on heuristic optimization methods such as Particle Swarm Optimization and Simulated Annealing Optimization. Numerical applications in static, dynamic and stability problems are used to illustrate the applicability and effectiveness of proposed methodology. These examples consist in a rectangular plates subjected to in-plane external loads, material and geometrical parameters which are considered as random variables. The results show that the predicted reliability levels are accurate to evaluate simultaneously various implicit limit state functions with respect to static, dynamic and stability criterions.

Sign in / Sign up

Export Citation Format

Share Document