Nature Inspired Algorithms

 macOS Application used to implement different tasks in winter semester

Hyper-heuristics (HH): a specific type of indirect encoding

 Bin packing problem using FFA, FFD, BF1

An indirect encoding for exam timetabling

 Mutating an indirectly-encoded timetable

Ant Colony Optimization

 ACO for 4-City TSP Problem

Ants are agents that:

• Move along between nodes in a graph.

• They choose where to go based on pheromone strength (and maybe other information)

• An ant’s path represents a specific candidate solution.

• When an ant has finished a solution, pheromone is laid on its path, according to quality of solution.

• This pheromone trail affects behaviour of other ants by stigmergy

 Transition Rule

 Global pheromone update