; otherwise the previous 0-path is restored. The search stops if the current solution is not improved after a sequence of | D | iterations along which all 0-paths are investigated. Otherwise, the next 0-path in the current solution is investigated for substitution and a new iteration 