Currently the A-FVS algorithm is the default local search. First it checks if the objective function value can be reduced by "breaking" the critical allocation, then it iterates the closed facilities. If a swap reduces the objective function, the procedure repeats.
The A-FVS should be checked and see if it can be improved by reducing steps, refactoring code or using other data structures.
Currently the A-FVS algorithm is the default local search. First it checks if the objective function value can be reduced by "breaking" the critical allocation, then it iterates the closed facilities. If a swap reduces the objective function, the procedure repeats.
The A-FVS should be checked and see if it can be improved by reducing steps, refactoring code or using other data structures.