Heuristics2015

From Heuristics

Jump to: navigation, search


Contents

Information

  • Period: 3 (januari 2015)
  • EC: 6
    • This means you should be working full time on Heuristics
  • Required Knowledge: Being able to program in some language comes recommended, being interested is most important though.
  • Required course for: 3rd-year BWI
  • Optional course for: 3rd-year AI, IMM, Comp. Science and others
  • Examination: Solve one of the assignments --by any means necessary-- present your results on a mini symposium and a small report.
  • Literature: None


Slides

Outline

During the first class groups of 3 students are formed by the students themselves. Each group chooses one of the assignments and tries to solve this using a heuristic algorithm. At the end of the course you present your solution in a presentation and a report. The solution, presentations and reports are graded on their quality.

During the first week there are two lectures to provide you with some theory on problems and their solutions. During the four weeks of the course we have "interactive workgroups". Here every group presents the progress they have made to the other teams. After this short presentation everyone is allowed to ask questions, make suggestions etc. You also get feedback on your presentation: what went well and what can be improved. If needed it is possible to receive some extra support.

The entire course will be critical but fair and respectful. We will not embarras anyone, making mistakes is allowed and we applaud experimentation. We will not force you to present your work during the workgroups, although we do highly encourage it, any feedback we give is to help you improve not to put you down.


Report, Presentation & Deadlines

Report

  • Mail the report to: bshrmlk@gmail.com
  • The report is limited to 6 pages only, excluding title page (More than 6 means an insufficient mark)
    • Do not put your results in an appendix! Results are an integral part of your answer and do not belong in an appendix, if you put them in an appendix they will be counted as if they are lacking.
  • You are allowed to write your report both in dutch and english
  • Your report should at least contain:
    • An introduction
      • Give a short summary of your assignment
      • Discuss the characteristics of the problem
    • Middle
      • Describe your solution of the problem, your algorithm. Do not put literal code here! (Pseudo-code can be used)
      • Results
      • Analysis of your results, what is the quality of your solution?
    • Conclusion
      • Short summary of your report

Report Evaluation
While grading your report we will take the following into account:

  • Structure of your report
  • Layout
  • Language (do a grammar and spell check)
  • Quality of your solution
  • The right level of abstraction of your description
  • Positioning of your solution/algorithm (for example The algorithm is iterative and stochastic and trying to keep the runtime low).
  • Creativitity of the Heuristic

Presentation

  • Every group needs to present their problem and their solution
    • Presentations will be arranged in a morning and afternoon group.
    • Attendance is compulsory for the morning or afternoon where you are presenting (So if your presentation is in the morning, you should be there the entire morning)
  • Every group is allowed to do a try-out for their presentation on Wednesday January 29th
    • Doing a try-out is not required, but it is highly recommended
  • The subject of your presentation is the same as for the report
  • Presentations are limited to 10 minutes after which we will have 5 minutes for questions.

Opgaven

Tiling Freecell
Place irregular tiles into a predefined rectangle. Create an algorithm that solves games of FreeCell.
Global Traffic Amstelhaege
Create an optimal schedule for the aircraft of Mokum Airways. You are a district planner, plan the build of a new housing district.
The Thinktank
Room for new ideas.


Mensen

Guszti Eiben
Guszti Eiben is professor in Computational Intelligence. In 1989 he started his research in genetic and evolutionary algorithms. He teaches the Evolutionary Computing course and has writting the book on Evolutionary Computing: Introduction to Evolutionary Computing. Guszti will be giving the lectures and is one of the graders
upright=0.4
Bushra Malik
Bushra Malik
Berend Weel
Berend Weel is a PhD student in the Computational Intelligence groep. His research is on the use of evolutionary algorithms for robotics. He is currently working on creating a framework for evolution of physical systems (e.g. modular robots or 3d printed robots etc.)

Kamer: T 3.14
Email: [| Berend Weel]
upright=0.4

Alumni

Ruben Balk (alumnus) upright=0.4
Daan van den Berg (alumnus) upright=0.4
Joris de Ruiter (alumnus)

upright=0.4

Robbert Bronkers (alumnus) upright=0.4

Links

Personal tools