Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi MATHunesa: Jurnal Ilmiah Matematika
Devitasari Simamora
Universitas Islam Negeri Sumatera Utara
Computer Science & IT Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Optimasi Vehicle Routing Problem pada Distribusi Tabung LPG Menggunakan Metode Ant Colony Optimization Devitasari Simamora; Riri Syafitri Lubis; Sri Ulfa Rahayu
Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi Volume 14 Issue 1 April 2026
Publisher : Universitas Negeri Gorontalo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.37905/euler.v14i1.37481

Abstract

Inefficient distribution can increase operational costs; therefore, determining optimal routes is essential to support an efficient distribution process. This problem can be formulated as a Vehicle Routing Problem (VRP), which concerns optimizing vehicle routes from a depot to multiple destinations with minimum travel distance. This study aims to optimize the distribution route of LPG cylinders at PT Jaya Sari Artha by considering 12 distribution points. The method used is Ant Colony Optimization (ACO), a heuristic algorithm inspired by the foraging behavior of ants in finding the shortest path. The data used consist of actual travel distances between distribution points obtained from Google Maps. The results show that the implementation of ACO in the VRP model produces a distribution route with a total distance of 117.40 km, shorter than the company’s initial route of 134.50 km. Thus, a distance saving of 17.10 km or 12.72% was achieved. These findings indicate that the ACO method is effective in solving VRP and improving the efficiency of LPG cylinder distribution in a real-world case.
MODEL OPTIMASI WAKTU TUNGGU LAMPU LALU LINTAS DENGAN METODE WEBSTER Nasya Nasya; Devitasari Simamora; Citra Amanda Putri; Ria Sagita Ningsi
MATHunesa: Jurnal Ilmiah Matematika Vol. 13 No. 2 (2025)
Publisher : Universitas Negeri Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In big cities like Medan, traffic jams are a problem that often occurs, especially in the SM Road T-junction area. King. To overcome this problem, a study was carried out that combined the use of compatible graph modeling and the Webster method. The application of compatible graphs helps in determining the phases of traffic lights and identifying lanes that can operate simultaneously. Meanwhile, the Webster method is used to calculate the ideal waiting time for vehicles. This study resulted in the optimization of two traffic light phases with a total cycle time of 344 seconds, where there was an increase in the duration of the green light on each road section. This system is proven to be more effective because it provides a longer green light flash time compared to red lights. Keywords: Traffic, compatible graph, Webster's method.
Co-Authors Citra Amanda Putri Nasya Nasya Ria Sagita Ningsi Riri Syafitri Lubis Sri Ulfa Rahayu