THE TRAVELLING SALESMAN PROBLEM SOLUTION BY MIXED INTEGER LINEAR PROGRAMMING IN MATLAB CODE

Abstract

This article introduces one more specific solution of the travelling salesman problem. The seller has to distribute, using his truck, goods from the depot (warehouse) to n customers. Each customer point of delivery is given by GPS coordinates. This problem can be called the travelling salesman problem. The objective of the solution is to select the sequence of delivery points so that firstly the travel distance and subsequently the total travel time are minimal. The seller visits all delivery points and returns to the depot. In this article, one general solution is presented using the bound-and-branche method and by using mixed integer linear programming implemented in Matlab code. The created algorithm can be used for any number n of customers.