Details of Research Outputs

TitleNeighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
Author (Name in English or Pinyin)
Lai, X.1; Hao, J.-K.2,3; Fu, Z.-H.4; Yue, D.1
Date Issued2020-03-16
Source PublicationEuropean Journal of Operational Research
ISSN03772217
DOI10.1016/j.ejor.2020.07.048
Firstlevel Discipline计算机科学技术
Education discipline科技类
Published range国外学术期刊
Volume Issue PagesVolume 289, Issue 3, 16 March 2021, Pages 1067-1086
References
[1] Arani, T., Lofti, V., A three phased approach to final exam scheduling. IIE Transactions 21:1 (1989), 86–96.
[2] Benlic, U., Hao, J.K., Breakout local search for the max-cut problem. Engineering Applications of Artificial Intelligence 26:3 (2013), 1162–1173.
[3] Benlic, U., Hao, J.K., Breakout local search for the vertex separator problem. Rossi, F., (eds.) Proc. of the 23th intl. joint conference on artificial intelligence (IJCAI-13), 2013, IJCAI/AAAI Press, Beijing, China, 461–467.
[4] Brimberg, J., Mladenović, N., Urošević, D., Solving the maximally diverse grouping problem by skewed general variable neighborhodd search. Information Sciences 295 (2015), 650–675.
[5] Chen, Y., Fan, Z.P., Ma, J., Zeng, S., A hybrid grouping genetic algorithm for reviewier group construction problem. Expert Systems with Applications 38:3 (2011), 2401–2411.
[6] Costa, L.R., Aloise, D., Mladenović, N., Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Information Sciences 415–416 (2017), 247–253.
[7] Dhillon, I., Guan, Y., Kulis, B., Weighted graph cuts without eigenvectors: a multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence 29:11 (2007), 1944–1957.
[8] Díaz, J. A., & Fernández, E., Hybrid scatter search and path relinking for the capacitated p-median problem. European Journal of Operational Research, 169(2), 570–585.
[9] Fan, Z.P., Chen, Y., Ma, J., Zeng, S., A hybrid genetic algorithmic approach to the maximally diverse grouping problem. Journal of the Operational Research Society 62 (2010), 92–99.
[10] Feo, T.A., Khellaf, M., A class of bounded approximation algorithms for graph partitioning. Networks 20 (1990), 181–195.
[11] Gallego, M., Laguna, M., Martí, R., Duarte, A., Tabu search with strategic oscillation for the maximally diverse grouping problem. Journal of the Operational Research Society 64 (2013), 724–734.
[12] Glover, F., Laguna, M., Tabu search. 1997, Springer Science+Business Media, New York.
[13] Grötschel, M., Wakabayashi, Y., A cutting plane algorithm for a clustering problem. Mathematical Programming 45:1–3 (1989), 59–96.
[14] Hansen, P., Mladenović, N., Variable neighborhood search: Principles and applications. European Journal of Operational Research 130:3 (2001), 449–467.
[15] Hao, J.K., Memetic algorithms in discrete optimization. Neri, F., Cotta, C., Moscato, P., (eds.) Handbook of memetic algorithms, studies in computational intelligence, 2012, Springer, Berlin, 73–94 Vol 379.
[16] Johnes, J., Operational research in education. European Journal of Operational Research 243:3 (2015), 683–696.
[17] Krass, D., Ovchinnikov, A., Constrained group balancing: Why does it work. European Journal of Operational Research 206:1 (2010), 144–154.
[18] Lai, X.J., Hao, J.K., Iterated maxima search for the maximally diverse grouping problem. European Journal of Operational Research 254 (2016), 780–800.
[19] Lorena, N., Antonio, L., Constructive genetic algorithm for clustering problems. Evolutionary Computation 9:3 (2001), 309–327.
[20] Lourenco, H.R., Martin, O., Stützle, T., Iterated local search. Glover, F., Kochenberger, G., (eds.) Handbook of metaheuristics, kluwer, 2003.
[21] Palubeckis, G., Karčiauskas, E., Riškus, A., Comparative performance of three metaheuristic approaches for the maximally diverse grouping problem. Information Technology and Control 40:4 (2011), 277–285.
[22] Palubeckis, G., Ostreika, A., Rubliauskas, D., Maximally diverse grouping: an iterated tabu search approach. Journal of the Operational Research Society 66:4 (2015), 579–592.
[23] Rodriguez, F.J., Lozano, M., García-Martínez, C., González-Barrera, J.D., An artificial bee colony algorithm for the maximally diverse grouping problem. Information Sciences 230:1 (2013), 183–196.
[24] Singh, K., Sundar, S., A new hybrid genetic algorithm for the maximally diverse grouping problem. International Journal of Machine Learning and Cybernetics 10:10 (2019), 2921–2940.
[25] Urošević, D., Variable neighborhood search for maximum diverse grouping problem. Yugoslav Journal of Operations Research 24:1 (2014), 21–33.
[26] Weitz, R., Lakshminarayan, S., An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups. VLSI design, and exam scheduling. Omega 25:4 (1997), 473–482.
[27] Weitz, R., Lakshminarayan, S., An empirical comparison of heuristic methods for creating maximally diverse groups. Journal of the Operational Research Society 49 (1998), 635–646.
[28] Yeoh, H.K., Nor, M.I.M., An algorithm to form balanced and diverse groups of students. Computer Applications in Engineering Education 19:3 (2011), 582–590.
[29] Zhou, Y., Hao, J.K., Goëffon, A., A three-phased local search approach for the clique partitioning problem. Journal of Combinatorial Optimization 32:2 (2016), 469–491.
Citation statistics
Cited Times:14[WOS]   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
Identifierhttps://irepository.cuhk.edu.cn/handle/3EPUXD0A/1635
CollectionInstitute of Robotics and Intelligent Manufacturing
School of Science and Engineering
Corresponding AuthorHao, J.-K.
Affiliation
1.Institute of Advanced Technology, Nanjing University of Posts and Telecommunications, Nanjing, 210023, China
2.LERIA, Université d'Angers, 2 Boulevard Lavoisier, Angers, 49045, France
3.Institut Universitaire de France, 1 Rue Descartes, Paris, 75231, France
4.Shenzhen Institute of Artificial Intelligence and Robotics for Society, and The Chinese University of Hong Kong, Shenzhen, Shenzhen, 518172, China
Recommended Citation
GB/T 7714
Lai, X.,Hao, J.-K.,Fu, Z.-H.et al. Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping[J]. European Journal of Operational Research,2020.
APA Lai, X., Hao, J.-K., Fu, Z.-H., & Yue, D. (2020). Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping. European Journal of Operational Research.
MLA Lai, X.,et al."Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping".European Journal of Operational Research (2020).
Files in This Item:
There are no files associated with this item.
Related Services
Usage statistics
Google Scholar
Similar articles in Google Scholar
[Lai, X.]'s Articles
[Hao, J.-K.]'s Articles
[Fu, Z.-H.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lai, X.]'s Articles
[Hao, J.-K.]'s Articles
[Fu, Z.-H.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lai, X.]'s Articles
[Hao, J.-K.]'s Articles
[Fu, Z.-H.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.