APPLICATION OF A GENETIC ALGORITHM FOR SOLVING TRAVELING SALESMAN PROBLEM IN ORGANIC PORRIDGE DISTRIBUTION

Authors

  • Hauralia Rahmadanti Finan School of Data Science, Mathematics, and Informatics, Bogor Agricultural University
  • Mochamad Tito Julianto School of Data Science, Mathematics, and Informatics, Bogor Agricultural University
  • Elis Khatizah School of Data Science, Mathematics, and Informatics, Bogor Agricultural University

DOI:

https://doi.org/10.29244/milang.21.2.101-116

Abstract

This study focuses on determining an optimal distribution route for organic porridge products produced by a company and delivered to multiple outlets. Each outlet is visited exactly once, and the delivery process starts and ends at the same outlet. A total of 44 outlets are considered, which are initially divided into nine distribution routes. To improve distribution efficiency, this study proposes reorganizing the outlets into only three distribution routes. Each route formulation is modeled as a Traveling Salesman Problem (TSP). The optimization of the three TSP cases is carried out using a Genetic Algorithm (GA). In the GA implementation, the order of outlets along a route is encoded as a chromosome consisting of a sequence of genes. The fitness function is defined based on the total travel distance, where a smaller value indicates a better solution. The results show that increasing the number of iterations and the size of population, which is the number of candidate routes considered at each step, can reduce the total travel distance up to a certain point. The exact routes and their sequence of outlets can be visualized in a map depicting each of the three optimized paths.

Keywords: Genetic Algorithm, distribution routing, total distance, Traveling Salesman Problem

Downloads

Download data is not yet available.

Downloads

Published

2025-12-30