Est. Budget: $200.00
The task is to implement an algorithm for quickly finding an approximate solution to the following problem:
Given two square matrices A and B, minimize ||PAP'−B|| over all permutation matrices P.
The matrices A and B are no larger than 500 by 500.
There are several types of algorithms for these kinds of problems, like iterative improvement, simulated annealing, tabu search, genetic algorithms, evolution strategies, ant algorithms, and scatter search. Existing software should be used as much as possible ...