Download PDFOpen PDF in browser

The Exact Solution of Travelling Salesman by Mixed Integer Programming in Matlab

EasyChair Preprint no. 8439

6 pagesDate: July 10, 2022

Abstract

This contribution comes up with a specific solution of the travelling salesman problem. The driver of hauler has to deliver, using his truck, goods from the depot to n customers. Each customer point of delivery is given by GPS coordinates. 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 driver visits all delivery points and returns to the depot. In this contribution, one general solution is presented using the bound and branche method and by using mixed integer linear programming implemented in M-function. The created algorithm can be used in general for any number n of customers.

Keyphrases: Branch and Bound, MATLAB, Mixed Integer Linear Programming, Travelling Salesman Problem

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
@Booklet{EasyChair:8439,
  author = {Jaromir Zahradka},
  title = {The Exact Solution of Travelling Salesman by Mixed Integer Programming in Matlab},
  howpublished = {EasyChair Preprint no. 8439},

  year = {EasyChair, 2022}}
Download PDFOpen PDF in browser