QAP

Ant Algorithm for the Quadratic Assignment Problem.

Version 1.0.0.0 (2.53 KB)
5.5K Downloads
(6)
28 Apr 2008

You are now following this Submission

An implementation of an Ant Algorithm to solve the Quadratic Assignment Problem of assigning n departments to n sites.

Cite As

Kyriakos Tsourapas (2026). QAP (https://in.mathworks.com/matlabcentral/fileexchange/1663-qap), MATLAB Central File Exchange. Retrieved .

Categories

Find more on Traveling Salesman (TSP) in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab
Version Published Release Notes
1.0.0.0

Fixed two problems found by Marie-Cécile Alvarez.

I was using the lower probability site instead of the highest one.

Also, I was storing the wrong assignment.

Thank you Marie-Cécile for pointing out these bugs.