https://interval-fmipa.unpak.ac.id/index.php/intv <p style="text-align: left;"><span style="font-family: Cambria, Georgia, serif;"><strong style="font-family: Verdana, Arial, Helvetica, sans-serif;">Welcome to INTERVAL: Jurnal Ilmiah Matematika</strong></span></p> <p style="text-align: left;"><span style="font-family: Cambria, Georgia, serif;"><span style="font-family: Verdana, Arial, Helvetica, sans-serif;">INTERVAL: Jurnal Ilmiah Matematika is a journal that publishes scientific papers in the field of mathematics. This Journal, run by Mathematics Study Program, Universitas Pakuan, Bogor. The Journal provides opportunities for scholars to submit papers in mathematics, and also management policies related to all aspects of mathematics and its sub-disciplines. Manuscript will not only concern in analysis, algebra, topology, graphics, numerical simulation approaches or what is known as numerical analysis, optimal control, queuing problems, optimization, finance, biomathematics, industrial mathematics, financial mathematics, but also in general science and its applications are welcome, and fields which will be published online. The internet connection will add to the richness of information and scientific knowledge derived mainly from research. This journal is published two times a year, well documented in the form of books, which include a variety of mathematics papers by writers of various backgrounds. In addition, we also have partners from local editor who graduated as profesor from some university who will review each article before publication. Each article or paper published in this Journal will definitely be useful to all visitors and readers. Articles submitted to this journal will be reviewed by reviewers before publication by double blind-review.</span></span></p> Universitas Pakuan en-US Interval : Jurnal Ilmiah Matematika 2809-3526 https://interval-fmipa.unpak.ac.id/index.php/intv/article/view/5 <p><em>The distribution of social assistance requires optimal route planning to enhance the efficiency of time, operational costs, and labor. This study aims to identify an efficient distribution route for social assistance to 12 districts in Pacitan Regency. This issue is modeled as a Traveling Salesman Problem (TSP) and addressed using the Cheapest Insertion Heuristic (CIH) algorithm. This heuristic method gradually inserts points into the route while considering the minimal increase in distance. The data used consists of a distance matrix between districts as distribution points. The implementation of the CIH algorithm yielded an optimal route with the sequence 1-5-11-7-13-12-3-6-2-10-4-9-8-1, resulting in a total travel distance of 188.75 kilometers. This result indicates that the CIH algorithm can produce an efficient distribution route and can serve as a practical alternative solution for the Social Services Department of Pacitan Regency in planning the optimal distribution of assistance.</em></p> Mawar Cahyanindri Maya Widyastiti Copyright (c) 2025 Interval : Jurnal Ilmiah Matematika https://creativecommons.org/licenses/by-nc-sa/4.0 2025-08-28 2025-08-28 5 1