Hybrid Approach with Improved Genetic Algorithm and Simulated Annealing for Thesis Sampling

Shardrom Johnson, Jinwu Han, Yuanchen Liu, Li Chen and Xinlin Wu
Additional contact information
Shardrom Johnson: XianDa College of Economics and Humanities, Shanghai International Studies University, East Tiyuhui Road 390, Shanghai 200083, China
Jinwu Han: School of Computer Engineering and Science, Shanghai University, Shangda Road 99, Shanghai 200444, China
Yuanchen Liu: Faculty of Foreign Languages, Ningbo University, Fenghua Road 818, Ningbo 315211, China
Li Chen: XianDa College of Economics and Humanities, Shanghai International Studies University, East Tiyuhui Road 390, Shanghai 200083, China
Xinlin Wu: Department of Education Evaluation Research, Shanghai Education Evaluation Institute, South Shaanxi Road 202, Shanghai 200031, China

Future Internet, 2018, vol. 10, issue 8, 1-15

Abstract: Sampling inspection uses the sample characteristics to estimate that of the population, and it is an important method to describe the population, which has the features of low cost, strong applicability and high scientificity. This paper aims at the sampling inspection of the master’s degree thesis to ensure their quality, which is commonly estimated by random sampling. Since there are disadvantages in random sampling, a hybrid algorithm combined with an improved genetic algorithm and a simulated annealing algorithm is proposed in this paper. Furthermore, a novel mutation strategy is introduced according to the specialty of Shanghai’s thesis sampling to improve the efficiency of sampling inspection; the acceleration of convergence of the algorithm can also take advantage of this. The new algorithm features the traditional genetic algorithm, and it can obtain the global optimum in the optimization process and provide the fairest sampling plan under the constraint of multiple sampling indexes. The experimental results on the master’s thesis dataset of Shanghai show that the proposed algorithm well meets the requirements of the sampling inspection in Shanghai with a lower time-complexity.

Keywords: sampling; genetic algorithm; simulated annealing algorithm; thesis and dissertation sampling; mutation strategy (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/10/8/71/pdf (application/pdf)
https://www.mdpi.com/1999-5903/10/8/71/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:10:y:2018:i:8:p:71-:d:160806

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().