QAP

Ant Algorithm for the Quadratic Assignment Problem.

버전 1.0.0.0 (2.53 KB)
다운로드 수: 5.5K
(6)
2008/4/28

이 제출물을 팔로우합니다

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

인용 양식

Kyriakos Tsourapas (2026). QAP (https://kr.mathworks.com/matlabcentral/fileexchange/1663-qap), MATLAB Central File Exchange. 검색 날짜: .

카테고리

Help Center 및 MATLAB Answers에서 Traveling Salesman (TSP)에 대해 자세히 알아보기

일반 정보

MATLAB 릴리스 호환 정보

  • 모든 릴리스와 호환

플랫폼 호환성

  • Windows
  • macOS
  • Linux
새 탭에서 열기
버전 퍼블리시됨 릴리스 정보
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.