Travelling salesman problem:Integer Programming Solution
% 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 (2023). 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
Compatibilidad con las plataformas
Windows macOS LinuxCategorías
Etiquetas
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Descubra Live Editor
Cree scripts con código, salida y texto formateado en un documento ejecutable.
Versión | Publicado | Notas de la versión | |
---|---|---|---|
1.0.0 |