Travelling salesman problem:Integer Programming Solution

versión 1.0.0 (1.91 KB) por RMS Danaraj
This code formulates Travelling salesman problem as binary integer programming and solves it by MATLAB linintprog.

132 descargas

Actualizada 10 Mar 2020

Ver licencia

% 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.

Citar como

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

Compatibilidad con la versión de MATLAB
Se creó con R2019b
Compatible con la versión R2017a a la R2019b
Compatibilidad con las plataformas
Windows macOS Linux
Etiquetas Añadir etiquetas

Community Treasure Hunt

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

Start Hunting!