Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Try to Improve A-FVS #8

Open
netotz opened this issue Sep 14, 2021 · 0 comments
Open

Try to Improve A-FVS #8

netotz opened this issue Sep 14, 2021 · 0 comments
Assignees
@netotz
Labels
enhancement New feature or request

Comments

@netotz
Copy link
Owner

netotz commented Sep 14, 2021 •
edited
Loading

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.
@netotz netotz self-assigned this Sep 14, 2021
@netotz netotz added the enhancement New feature or request label Sep 14, 2021
netotz added a commit that referenced this issue Mar 22, 2022
@netotz
feat(fvs): refactor getting g1 and g2 when updating r
08a47a4 
Refs: #8
@netotz netotz changed the title Improve local search algorithms Try to Improve A-FVS May 25, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@netotz netotz

Labels
enhancement New feature or request
Projects
ANPCP code migration to C#
Status: Ready
Milestone
No milestone
Development

No branches or pull requests
1 participant
@netotz