Partitioning using heuristics

• Minimum cost function can be achieved by trying very large number of solutions ( exponential relation to number of operations)

? heuristics are used for good solution that may show minimum cost function for some local properties

• Start with constructive initial solution on which iterative procedure can be applied to improve the solution

  • exchange operations or paths between partitions, apply procedure

• A good heuristic is relatively insensitive to initial solution

  • exchange of large number of operation makes it more insensitive to starting solution

Previous slide

Next slide

Back to first slide

View graphic version