Open AccessMulti Integer Linear Programming and the Traveling Salesman Problem
Author(s) -
S. Sathyapriya
Publication year - 2021
Publication title -
international journal for research in applied science and engineering technology
Language(s) - English
Resource type - Journals
ISSN - 2321-9653
DOI - 10.22214/ijraset.2021.34801
Subject(s) - travelling salesman problem , integer programming , mathematical optimization , integer (computer science) , 2 opt , linear programming , bottleneck traveling salesman problem , computer science , binary number , order (exchange) , mathematics , arithmetic , finance , economics , programming language
The Travelling Salesman problem is considered as a binary integer problem. For this problem, several stop variables and subtours are discussed. The stops are generated and the distance between those stops are found, consequently the graphs are drawn. Further the variables are declared and the constraints are framed. Then the initial problem is visualised along with the subtour constraints in order to achieve the required output.