Teaching advanced features of evolutionary algorithms using japanese puzzles

IEEE Transactions on Education

Volumn 50, Issue 2, 2007, Pages 151-156

  Salcedo Sanz, Sancho ^a   Portilla Figueras, Jose A ^a   Ortíz García, Emilio G ^a   Pérez Bellido, Ángel M ^a   Yao, Xin ^b  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Advanced encodings; Evolutionary algorithms (EAs); Japanese puzzles; Local search; Memetic algorithms; Teaching method

Indexed keywords

ENCODING (SYMBOLS); GAME THEORY; HEURISTIC METHODS; OPTIMIZATION; TEACHING;

JAPANESE PUZZLES; LOCAL SEARCH; MEMETIC ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 34249060245     PISSN: 00189359     EISSN: None     Source Type: Journal    
DOI: 10.1109/TE.2007.893170     Document Type: Article

References (18)

1. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
2. Z. Michalewicz, Genetic Algorithms + data structures = Evolution Programs. Berlin, Germany: Springer-Verlag, 1996.
3. X. Yao, "A research-led and industry-oriented MSc program in Natural Computation," IEEE Comput. Intell. Mag., vol. 1, no. 1, pp. 39-40, Feb. 2006.
4. X. Yao, "How does evolutionary computation fit into IT postgraduate teaching," in Proc. Congress Evolutionary Computation, Washington, D.C., 1999, vol. 3, pp. 1707-1713.
5. G. Pataki, "Teaching integer programming formulations using the traveling salesman problem," SIAM Rev., vol. 45, no. 1, pp. 116-123, 2003.
6. Y. H. Liao and C. T. Sun, "An educational genetic algorithms learning tool," IEEE Trans. Educ., vol. 44, no. 2, pp. 20-30, May 2001.
7. E. Bütün, "Teaching genetic algorithms in electrical engineering education: A problem-based learning approach," Int. J. Electr. Eng. Educ., vol. 42, no. 3, pp. 223-233, 2005.
8. Y. J. Cao and Q. H. Wu, "Teaching genetic algorithm using MATLAB," Int. J. Electr. Eng. Educ., vol. 36, no. 2, pp. 139-153, 1999.
9. D. Jackson and A. Fovorque, "The use of animation to explain genetic algorithms," in Proc. Technical Symp. Computer Science Education, San Jose, CA, 1997, pp. 243-247.
10. C. Prince, R. Wainwright, D. A. Schoenefeld, and T. Tull, "GATutor: A graphical tutorial system for genetic algorithms," in Proc. 25th Symp. Computer Science Education, Phoenix, AZ, 1994, pp. 203-207.
11. M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1997.
12. D. Beasley, D. R. Bull, and R. Martin, "An overview of genetic algorithms: Part 1 fundamentals," University Computing, vol. 15, no. 2, pp. 58-69, 1993.
13. N. Krasnogor and J. Smith, "A tutorial for competent memetic algorithms: Model, taxonomy and design issues," IEEE Trans. Evol. Comput., vol. 9, no. 5, pp. 474-488, Oct. 2005.
14. G. Duncan, Puzzle Solving, Computer Science Dept., Univ. York, York, U.K., B.Sc. Degree Final Project Rep., 1999.
15. B. J. Batenburg and W. A. Kosters, "A discrete tomography approach to Japanese puzzles," in Proc. Belgian-Dutch Conf. Artificial Intelligence, Groningen, The Netherlands, 2004, pp. 243-250.
16. J. Benton, R. Snow, and N. Wallach, A Combinatorial Problem Associated With Nonograms, Artificial Intelligence Dept., Stanford Univ., Stanford, CA, Internal Rep., 2005.
17. N. Ueda and T. Nagao, NP-Completeness Results for Nonograms Via Parsimonious Reductions, Computer Science Dept., Univ. Tokyo, Tokyo, Japan, Internal Rep., 1996.
18. F. Glover, "Tabu search: A tutorial," Interfaces, vol. 20, no. 4, pp. 74-94, 1990.