Travelling salesman problem:Integer Programming Solution

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


Updated Tue, 10 Mar 2020 19:36:32 +0000

View License

% 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.
% MATLAB intlinprog solver may not get global solution if n>40.

Cite As

RMS Danaraj (2023). Travelling salesman problem:Integer Programming Solution (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2019b
Compatible with R2017a to R2019b
Platform Compatibility
Windows macOS Linux
Tags Add Tags

Community Treasure Hunt

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

Start Hunting!
Version Published Release Notes