This script consists of three assertions, two of them (a1, a2) constraining the input range and the other one (a3) constraining the computation result. Let's say we start at a point v where a1 a3 are satisfied while a2 is not. Assume neighbors of v violate a3 but satisfy a2. The general result will be better letting a2 keep unsatisfied because violating a3 actually leads to lower scores or no improvement.
One solution is to add weights which has effects where satisfying a2 yields higher score. This in turn makes sure the variable is within bound.
The other solution is to record the range and use it in generating neighbors/restarts.
This script consists of three assertions, two of them
(a1, a2)constraining the input range and the other one(a3)constraining the computation result. Let's say we start at a pointvwherea1 a3are satisfied whilea2is not. Assume neighbors ofvviolatea3but satisfya2. The general result will be better lettinga2keep unsatisfied because violatinga3actually leads to lower scores or no improvement.One solution is to add weights which has effects where satisfying
a2yields higher score. This in turn makes sure the variable is within bound.The other solution is to record the range and use it in generating neighbors/restarts.