Implementasi travelling salesman problem pada pendistribusian air minum menggunakan metode Non-Dominated Sorting Genetic Algorithm (NSGA-II)

ABSTRAK:

Travelling Salesman Problem (TSP) is an optimization problem that seeks the shortest route visiting a number of cities and returning to the starting city. The distribution of drinking water is a critical issue in the management of water resources and requires efficient route planning to save time and costs. The Non-Dominated Sorting Genetic Algorithm II (NSGA-II) method is employed to address the TSP in the context of water distribution. NSGA-II is an evolutionary algorithm used to find optimal solutions in complex search spaces. In this thesis, NSGA-II is applied to generate efficient routes for water distribution

ABSTRACT:

Travelling Salesman Problem (TSP) is an optimization problem that seeks theshortest route visiting a number of cities and returning to the starting city. The distributionof drinking water is a critical issue in the management of water resources and requiresefficient route planning to save time and costs. The Non-Dominated Sorting GeneticAlgorithm II (NSGA-II) method is employed to address the TSP in the context of waterdistribution. NSGA-II is an evolutionary algorithm used to find optimal solutions incomplex search spaces. In this thesis, NSGA-II is applied to generate efficient routes forwater distribution

مستخلص البحث:

مسألة البائع املتجول (TSP) هي مشكلة حتسني تبحث عن أقصر طريق يزور عددا من املدن ويعود إىل املدينة األصلية. يعد توزيع مياه الشرب قضية مهمة يف إدارة املوارد املائية ويتطلب ختطيطا فعاال للطريق ألجل توفري الوقت والتكاليف. واستخدمت طريقة خوارزمية الفرز اجلينية غري املهيمنة يف سياق توزيع مياه الشرب.NSGA-IIهي خوارزمية تطورية تستخدم للبحث عن احللول املثلى يف مساحات البحث املعقدة. يف هذا البحث اجلامعي، يتم تطبيقNSGA-IIإلنتاج طرق فعالة لتوزيع مياه الشرب.