QAP

Ant Algorithm for the Quadratic Assignment Problem.

Versione 1.0.0.0 (2,53 KB)
5,5K download
(6)
28 apr 2008

Al momento, stai seguendo questo contributo

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

Cita come

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

Categorie

Scopri di più su Traveling Salesman (TSP) in Help Center e MATLAB Answers

Informazioni generali

Compatibilità della release di MATLAB

  • Compatibile con qualsiasi release

Compatibilità della piattaforma

  • Windows
  • macOS
  • Linux
Apri in una nuova scheda
Versione Pubblicato Note della release
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.