• IN many optimization problems, path is irrelevant, the goal state itself is solution. for example, (Travelling Shells-man Problem) TSP and N-Queens problem. In such cases, one can use Iterative improvement algorithms. It keeps single current state and try to improve it.
• For the most practical approach in which all the information needed for a solution are contained in the state description itself. The path of reaching a solution is not important.
• Iterative improvement is a technique that approaches a solution by progressive approximation, using the K th approximate solution to find the (k+1) th approximate solution.
Silan Software is one of the India's leading provider of offline & online training for Java, Python, AI (Machine Learning, Deep Learning), Data Science, Software Development & many more emerging Technologies.
We provide Academic Training || Industrial Training || Corporate Training || Internship || Java || Python || AI using Python || Data Science etc