{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:01:33Z","timestamp":1760241693779,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T00:00:00Z","timestamp":1532908800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Fund Project;the Shanghai Science Fund Project;the Shanghai Construction of Key Disciplines Fund Project ;the Second (2016) Shanghai Research Project for Private University;he Shanghai University Graduate Innovation Fund Project;","award":["40976108; 61303097;J50103;2016-SHNGE-08ZD;SHUCX070037; SHUCX120105"],"award-info":[{"award-number":["40976108; 61303097;J50103;2016-SHNGE-08ZD;SHUCX070037; SHUCX120105"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>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\u2019s 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\u2019s 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\u2019s thesis dataset of Shanghai show that the proposed algorithm well meets the requirements of the sampling inspection in Shanghai with a lower time-complexity.<\/jats:p>","DOI":"10.3390\/fi10080071","type":"journal-article","created":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T11:55:08Z","timestamp":1532951708000},"page":"71","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Approach with Improved Genetic Algorithm and Simulated Annealing for Thesis Sampling"],"prefix":"10.3390","volume":"10","author":[{"given":"Shardrom","family":"Johnson","sequence":"first","affiliation":[{"name":"XianDa College of Economics and Humanities, Shanghai International Studies University, East Tiyuhui Road 390, Shanghai 200083, China"},{"name":"School of Computer Engineering and Science, Shanghai University, Shangda Road 99, Shanghai 200444, China"},{"name":"Information Centre, Shanghai Municipal Education Commission, Dagu Road 100, Shanghai 200003, China"}]},{"given":"Jinwu","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Engineering and Science, Shanghai University, Shangda Road 99, Shanghai 200444, China"}]},{"given":"Yuanchen","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Foreign Languages, Ningbo University, Fenghua Road 818, Ningbo 315211, China"}]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[{"name":"XianDa College of Economics and Humanities, Shanghai International Studies University, East Tiyuhui Road 390, Shanghai 200083, China"}]},{"given":"Xinlin","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Education Evaluation Research, Shanghai Education Evaluation Institute, South Shaanxi Road 202, Shanghai 200031, China"}]}],"member":"1968","published-online":{"date-parts":[[2018,7,30]]},"reference":[{"key":"ref_1","unstructured":"State Council Degrees Committee, M.o.E (2014). Notice of the Ministry of Education on Printing and Distributing the Measures for the Examination of Doctoral Dissertations of Master Degree."},{"key":"ref_2","first-page":"33","article-title":"The concept of the construction of education informationization platform for postgraduate students from the provincial level and postgraduate program in Shanghai","volume":"11","author":"Xia","year":"2014","journal-title":"Degree Postgrad. Educ."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.ejor.2011.09.042","article-title":"Variables sampling inspection scheme for resubmitted lots based on the process capability index Cpk","volume":"217","author":"Wu","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","unstructured":"Wang, Q. (2009). New Progress in Shanghai Graduate Education: Commemorating the 30th Anniversary of Graduate Education, Shanghai People\u2019s Publishing House."},{"key":"ref_5","unstructured":"Gao, L. (2011). Research on the Sampling System of Dissertation in China. [Master\u2019s Thesis, Xiangtan University]."},{"key":"ref_6","first-page":"62","article-title":"Research on Jiangsu province graduate dissertation evaluation mechanism","volume":"2","author":"Zhang","year":"2014","journal-title":"Shanghai Educ. Eval. Res."},{"key":"ref_7","unstructured":"Braun, H. (1990, January 1\u20133). On solving travelling salesman problems by genetic algorithms. Proceedings of the International Conference on Parallel Problem Solving from Nature, Dortmund, Germany."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Deng, Y., Liu, Y., and Zhou, D. (2015). An improved genetic algorithm with initial population strategy for symmetric TSP. Math. Probl. Eng., 2015.","DOI":"10.1155\/2015\/212794"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.cam.2004.07.034","article-title":"Genetic algorithms for modelling and optimisation","volume":"184","author":"McCall","year":"2005","journal-title":"J. Comput. Appl. Math."},{"key":"ref_10","unstructured":"Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Co."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Van Laarhoven, P.J., and Aarts, E.H. (1987). Simulated annealing. Simulated Annealing: Theory and Applications, Springer.","DOI":"10.1007\/978-94-015-7744-1"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1016\/S0098-1354(00)00601-3","article-title":"A combined genetic algorithm\/simulated annealing algorithm for large scale system energy integration","volume":"24","author":"Yu","year":"2000","journal-title":"Comput. Chem. Eng."},{"key":"ref_13","unstructured":"Jha, S., and Menon, V. (2014, January 13\u201316). BbmTTP: Beat-based parallel simulated annealing algorithm on GPGPUs for the mirrored traveling tournament problem. Proceedings of the High Performance Computing Symposium, Society for Computer Simulation International, Tampa, FL, USA."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1107\/S1600576717012602","article-title":"Improved performance of crystal structure solution from powder diffraction data through parameter tuning of a simulated annealing algorithm","volume":"50","author":"Kabova","year":"2017","journal-title":"J. Appl. Crystallogr."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.ins.2018.03.042","article-title":"A Hybrid Harmony search and Simulated Annealing algorithm for continuous optimization","volume":"450","author":"Assad","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_16","unstructured":"Janikow, C.Z., and Michalewicz, Z. (,  1991). An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, USA."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1111\/j.1752-1688.2003.tb03699.x","article-title":"Real coded genetic algorithm optimization of long term reservoir operation 1","volume":"39","author":"Chen","year":"2003","journal-title":"J. Am. Water Resour. Assoc."},{"key":"ref_18","first-page":"69","article-title":"A comparative analysis of selection schemes used in genetic algorithms","volume":"Volume 1","author":"Goldberg","year":"1991","journal-title":"Foundations of Genetic Algorithms"},{"key":"ref_19","first-page":"333","article-title":"Selection methods for genetic algorithms","volume":"3","author":"Jebari","year":"2013","journal-title":"Int. J. Emerg. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.1109\/TAP.2008.924713","article-title":"The application of a modified differential evolution strategy to some array pattern synthesis problems","volume":"56","author":"Chen","year":"2008","journal-title":"IEEE Trans. Antennas Propag."},{"key":"ref_21","unstructured":"Umbarkar, A., and Sheth, P. (2015). Crossover operators in genetic algorithms: A review. ICTACT J. Soft Comput., 6."},{"key":"ref_22","unstructured":"Abdoun, O., Abouchabaka, J., and Tajani, C. (arXiv, 2012). Analyzing the performance of mutation operators to solve the travelling salesman problem, arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Sarkar, S., Sinha, P., Changder, N., and Dutta, A. (2018, January 16\u201318). Coalition Structure Formation using Parallel Dynamic Programming. Proceedings of the 10th International Conference on Agents and Artificial Intelligence, Madeira, Portugal.","DOI":"10.5220\/0006587401030110"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/10\/8\/71\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:15:18Z","timestamp":1760195718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/10\/8\/71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,30]]},"references-count":23,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2018,8]]}},"alternative-id":["fi10080071"],"URL":"https:\/\/doi.org\/10.3390\/fi10080071","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2018,7,30]]}}}