{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:17:17Z","timestamp":1778127437810,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T00:00:00Z","timestamp":1547251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s13042-018-00914-1","type":"journal-article","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T05:19:14Z","timestamp":1547270354000},"page":"2921-2940","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A new hybrid genetic algorithm for the maximally diverse grouping problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Kavita","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shyam","family":"Sundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,12]]},"reference":[{"issue":"1","key":"914_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1080\/07408178908966211","volume":"21","author":"T Arani","year":"1989","unstructured":"Arani T, Lotfi V (1989) A three phased approach to final exam scheduling. IIE Trans 21(1):86\u201396","journal-title":"IIE Trans"},{"issue":"2","key":"914_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0305-0483(99)00037-7","volume":"28","author":"J Bhadury","year":"2000","unstructured":"Bhadury J, Mighty EJ, Damar H (2000) Maximizing workforce diversity in project teams: a network flow approach. Omega 28(2):143\u2013153","journal-title":"Omega"},{"key":"914_CR3","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.ins.2014.10.043","volume":"295","author":"J Brimberg","year":"2015","unstructured":"Brimberg J, Mladenovic N, Uro\u0161evi\u0107 D (2015) Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inf Sci 295:650\u2013675","journal-title":"Inf Sci"},{"key":"914_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2006.01.021","volume":"178","author":"A Duarte","year":"2007","unstructured":"Duarte A, Mart\u00ed R (2007) Tabu search and GRASP for the maximum diversity problem. Eur J Oper Res 178:71\u201384","journal-title":"Eur J Oper Res"},{"key":"914_CR5","volume-title":"Genetic algorithms and grouping problems","author":"E Falkenauer","year":"1998","unstructured":"Falkenauer E (1998) Genetic algorithms and grouping problems. Wiley, Chicester"},{"issue":"1","key":"914_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1057\/jors.2009.168","volume":"62","author":"ZP Fan","year":"2011","unstructured":"Fan ZP, Chen Y, Ma J, Zeng S (2011) A hybrid genetic algorithmic approach to the maximally diverse grouping problem. JORS 62(1):92\u201399","journal-title":"JORS"},{"issue":"2","key":"914_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230200205","volume":"20","author":"TA Feo","year":"1990","unstructured":"Feo TA, Khellaf M (1990) A class of bounded approximation algorithms for graph partitioning. Networks 20(2):181\u2013195","journal-title":"Networks"},{"issue":"4","key":"914_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier P, Hao J (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379\u2013397","journal-title":"J Comb Optim"},{"issue":"6","key":"914_CR9","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the cec\u20192005 special session on real parameter optimization. J Heuristics 15(6):617\u2013644","journal-title":"J Heuristics"},{"key":"914_CR10","volume-title":"Genetic algorithms in search optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Boston"},{"key":"914_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, Cambridge"},{"issue":"1","key":"914_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ejor.2010.02.011","volume":"206","author":"D Krass","year":"2010","unstructured":"Krass D, Ovchinnikov A (2010) Constrained group balancing: why does it work. Eur J Oper Res 206(1):144\u2013154","journal-title":"Eur J Oper Res"},{"issue":"3","key":"914_CR13","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.ejor.2016.05.018","volume":"254","author":"X Lai","year":"2016","unstructured":"Lai X, Hao J (2016) Iterated maxima search for the maximally diverse grouping problem. Eur J Oper Res 254(3):780\u2013800","journal-title":"Eur J Oper Res"},{"issue":"4","key":"914_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.5755\/j01.itc.40.4.977","volume":"40","author":"G Palubeckis","year":"2011","unstructured":"Palubeckis G, Karciauskas E, Riskus A (2011) Comparative performance of three metaheuristic approaches for the maximally diverse grouping problem. ITC 40(4):277\u2013285","journal-title":"ITC"},{"issue":"4","key":"914_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1057\/jors.2014.23","volume":"66","author":"G Palubeckis","year":"2015","unstructured":"Palubeckis G, Ostreika A, Rubliauskas D (2015) Maximally diverse grouping: an iterated tabu search approach. JORS 66(4):579\u2013592","journal-title":"JORS"},{"key":"914_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ins.2012.12.020","volume":"230","author":"FJ Rodr\u00edguez","year":"2013","unstructured":"Rodr\u00edguez FJ, Lozano M, Garc\u00eda-Mart\u00ednez C, Gonz\u00e1lez-Barrera JD (2013) An artificial bee colony algorithm for the maximally diverse grouping problem. Inf Sci 230:183\u2013196","journal-title":"Inf Sci"},{"issue":"4","key":"914_CR17","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00291-006-0071-2","volume":"29","author":"A Singh","year":"2007","unstructured":"Singh A, Gupta AK (2007) Two heuristics for the one-dimensional bin-packing problem. OR Spectrum 29(4):765\u2013781","journal-title":"OR Spectrum"},{"key":"914_CR18","doi-asserted-by":"crossref","unstructured":"Sundar S (2014) A steady-state genetic algorithm for the dominating tree problem. In: Simulated evolution and learning\u201410th international conference, SEAL 2014, Dunedin, New Zealand, December 15\u201318, 2014. Proceedings, pp 48\u201357","DOI":"10.1007\/978-3-319-13563-2_5"},{"issue":"4","key":"914_CR19","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1109\/JSYST.2014.2342931","volume":"9","author":"S Sundar","year":"2015","unstructured":"Sundar S, Singh A (2015) Metaheuristic approaches for the blockmodel problem. IEEE Syst J 9(4):1237\u20131247","journal-title":"IEEE Syst J"},{"key":"914_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2298\/YJOR121223003U","volume":"24","author":"D Uro\u0161evi\u0107","year":"2014","unstructured":"Uro\u0161evi\u0107 D (2014) Variable neighborhood search for maximum diverse grouping problem. Yugosl J Oper Res 24:21\u201333","journal-title":"Yugosl J Oper Res"},{"key":"914_CR21","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0305-0483(97)00007-8","volume":"25","author":"R Weitz","year":"1997","unstructured":"Weitz R, Lakshminarayanan S (1997) An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, vlsi design, and exam scheduling. Omega 25:473\u2013482","journal-title":"Omega"},{"issue":"6","key":"914_CR22","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1057\/palgrave.jors.2600510","volume":"49","author":"R Weitz","year":"1998","unstructured":"Weitz R, Lakshminarayanan S (1998) An empirical comparison of heuristic methods for creating maximally diverse groups. J Oper Res Soc 49(6):635\u2013646","journal-title":"J Oper Res Soc"},{"issue":"3","key":"914_CR23","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1111\/j.1540-5915.1992.tb00415.x","volume":"23","author":"R Weitz","year":"1992","unstructured":"Weitz R, Jelassi Tawfik M (1992) Assigning students to groups: a multi-criteria decision support system approach. Decision Sci 23(3):746\u2013757","journal-title":"Decision Sci"},{"key":"914_CR24","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1002\/cae.20338","volume":"19","author":"HK Yeoh","year":"2011","unstructured":"Yeoh HK, Nor M, Iskandr M (2011) An algorithm to form balanced and diverse groups of students. Comput Appl Eng Educ 19:582\u2013590","journal-title":"Comput Appl Eng Educ"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-018-00914-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-018-00914-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-018-00914-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T00:05:05Z","timestamp":1578787505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-018-00914-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,12]]},"references-count":24,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["914"],"URL":"https:\/\/doi.org\/10.1007\/s13042-018-00914-1","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,12]]},"assertion":[{"value":"28 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}