Collective Biobjective Optimization Algorithm for Parallel Test Paper Generation
نویسندگان
چکیده
Parallel Test Paper Generation (k-TPG) is a biobjective distributed resource allocation problem, which aims to generate multiple similarly optimal test papers automatically according to multiple userspecified criteria. Generating high-quality parallel test papers is challenging due to its NP-hardness in maximizing the collective objective functions. In this paper, we propose a Collective Biobjective Optimization (CBO) algorithm for solving k-TPG. CBO is a multi-step greedy-based approximation algorithm, which exploits the submodular property for biobjective optimization of k-TPG. Experiment results have shown that CBO has drastically outperformed the current techniques in terms of paper quality and runtime efficiency.
منابع مشابه
An Efficient Algorithm for Workspace Generation of Delta Robot
Dimensional synthesis of a parallel robot may be the initial stage of its design process, which is usually carried out based on a required workspace. Since optimization of the links lengths of the robot for the workspace is usually done, the workspace computation process must be run numerous times. Hence, importance of the efficiency of the algorithm and the CPU time of the workspace computatio...
متن کاملA M C M Representation of the Non-dominated Set in Biobjective Combinatorial Optimization Representation of the Non-dominated Set in Biobjective Combinatorial Optimization
This article introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective combinatorial optimization problem with respect to uniformity, coverage and the -indicator. These representation problems are formulated as particular facility location problems with a special location structure, which allows for polynomial-time algorithms in the biobje...
متن کاملOptimal Design of a Brushless DC Motor, by Cuckoo Optimization Algorithm (RESEARCH NOTE)
This contribution deals with an optimal design of a brushless DC motor, using optimization algorithms, based on collective intelligence. For this purpose, the case study motor is perfectly explained and its significant specifications are obtained as functions of the motor geometric parameters. In fact, the geometric parameters of the motor are considered as optimization variables. Then, the obj...
متن کاملDistributed Biobjective Ant Colony Algorithm for Low Cost Overlay Network Routing
In this paper we introduce a biobjective ant colony algorithm for constructing low cost overlay routing networks. The ant colony algorithm is distributed and adaptive in finding shortest paths from source to destination nodes while also constructing a low cost overlay routing network. Additionally, we define a cost model for overlay network construction that includes network traffic demands. Th...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کامل