{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T15:15:30Z","timestamp":1779290130110,"version":"3.51.4"},"reference-count":73,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2018,7,7]],"date-time":"2018-07-07T00:00:00Z","timestamp":1530921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Genetic algorithm (GA) is one of the well-known techniques from the area of evolutionary computation that plays a significant role in obtaining meaningful solutions to complex problems with large search space. GAs involve three fundamental operations after creating an initial population, namely selection, crossover, and mutation. The first task in GAs is to create an appropriate initial population. Traditionally GAs with randomly selected population is widely used as it is simple and efficient; however, the generated population may contain poor fitness. Low quality or poor fitness of individuals may lead to take long time to converge to an optimal (or near-optimal) solution. Therefore, the fitness or quality of initial population of individuals plays a significant role in determining an optimal or near-optimal solution. In this work, we propose a new method for the initial population seeding based on linear regression analysis of the problem tackled by the GA; in this paper, the traveling salesman problem (TSP). The proposed Regression-based technique divides a given large scale TSP problem into smaller sub-problems. This is done using the regression line and its perpendicular line, which allow for clustering the cities into four sub-problems repeatedly, the location of each city determines which category\/cluster the city belongs to, the algorithm works repeatedly until the size of the subproblem becomes very small, four cities or less for instance, these cities are more likely neighboring each other, so connecting them to each other creates a somehow good solution to start with, this solution is mutated several times to form the initial population. We analyze the performance of the GA when using traditional population seeding techniques, such as the random and nearest neighbors, along with the proposed regression-based technique. The experiments are carried out using some of the well-known TSP instances obtained from the TSPLIB, which is the standard library for TSP problems. Quantitative analysis is carried out using the statistical test tools: analysis of variance (ANOVA), Duncan multiple range test (DMRT), and least significant difference (LSD). The experimental results show that the performance of the GA that uses the proposed regression-based technique for population seeding outperforms other GAs that uses traditional population seeding techniques such as the random and the nearest neighbor based techniques in terms of error rate, and average convergence.<\/jats:p>","DOI":"10.3390\/info9070167","type":"journal-article","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T11:18:53Z","timestamp":1531135133000},"page":"167","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["An Improved Genetic Algorithm with a New Initialization Mechanism Based on Regression Techniques"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9991-304X","authenticated-orcid":false,"given":"Ahmad B.","family":"Hassanat","sequence":"first","affiliation":[{"name":"Department of Information Technology, Mutah University, Karak 61710, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-7453","authenticated-orcid":false,"given":"V. B. Surya","family":"Prasath","sequence":"additional","affiliation":[{"name":"Division of Biomedical Informatics, Cincinnati Children\u2019s Hospital Medical Center, Cincinnati, OH 45229, USA"},{"name":"Department of Biomedical Informatics, College of Medicine, University of Cincinnati, Cincinnati, OH 45267, USA"},{"name":"Department of Electrical Engineering &amp; Computer Science, University of Cincinnati, Cincinnati, OH 45221, USA"},{"name":"Department of Electrical Engineering &amp; Computer Science, University of Missouri, Columbia, MO 65211, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Ali","family":"Abbadi","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Mutah University, Karak 61710, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salam Amer","family":"Abu-Qdari","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Mutah University, Karak 61710, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossam","family":"Faris","sequence":"additional","affiliation":[{"name":"Business Information Technology Department, King Abdullah II School for Information Technology, The University of Jordan, Amman 11942, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,7,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Holland, J.H. (1992). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, MIT Press.","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0895-7177(00)00088-1","article-title":"The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem","volume":"31","author":"Katayama","year":"2000","journal-title":"Math. Comput. Model."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1142\/S1469026803000987","article-title":"Optimization of production systems using genetic algorithms","volume":"3","author":"Mustafa","year":"2003","journal-title":"Int. J. Comput. Intell. Appl."},{"key":"ref_4","unstructured":"Zhong, J., Hu, X., Zhang, J., and Gu, M. (2005, January 28\u201330). Comparison of performance between different selection strategies on simple genetic algorithms. Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC\u201906), Vienna, Austria."},{"key":"ref_5","unstructured":"Louis, S.J., and Tang, R. (1999, January 13\u201317). Interactive genetic algorithms for the traveling salesman problem. Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, Orlando, FL, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/41.538609","article-title":"Genetic algorithms: Concepts and applications in engineering design","volume":"43","author":"Man","year":"1996","journal-title":"IEEE Trans. Ind. Electron."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Paul, P.V., Dhavachelvan, P., and Baskaran, R. (2013, January 20\u201321). A novel population initialization technique for genetic algorithm. Proceedings of the 2013 International Conference on Circuits, Power and Computing Technologies (ICCPCT), Nagercoil, India.","DOI":"10.1109\/ICCPCT.2013.6528933"},{"key":"ref_8","first-page":"785","article-title":"Enhancing genetic algorithms using multi mutations: Experimental results on the travelling salesman problem","volume":"14","author":"Hassanat","year":"2016","journal-title":"Int. J. Comput. Sci. Inf. Secur."},{"key":"ref_9","unstructured":"Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley."},{"key":"ref_10","unstructured":"Tsang, P.W., and Au, A.T.S. (1996, January 29). A genetic algorithm for projective invariant object recognition. Proceedings of the Digital Processing Applications (TENCON \u201996), Perth, Australia."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00175354","article-title":"A genetic algorithm tutorial","volume":"4","author":"Whitley","year":"1994","journal-title":"Stat. Comput."},{"key":"ref_12","unstructured":"Benkhellat, Z., and Belmehdi, A. (2012, January 3\u20136). Genetic algorithms in speech recognition systems. Proceedings of the International Conference on Industrial Engineering and Operations Management, Istanbul, Turkey."},{"key":"ref_13","first-page":"56","article-title":"An overview of methods maintaining diversity in genetic algorithms","volume":"2","author":"Gupta","year":"2012","journal-title":"Int. J. Emerg. Technol. Adv. Eng."},{"key":"ref_14","first-page":"87","article-title":"Application of genetic algorithm in software testing","volume":"3","author":"Srivastava","year":"2009","journal-title":"Int. J. Softw. Eng. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Zhou, X., Fang, M., and Ma, H. (2018). Genetic algorithm with an improved initial population technique for automatic clustering of low-dimensional data. Information, 9.","DOI":"10.3390\/info9040101"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"467","DOI":"10.3390\/info6030467","article-title":"Optimization of China crude oil transportation network with genetic ant colony algorithm","volume":"6","author":"Wang","year":"2015","journal-title":"Information"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3390\/info6030339","article-title":"Improved genetic algorithm optimization for forward vehicle detection problems","volume":"6","author":"Gang","year":"2015","journal-title":"Information"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.3390\/info5020319","article-title":"An interval-valued approach to business process simulation based on genetic algorithms and the BPMN","volume":"5","author":"Cimino","year":"2014","journal-title":"Information"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"293","DOI":"10.3390\/jsan4040293","article-title":"On optimal multi-sensor network configuration for 3D registration","volume":"4","author":"Aliakbarpour","year":"2015","journal-title":"J. Sens. Actuator Netw."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"8968","DOI":"10.1016\/j.eswa.2012.02.027","article-title":"Tuning of PID controller based on a multiobjective genetic algorithm applied to a robotic manipulator","volume":"39","author":"Ayala","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., and Smith, J.E. (2003). Introduction to Evolutionary Computing, Springer.","DOI":"10.1007\/978-3-662-05094-1"},{"key":"ref_22","unstructured":"Abu-Qdari, S.A. (2017). An Improved GA with Initial Population Technique for the Travelling Salesman Problem. [Master\u2019s Thesis, Mutah University]."},{"key":"ref_23","unstructured":"Alkafaween, E. (2015). Novel Methods for Enhancing the Performance of Genetic Algorithms,. [Master\u2019s Thesis, Mutah University]."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1016\/j.camwa.2003.07.011","article-title":"Quasi-random initial population for genetic algorithms","volume":"47","author":"Maaranen","year":"2004","journal-title":"Comput. Math. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10898-006-9056-6","article-title":"On initial populations of a genetic algorithm for continuous optimization problems","volume":"37","author":"Maaranen","year":"2007","journal-title":"J. Glob. Optim."},{"key":"ref_26","unstructured":"Pullan, W. (2003, January 8\u201312). Adapting the genetic algorithm to the travelling salesman problem. Proceedings of the 2003 Congress on Evolutionary Computation (CEC \u201903), Canberra, Australia."},{"key":"ref_27","unstructured":"Hue, X. (1997). Genetic Algorithms for Optimization: Background and Applications, Edinburgh Parallel Computing Centre."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Yugay, O., Kim, I., Kim, B., and Ko, F.I.S. (2008, January 11\u201313). Hybrid genetic algorithm for solving traveling salesman problem with sorted population. Proceedings of the Third International Conference on Convergence and Hybrid Information Technology (ICCIT), Busan, Korea.","DOI":"10.1109\/ICCIT.2008.373"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.camwa.2006.07.013","article-title":"A novel population initialization method for accelerating evolutionary algorithms","volume":"53","author":"Rahnamayan","year":"2007","journal-title":"Comput. Math. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1016\/j.cie.2011.06.015","article-title":"Initialization strategies to enhancing the performance of genetic algorithms for the p-median problem","volume":"61","author":"Li","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","article-title":"Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms","volume":"38","author":"Albayrak","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_33","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_34","unstructured":"Michalewicz, Z. (2013). Genetic Algorithms + Data Structures = Evolution Programs, Springer Science and Business Media."},{"key":"ref_35","unstructured":"Sivanandam, S.N., and Deepa, S.N. (2007). Introduction to Genetic Algorithms, Springer."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1504\/IJBIC.2011.043622","article-title":"Evolution in ecological agent systems","volume":"3","author":"Lurgi","year":"2011","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Akerkar, R., and Sajja, P.S. (2016). Genetic Algorithms and Evolutionary Computing. Intelligent Techniques for Data Science, Springer.","DOI":"10.1007\/978-3-319-29206-9"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","article-title":"An overview of evolutionary algorithms for parameter optimization","volume":"1","author":"Back","year":"1993","journal-title":"Evol. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"256","DOI":"10.3390\/info3030256","article-title":"A Review on the interpretability-accuracy trade-off in evolutionary multi-objective fuzzy systems (EMOFS)","volume":"3","author":"Shukla","year":"2012","journal-title":"Information"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1504\/IJCAT.2017.084774","article-title":"On enhancing genetic algorithms using new crossovers","volume":"55","author":"Hassanat","year":"2017","journal-title":"Int. J. Comput. Appl. Technol."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Shukla, A., Pandey, H.M., and Mehrotra, D. (2015, January 25\u201327). Comparative review of selection techniques in genetic algorithm. Proceedings of the 2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE), Noida, India.","DOI":"10.1109\/ABLAZE.2015.7154916"},{"key":"ref_42","unstructured":"Kaya, Y., and Uyar, M. (arXiv, 2011). A novel crossover operator for genetic algorithms: Ring crossover, arXiv."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Korejo, I., Yang, S., Brohi, K., and Khuhro, Z.U. (2013). Multi-population methods with adaptive mutation for multi-modal optimization problems. Int. J. Soft Comput. Artif. Intell. Appl. (IJSCAI), 2.","DOI":"10.5121\/ijscai.2013.2201"},{"key":"ref_44","first-page":"42","article-title":"Literature survey on travelling salesman problem using genetic algorithms","volume":"2","author":"Rao","year":"2015","journal-title":"Int. J. Adv. Res. Edu. Technol. (IJARET)"},{"key":"ref_45","first-page":"114","article-title":"New binary representation in genetic algorithms for solvingTSP by mapping permutations to a list of ordered numbers","volume":"1","author":"Mohebifar","year":"2006","journal-title":"WSEAS Trans. Comput. Res."},{"key":"ref_46","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_47","unstructured":"Homaifar, A., Guan, S., and Liepins, G.E. (1993, January 15). A new approach on the traveling salesman problem by genetic algorithms. Proceedings of the 5th International Conference on Genetic Algorithms, Urbana-Champaign, IL, USA."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0255(99)00026-2","article-title":"A synergetic approach to genetic algorithms for solving traveling salesman problem","volume":"117","author":"Qu","year":"1999","journal-title":"Inf. Sci."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Kaur, D., and Murugappan, M.M. (2008, January 19\u201322). Performance enhancement in solving traveling salesman problem using hybrid genetic algorithm. Proceedings of the NAFIPS 2008\u20142008 Annual Meeting of the North American Fuzzy Information Processing Society, New York City, NY, USA.","DOI":"10.1109\/NAFIPS.2008.4531202"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Liao, X.-P. (2009, January 12\u201315). An orthogonal genetic algorithm with total flowtime minimization for the no-wait flow shop problem. Proceedings of the 2009 International Conference on Machine Learning and Cybernetics, Baoding, China.","DOI":"10.1109\/ICMLC.2009.5212254"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1016\/j.asoc.2012.10.018","article-title":"A genetic algorithm for finding a path subject to two constraints","volume":"13","author":"Lu","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10489-006-0018-y","article-title":"Genetic operators for combinatorial optimization in TSP and microarray gene ordering","volume":"26","author":"Ray","year":"2007","journal-title":"Appl. Intell."},{"key":"ref_53","unstructured":"Tsai, C.-F., and Tsai, C.-W. (2002, January 12\u201317). A new approach for solving large traveling salesman problem using evolutionary ant rules. Proceedings of the 2002 International Joint Conference on Neural Networks, IJCNN\u201902 (Cat. No.02CH37290), Honolulu, HI, USA."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Yang, R. (1997, January 2\u20134). Solving large travelling salesman problems with small populations. Proceedings of the Second International Conference on Genetic Algorithms in Engineering Systems, Glasgow, UK.","DOI":"10.1049\/cp:19971173"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Wei, Y., Hu, Y., and Gu, K. (2007, January 24\u201327). Parallel search strategies for TSPs using a greedy genetic algorithm. Proceedings of the Third International Conference on Natural Computation (ICNC 2007), Haikou, China.","DOI":"10.1109\/ICNC.2007.537"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.3233\/JIFS-169043","article-title":"A knowledge-based technique for initializing a genetic algorithm","volume":"31","author":"Li","year":"2016","journal-title":"J. Intell. Fuzzy Syst."},{"key":"ref_57","first-page":"2993","article-title":"Performance analyses on population seeding techniques for genetic algorithms","volume":"5","author":"Paul","year":"2013","journal-title":"Int. J. Eng. Technol. (IJET)"},{"key":"ref_58","unstructured":"Osaba, E., and Diaz, F. (2012, January 9\u201312). Comparison of a memetic algorithm and a tabu search algorithm for the traveling salesman problem. Proceedings of the 2012 Federated Conference on Computer Science and Information Systems (FedCSIS), Wroclaw, Poland."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"key":"ref_60","first-page":"86","article-title":"Improving the Performance of Genetic Algorithm by reducing the population size","volume":"3","author":"Raja","year":"2013","journal-title":"Int. J. Emerg. Technol. Adv. Eng."},{"key":"ref_61","unstructured":"Chiroma, H., Abdulkareem, S., Abubakar, A., Zeki, A., Gital, A.Y.U., and Usman, M.J. (2013, January 6\u20137). Correlation Study of Genetic Algorithm Operators: Crossover and Mutation Probabilities. Proceedings of the International Symposium on Mathematical Sciences and Computing Research 2013 (iSMSC 2013), Perak, Malaysia."},{"key":"ref_62","first-page":"1171","article-title":"Performance assessment over heuristic population seeding techniques of genetic algorithm: Benchmark analyses on traveling salesman problems","volume":"8","author":"Shanmugam","year":"2013","journal-title":"Int. J. Appl. Eng. Res. (IJAER)"},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.asoc.2015.03.038","article-title":"Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: An empirical study based on traveling salesman problems","volume":"32","author":"Paul","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Osaba, E., Carballedo, R., Diaz, F., Onieva, E., Lopez, P., and Perallos, A. (2014, January 2\u20134). On the influence of using initialization functions on genetic algorithms solving combinatorial optimization problems: A first study on the TSP. Proceedings of the IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS), Linz, Austria.","DOI":"10.1109\/EAIS.2014.6867465"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"2401","DOI":"10.1016\/j.eswa.2010.08.029","article-title":"A hybrid grouping genetic algorithm for reviewer group construction problem","volume":"38","author":"Chen","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","article-title":"Parameter control in evolutionary algorithms","volume":"3","author":"Eiben","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_67","unstructured":"Pedersen, D. (1998). Coarse-Grained Parallel Genetic Algorithms: Three Implementations and Their Analysis. [Master\u2019s Thesis, Kate Gleason College]."},{"key":"ref_68","first-page":"1476","article-title":"Review paper of various selection methods in genetic algorithm","volume":"3","author":"Sharma","year":"2013","journal-title":"Int. J. Adv. Res. Comput. Sci. Softw. Eng."},{"key":"ref_69","first-page":"162","article-title":"Applying adaptive algorithms to epistatic domains","volume":"85","author":"Davis","year":"1985","journal-title":"IJCAI"},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00203625","article-title":"The \u201cmolecular\u201d traveling salesman","volume":"64","author":"Banzhaf","year":"1990","journal-title":"Biol. Cybern."},{"key":"ref_71","first-page":"339","article-title":"A hybrid genetic algorithm\u2014A new approach to solve traveling salesman problem","volume":"2","author":"Jayalakshmi","year":"2001","journal-title":"Int. J. Comput. Eng. Sci."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0378-3758(99)00042-7","article-title":"A semi-Bayesian study of Duncan\u2019s Bayesian multiple comparison procedure","volume":"82","author":"Shaffer","year":"1999","journal-title":"J. Stat. Plan. Inference"},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.cmpb.2005.02.007","article-title":"A new software for carrying out one-way ANOVA post hoc tests","volume":"79","author":"Brown","year":"2005","journal-title":"Comput. Methods Progr. Biomed."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/7\/167\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:11:41Z","timestamp":1760195501000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/7\/167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,7]]},"references-count":73,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2018,7]]}},"alternative-id":["info9070167"],"URL":"https:\/\/doi.org\/10.3390\/info9070167","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,7]]}}}