PENYELESAIAN TRAVELING SALESMAN PROBLEM DENGAN KENDALA RELASI PRECEDENCE FUZZY

• Main Author: Ernawati
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/4668
• Institution: Institut Teknologi Bandung

<b>Abstrack</b><p align=\"justify\">A solution for traveling salesman problem with fuzzy precedence relation has been studied and a software prototype for verifying the solution has been developed The software is called FTSP or Fuzzy Traveling Salesman Problem.<p align=\"justify\"> <br /> Traveling salesman problem with fuzzy precedence relation is a extension from Traveling Salesman Problem (TSP) with a degree of importance to visit one city from another city added as a new additional constraint. The degree of importance is a linguistic variable that has fuzzy linguistic values.<p align=\"justify\"> <br /> The solution for this TSP model uses Branch and Bound method from Little, Murty, Sweeney and Karel. Fuzzy Inference is added for making decision in branching process.<p align=\"justify\"> <br /> The FTSP solution will be same as that of TSP if the degree of importance is uniform.<p align=\"justify\"> <br /> Structured method is used as the analysis and design method. FTSP prototype is implemented in Borland Delphi 1.0 on Window 95 operating system.