Balancing heuristics (for timetable problem)
- by genesiss
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?
