OPTIMASI RUTE MULTIPLE-TRAVELLING SALESMAN PROBLEM MELALUI PEMROGRAMAN INTEGER DENGAN METODE BRANCH AND BOUND

Abstract

This article aims to find the optimal route of Multiple-Traveling Salesman Problem (m-TSP) on integer programming with Branch and Bound method. In this article, two major steps undertaken to formulate an integer programming formulation of m-TSP prepared by the number of cities (n), the number of sales (m), and the minimum amount the city must pass by each sales (K); and computing the integer programming m-TSP with optimization program LPSolve IDE 5.5.0.5 that uses Branch and Bound method in its iteration steps to obtain the integer output. The use of binary integers 0-1 are intended as information whether the route from point vi to vj passed or not by the salesmen that are assigned.