Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Polygon: Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam
Nazwa Salsyabilla Ramadhani
Unknown Affiliation
Computer Science & IT

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

Found 2 Documents
Search

 1 
Desain dan Implementasi Web Pemesanan Makanan untuk Mempercepat Proses Antrean Pelanggan Rifqi Putra Winanda; Nazwa Salsyabilla Ramadhani; Repi Meilani Putri; Nuriana Sipahutar
Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 3 No. 6 (2025): November : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/polygon.v3i6.781

Abstract

Lengthy, disorganized physical queues in conventional food ordering systems, particularly within canteens, significantly compromise customer convenience and operational efficiency. This direct-ordering model often results in crowd congestion, unpredictably long waiting times, and potential friction among patrons. To address these operational issues and substantially enhance user satisfaction, this research proposes the development and implementation of an innovative Web-Based Food Ordering System. This digital platform allows customers to place orders entirely online, effectively eliminating the need for physical queuing. The system's core functionality is the realtime monitoring of order status and queue position, providing transparent information directly to the customer's device. For canteen management, the application offers a crucial tool for integrated and structured order handling, ensuring staff can prepare meals more accurately and promptly. By transforming the ordering process into a streamlined digital workflow, the system is expected to accelerate the service cycle, minimize unnecessary crowding, and substantially improve customer satisfaction through a modernized, well-organized, and highly efficient experience. This initiative represents a significant step toward smarter and more responsive food service operations.
Penerapan Algoritma Dijkstra dalam Optimasi Rute Terpendek dari Stasiun Kereta Api Medan ke Universitas Negeri Medan Nazwa Salsyabilla Ramadhani; Juliana Gloria Br. Sipayung; Maria Winarni Br Silitonga; Mika Monika Fransiska Simanullang
Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 3 (2026): Mei : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/polygon.v4i3.961

Abstract

The increasing complexity of urban transportation systems demands intelligent and measurable navigation methods. Medan City, the capital of North Sumatra Province, has a dense road network with multiple route options that often confuse road users. Dijkstra's Algorithm, developed by Edsger Wybe Dijkstra in 1959, is a greedy-based computational approach proven effective for solving the shortest path problem on non-negative weighted graphs. This study applies Dijkstra's Algorithm to determine the shortest route from Medan Railway Station to Universitas Negeri Medan (UNIMED). The road network was modeled as an undirected weighted graph with 15 nodes and 16 edges, where edge weights represent actual road distances measured via Google Maps. The graph has a density of 0.152, confirming its sparse graph characteristic. Three alternative routes were identified and analyzed. The algorithm was implemented in Python 3 using the heapq module as a priority queue. Results show that the optimal route is A → B → C → E → F → M → N → O via Jl. M.T. Haryono, Jl. Aipda KS Tubun, Jl. Madong Lubis, and Jl. Prof. H.M. Yamin, with a total distance of 6.64 km. This achieves 99.1% accuracy compared to Google Maps, with a deviation of only 0.06 km. The optimal route is 6.25% more efficient than Alternative Route 1 (7.30 km) and 11.9% more efficient than Alternative Route 2 (7.54 km). The algorithm executes in under 1 millisecond with time complexity O((V+E) log V). These findings confirm Dijkstra's Algorithm as highly effective for medium-scale urban road network optimization.
Co-Authors Juliana Gloria Br. Sipayung Maria Winarni Br Silitonga Mika Monika Fransiska Simanullang Nuriana Sipahutar Repi Meilani Putri Rifqi Putra Winanda