Application of genetic algorithms for multiple traveling salesman problems: a case study of distribution of sacrificial animal meat at the Islamic center in Mataram city

Wais Alqorni, Adhi Prahara

Abstract


Islamic Center of Mataram is the center of Islamic religious activities. On Eid al-Adha and Tasyrik Day, animals are slaughtered. The average amount of animal meat that will be distributed annually is 7500 Kg of raw meat where will be distributed to 9 (nine) urban villages in Mataram City. In distributing the meat of the sacrificial animal, they only have limited time and staff, which is only done on 3 days of Tasyrik or sometimes only 2 days because the slaughtering is not carried out immediately after Eid prayer. Distribution starts from 12.00 - 16.00 every day. To help the problem of the distribution process, known as the Multiple Traveling Salesman Problem, the author uses a genetic algorithm to solve the problem. To build a software to implement Genetic Algorithm on the M-TSP problem in the distribution of sacrificial animal meat, several stages are carried out, starting from collecting data used to apply genetic algorithms, designing display prototypes and features to be able to process the data that has been collected, stages of system coding become a web-based system and finally testing the system that has been made. By implementing officer data and distribution locations which will then be tested using one of algorithms, namely the Genetic Algorithm. The accuracy and efficiency of the total distance that will be taken in making a distribution route using this algorithm where calculation is carried out by finding the largest fitness value from several kromosomal populations that are generated after going through crossover process and gene mutations on each kromosome. The result from this system tests with different method are 100% from using a black box, and 81.7 from using SUS testing which is classified as good. The best average fitness value resulting from testing the distribution system of sacrificial animal meat using the number of chromosomes 9 as many as 5 experiments using the number of generations 3, and the crossover parameter = 40% and mutation = 40% which is 0.045 with a total distance of 22.33 km. The design of this system is very useful for the administrators Islamic Center of Mataram ta'mir as a reference in determining optimal route in process of distributing sacrificial animal meat as well as for authors in applying the scientific theory they have.

Full Text:

PDF

References


Moh Soleh. 2021. "Distribution of Sacrificial Animal Meat". Personal Interview Results: January 10, 2021, Islamic Center Mataram City

A. M. Rizki, W. F. Mahmudy, and G. E. Yuliastuti, "Optimization of Multi Travelling Salesman Problem (M-TSP) for Product Distribution in Home Textile Industry with Genetic Algorithms," KLIK J. Compute Science. , vol. 4, no. 2, pp. 125–135, Sep. 2017, doi: 10.20527/click.v4i2.86.

S. W. H. Yudhi, "Solving Multiple Travelling Salesman Problem (Multi-TSP) by Order Crossover Method in Genetic Algorithm (Case Study: Customer Data of Newspaper Agents in Singkawang City)," Bimaster Bul. Ilm. Mat. Stat. and Ter. , vol. 8, no. 2, pp. 157–166, Feb. 2019, doi: 10.26418/bbimst.v8i2.31310.

R. R. Andrianto, L. Muflikhah, and B. Rahayudi, "Optimization of Adult Horse Feed Composition Using Genetic Algorithms," J. Breeders. Technol. Inf. and Compute Science. , vol. 2, no. 10, pp. 3274–3279, 2018.

M. A. Arsyad, D. Supriyadi, V. Anggie, L. N. Hidayah, and D. P. Pratiwi, "Application of the A Star Algorithm for the Shortest Route Search for Inpatient Health Centers in Banyumas," Conf. Electr. Eng. Telemat. Ind. Technol. Creat. Media, vol. 2, no. 1, pp. 74–82, 2020.

M. A. F. C. Firdous, "Proximity Search System Using Android-Based Haversine Method," J. Univ. PGRI Kediri, pp. 1–8, 2017.

H. T. Hidayat, "Decision Support System for Finding the Shortest Distance to Hospitals and Health Centers by the DIJKSTRA Method," e-Journal TECHSI, vol. 8, no. 1, pp. 95– 124, 2016, doi: https://doi.org/10.29103/techsi.v8i1.119.

Y. D. Mahendra, N. Nuryanto, and A. Burhanuddin, "The Closest Distance Determination System in Blood Delivery in PMI Semarang City using the Greedy Algorithm Method," J. Komtika, vol. 2, no. 2, pp. 136–142, Feb. 2019, doi: 10.31603/komtika.v2i2.2601.

D. Fitriati and N. M. Nessrayasa, "Implementation of Hill Climbing Algorithm in Determining the Shortest Distance of Tourist Cities in Indonesia," J. Ris. Inform. , vol. 1, no. 3, pp. 127–132, Jul. 2019, doi: 10.34288/jri.v1i3.35.

D. E. Gomes, M. I. D. Iglésias, A. P. Proença, T. M. Lima, and P. D. Gaspar, “Applying a genetic algorithm to a m-TSP: case study of a decision support system for optimizing a beverage logistics vehicles routing problem,” Electronics, vol. 10, no. 18, p. 2298, 2021.




DOI: https://doi.org/10.31763/simple.v4i1.31

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Wais Alqorni, Adhi Prahara

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.


Signal and Image Processing Letters

ISSN Online: 2714-6677 | Print: 2714-6669
Published by Association for Scientific Computing Electrical and Engineering (ASCEE)
Website : https://simple.ascee.org/index.php/simple/
Email 1 : simple@ascee.org
Email 2 : azhari@ascee.org


 

View My Stats