FROM chao 2. Technical consideration of network design from slide no 25:
Project:
relevant to meta heuristic
can select any of tabu searchm genetic or simulated annealing.
Greedy
Always find nearest for each iteration
They get trapped in local maximum, It is not the best solution but its best in that neighbourhood.
Flow chart: EZPZ
population → Generation → Parents → offsprings
Offsprings are added to population
Crossover