Mathematically, we can formulate the problem by defining two n by n matrices: a flow matrix F whose (i,j) element represents the flow between facilities i and j, and a distance matrix D whose (i,j) element represents the distance between locations i and j. We represent an assignment by the vector p, which is a permutation of the numbers {1, 2, ... , n }. p(j) is the location to which facility j is assigned.
With these definitions, the QAP can be written as
The most effective algorithms for optimally solving quadratic assignment problems are based on Branch and Bound.
Give us your comments.
[ OTC Home Page | NEOS Server | NEOS Guide | Case Studies ]