UNDER CONSTRUCTION!

MCS 770, Genetic Algorithms, Online Material

You have reached the Web index page for the Genetic Algorithms online material.

Questionnaire

Here is the questionnaire you are required to answer to confirm your registration in this class. Send me your answers by e-mail.

Class Handouts

Syllabus
First and Last Homework Assignments

NOTE! Use Pr7 to submit your three final exam questions (with answers) and your answers to the other questions.

Mid-Term

The mid-term will be in class Monday, May 13, 1996. It will be closed book short answer or numerical. About 60-75 minutes in length. It will cover chapters 1 through 5 in the text and the additional material we have gone over in class.

From the catalog: ``In the spring term only, senior undergraduate students in their last term of academic work may arrange to be exempt from final examination if the student's estimated grade for the entire term, as indicated by the instructor on the last day of the term, is passing and is sufficiently high that his or her cumulative average will meet the grade point average required for graduation.''

Reading Assignments

Reading assignments are listed here.

Homework Assignments

Homework assignments, such as problems at the chapter ends to prepare for class, are listed here.

Programming Assignments

Programming assignments are listed here.

Project

Each student will do a project for this course.

NOTE! Use Pr6 to submit your project documents: source code, sample runs, and the paper itself. Bring hardcopy of your paper to class.

Examples

Here is an example run of the AGAC genetic algorithm program.

Here is an example run of the AGA genetic algorithm program, rewritten in Java.

Here is an example run of the SGA-C genetic algorithm program.

Here is an example run of the simple_ga_prog genetic algorithm program.

Lecture Notes

Eventually, all the lecture files will be converted to HTML, but for the time being most will appear as ``pre-formatted'' material.

First Class
Introduction
Theory
Schema Theorem Math (Postscript)
GA Programs
Applications
GAs and Steiner Triple Systems (paper)
GAs and Steiner Triple Systems (talk)
SATs and Steiner Systems (paper)
SATs and Steiner Systems (talk)
Advanced Techniques
Classifier Systems
Combinatorial Optimization (Postscript)
Genetic Programming

Other On-Line Material

A two-part overview of genetic algorithms with an academic, theoretical, and research orientation (in Postscript): Part 1, Part 2.

Genetic Algorithms FAQ.
Genetic Algorithms FAQ (same thing at an alternative location).
Where to try to get the FAQ if the above do not work.
Other GA sites (this file is a year old so some links in it may not work).
Another GA Web site.
GA archive Web site.

This is an excellent place to get additional GA info. It is an image map, so just click where you want to go.

SJH
shartley@mcs.drexel.edu