Erratum: A hybrid genetic algorithmic approach to the maximally diverse grouping problem (Journal of the Operational Research Society (2010) DOI:10.1057/jors.2009.168);A hybrid genetic algorithmic approach to the maximally diverse grouping problem

Journal of the Operational Research Society

Volumn 62, Issue 1, 2011, Pages 92-99

  Fan, Z P ^a   Chen, Y ^b   Ma, J ^c   Zeng, S ^d  

^a NORTHEASTERN UNIVERSITY   (China)

^b SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^d UNIVERSITY OF ARIZONA   (United States)

Author keywords

genetic algorithm; local neighbourhood search; maximally diverse grouping problem

Indexed keywords

COMPUTATIONAL COMPLEXITY;

ALGORITHMIC APPROACH; GROUP SIZE; GROUPING PROBLEM; HYBRID ALGORITHMS; HYBRID GA; HYBRID GENETIC; HYBRID HEURISTICS; NEIGHBOURHOOD SEARCH;

GENETIC ALGORITHMS;

EID: 78649958356     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2010.92     Document Type: Erratum

References (32)

1. Aarts E and Lenstra JK (eds) (2003). Local Search in Combinatorial Optimization. Princeton University Press: New Jersey.
2. Arani T and Lotfi V (1989). A three phased approach to final exam scheduling. IIE T 21:86-96.
3. Azimi ZN (2005). Hybrid heuristics for examination timetabling problem. Appl Math C 163:705-733.
4. Baker BM and Benn C (2001). Assigning pupils to tutor groups in a comprehensive school. J Opl Res Soc 52:623-629.
5. Baker KR and Powell SG (2002). Methods for assigning students to groups: A study of alternative objective functions. J Opl Res Soc 53:397-404.
6. Bhadury J, Mighty EJ and Damar H (2000). Maximizing workforce diversity in project teams: A network flow approach. Omega 28:143-153.
7. Bock F (1958). An algorithm for solving 'traveling salesman' and related network optimization problems. Talk given at the 14th ORSA Meeting, St. Louis, 23 October, 1958.
8. Croes GA (1958). A method for solving traveling salesman problems. Operns Res 6:791-812.
9. Davis L (1985). Job shop scheduling with genetic algorithms. In: Grenfenstette JJ (ed). Proceedings of the First International Conference on Genetic Algorithms. L. Erlbaum Associates: Hillsdale, NJ, pp 136-140.
10. Davis L and Steenstrup M (1987). Genetic algorithms and simulated annealing: An overview. In: Davis L (ed). Genetic Algorithm and Simulated Annealing. Morgan Kaufmann Publishers: San Mateo, CA, pp 1-11.
11. Etiler O, Toklu B, Atak M and Wilson J (2004). A genetic algorithm for flow shop scheduling problems. J Opl Res Soc 55:830-835.
12. Falkenauer E (1998). Genetic Algorithms for Grouping Problems. Wiley: New York.
13. Feo T and Khellaf M (1990). A class of bounded approximation algorithms for graph partitioning. Networks 20:181-195.
14. Feo T, Goldschmidt O and Khellaf M (1992). One-half approximation algorithms for the k-partition problem. Opns Res 40:170-173.
15. Gen M and Cheng R (1997). Genetic Algorithms and Engineering Design. Wiley: New York.
16. Goldberg DE (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley: MA.
17. Gorges-Schleuter M (1989). ASPARAGOS: An asynchronous parallel genetic optimization strategy. In: Schaffer J (ed). Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann Publishers: San Mateo, CA, pp 422-427.
18. Hettich S and Pazzani MJ (2006). Mining for element reviewers: Lessons learned at the national science foundation. In: Proceedings of the KDD'06. ACM: New York, NY, pp 862-871.
19. Holland JH (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press: Ann Arbor, USA.
20. Lotfi V and Cerveny R (1991). A final-exam-scheduling package. J Opl Res Soc 42:205-216.
21. Miller J, Potter W, Gandham R and Lapena C (1993). An evaluation of local improvement operators for genetic algorithms. IEEE T Syst Man Cybern 23:1340-1351.
22. Mühlenbein H (1992). How genetic algorithms really work: Part I. Mutation and hill-climbing. In: Männer R and Manderick B (eds). Parallel Problem Solving from Nature: PPSN II. Elsevier Science Publishers: North-Holland, pp 15-26.
23. Shi G (1997). A genetic algorithm applied to a classic job-shop scheduling problem. Int J Sys Sci 28:25-32.
24. Vaessens RJM, Aarts EH and Lenstra JK (1998). A local search template. Comput Opns 25:969-979.
25. Vasko FJ, Knolle PJ and Spiegel DS (2005). An empirical study of hybrid genetic algorithms for the set covering problem. J Opl Res Soc 56:1213-1223.
26. Wang HF and Wu KY (2003). Modeling and analysis for multi-period, multi-product and multi-resource production scheduling. J Intell M 14:297-309.
27. Wang HF and Wu KY (2004). Hybrid genetic algorithm for optimization problems with permutation property. Comput Opns 31(14):2453-2471.
28. Weitz RR and Jelassi MT (1992). Assigning students to groups: a multi-criteria decision support system approach. Dec. Sci 23:746-757.
29. Weitz RR and Lakshminarayanan S (1996). On a heuristic for the final exam scheduling problem. J Opl Res Soc 47:599-600.
30. Weitz RR and Lakshminarayanan S (1998). An empirical comparison of heuristic methods for creating maximally diverse groups. J Opl Res Soc 49:635-646.
31. Whitley D, Starkwether T and Shaner D (1991). The traveling salesman and sequence scheduling problems: Quality solutions using genetic edge recombination. In: Davis L (ed). Handbook of Genetic Algorithms. Van Nostrand Reinhold: New York; USA, pp 350-372.
32. Yannakakis M (1990). The analysis of local search problems and their heuristics. In: Choffrut C and Lengauer T (eds). Proceedings 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS 90), Lecture Notes in Computer Science, Vol. 415. Springer-Verlag: London, pp 298-311.