Travelling salesman problem:Integer Programming Solution

버전 1.0.0 (1.91 KB) 작성자: RMS Danaraj
This code formulates Travelling salesman problem as binary integer programming and solves it by MATLAB linintprog.
다운로드 수: 189
업데이트 날짜: 2020/3/10

라이선스 보기

% This code solves the travelling salesman problem.
% Part 1 data formating.
%-------------------
% n is the number pf cities.
%MATLAB linprog solver converge to global solution for n<40
% so if n>40 change solver options or use some other solver[CPLEX,GUROBI ,...] interface
%(x,y) is the cartesian coordinatea id rge cities.
% n (x,y) coordinate pairs are created randomly.
n=30;
% MATLAB intlinprog solver may not get global solution if n>40.

인용 양식

RMS Danaraj (2024). Travelling salesman problem:Integer Programming Solution (https://www.mathworks.com/matlabcentral/fileexchange/74482-travelling-salesman-problem-integer-programming-solution), MATLAB Central File Exchange. 검색됨 .

MATLAB 릴리스 호환 정보
개발 환경: R2019b
R2017a에서 R2019b까지의 릴리스와 호환
플랫폼 호환성
Windows macOS Linux
태그 태그 추가

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
버전 게시됨 릴리스 정보
1.0.0