Balancing heuristics (for timetable problem)
Posted
by genesiss
on Stack Overflow
See other posts from Stack Overflow
or by genesiss
Published on 2010-06-09T17:56:17Z
Indexed on
2010/06/09
18:02 UTC
Read the original article
Hit count: 275
I'm writing a genetic algorithm for generating timetables.
At the moment I'm using these two heuristics:
- Number of holes between lectures in one day (related) (less holes -> bigger score)
- Each hour has some value, so for each timetable I sum values for hours when lectures are on. (lectures at more appropriate hours -> bigger score)
I want to balance these two heuristics, so the algorithm wouldn't favor neither one. What would be the best way to achieve this?
© Stack Overflow or respective owner