The Fast Swap algorithm is implemented from a paper that uses it for the p-median problem, so the algorithm calculates its objective function, not the ANPCP's.
Quick experiments show that the local search still works, i.e. it improves random solutions. Hopefully it will yield better results by correcting the algorithm to calculate the actual ANPCP objective function.
The Fast Swap algorithm is implemented from a paper that uses it for the p-median problem, so the algorithm calculates its objective function, not the ANPCP's.
Quick experiments show that the local search still works, i.e. it improves random solutions. Hopefully it will yield better results by correcting the algorithm to calculate the actual ANPCP objective function.