Variable neighborhood search for maximum diverse grouping problem

Yugoslav Journal of Operations Research

Volumn 24, Issue 1, 2014, Pages 21-33

  Uroŝevic, Dragan ^a  

^a MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Combinatorial optimization; Maximum Diverse Grouping; Metaheuristics; Variable Neighborhood Search

Indexed keywords

EID: 84897540958     PISSN: 03540243     EISSN: 23346043     Source Type: Journal    
DOI: 10.2298/YJOR121223003U     Document Type: Article

References (24)

1. Arani, T. and Lotfi V., "A three phased approach to final exam scheduling", IIE Transactions, 21 (1989) 86-96.
2. Bhadury, J., Mighty E. J. and Damar, H., "Maximizing workforce diversity in project teams: A network flow approach", Omega, 28 (2000) 143-153.
3. Carrizosa, E., Mladenović, N. and Todosijević, R., "Sum-of-Squares Clustering on Networks", Yugoslav Journal Of Operations Research, 21 (2011) 157-161.
4. Chen, C. C., "Placement and partitioning methods for integrated circuit layout", Ph.D. Dissertation, EECS Department, University of California, Berkeley (1986).
5. Chen, Y., Fan, Z. P., Ma, J. and Zeng S., "A hybrid grouping genetic algorithm for reviewer group construction problem", Expert Systems with Applications, 38 (2011) 2401-2411.
6. Desrosiers J, Mladenovic N and Villeneuve D., "Design of balanced MBA student teams", Journal of Operational Research Society, 56 (2005) 60-66.
7. Falkenauer, E., Genetic Algorithms for Grouping Problems, Wiley: New York (1998).
8. Fan, Z. P., Chen, Y., Ma, J. and Zeng, S., "A hybrid genetic algorithmic approach to the maximally diverse grouping problem", Journal of the Operational Research Society, 62 (2011) 92-99.
9. Feo, T., Goldschmidt, O. and Khellaf, M. "One-half approximation algorithms for the kpartition problem", Operations Research, 40 (1992) S170-S173.
10. Feo, T. and 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 (5) 724-734.
12. Glover, F., Kuo, C. C. and Dhir, K. S. "Heuristic algorithms for the maximum diversity problem", Journal of Information and Optimization Sciences, 19(1) (1998) 109-132.
13. Hettich S. and Pazzani, M. J., "Mining for element reviewers: Lessons learned at the national science foundation", in: Proceedings of the KDD'06, ACM: New York, NY, 862-871.
14. Ilić, A., Urošević, D., Brimberg, J. and Mladenović N., "A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem", European Journal of Operational Research, 206 (2010) 289-300.
15. Kral, J., "To the problem of segmentation of a program", Information Processing Machines, 2 (1965) 116-127.
16. Lotfi V. and Cerveny, R., "A final exam scheduling package", Journal of the Operational Research Society, 42 (1991) 205-216.
17. Mingers, J. and O'Brien, F. A., "Creating students groups with similar characteristics: a heuristic approach", Omega, 23 (1995) 313-321.
18. Mladenović, N., Todosijević, R. and Urošević, D., "An Efficient General Variable Neighborhood Search for Large Traveling Salesman Problem With Time Windows", Yugoslav Journal Of Operations Research, 22 (2012) .
19. Mladenović, N., Urošević, D., Perez-Brito, D. and Garcia-Gonzalez C.G., "Variable neighbourhood search for bandwidth reduction", European Journal of Operational Research, 200 (2010) 14-27.
20. O'Brien, F. A. and Mingers, J., "The equitable partitioning problem: a heuristic algorithm applied to the allocation of university student accommodation", Warwick Business School, Research Paper no. 187 (1995).
21. Weitz, R. R. and Jelassi, M. T., "Assigning students to groups: a multicriteria decision support system approach", Decision Sciences, 23(3) (1992) 746-757.
22. Weitz, R. R. and Lakshminarayanan, S., "On a heuristic for the final exam scheduling problem", Journal of the Operational Research Society, 47 (4) (1996) 599-600.
23. Weitz, R. R. and Lakshminarayanan, 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.
24. Weitz, R. R. and Lakshminarayanan, S., "An empirical comparison of heuristic methods for creating maximally diverse groups", Journal of the Operational Research Society, 49 (6) (1998) 635-646.