QAP
Version 1.0.0.0 (2.53 KB) by
Kyriakos Tsourapas
Ant Algorithm for the Quadratic Assignment Problem.
An implementation of an Ant Algorithm to solve the Quadratic Assignment Problem of assigning n departments to n sites.
Cite As
Kyriakos Tsourapas (2024). QAP (https://www.mathworks.com/matlabcentral/fileexchange/1663-qap), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Created with
R12.1
Compatible with any release
Platform Compatibility
Windows macOS LinuxCategories
Find more on Traveling Salesman (TSP) in Help Center and MATLAB Answers
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
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. |