Search
Now showing items 1-2 of 2
APLIKASI ALGORITMA SEMUT DAN ALGORITMA CHEAPEST INSERTION HEURISTIC PADA TRAVELLING SALESMAN PROBLEM (TSP)
(2013-06-20)
Travelling Salesman Problem (TSP) is travels problem a salesman must visit n vertex with each vertex has visited once only and back (return) to the initial vertex, such that the total travel distance is minimized. TSP can ...
OPTIMASI RUTE MULTIPLE-TRAVELLING SALESMAN PROBLEM MELALUI PEMROGRAMAN INTEGER DENGAN METODE BRANCH AND BOUND
(2013-06-20)
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 ...