search

netotz / alpha-neighbor-p-center-problem

Heuristic algorithms for the alpha-neighbor p-center problem.
MIT License
5 stars 0 forks source link

Try to Improve A-FVS #8

Open netotz opened 3 years ago

netotz commented 3 years ago

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.