Dijkstra's Algorithm

Laporan final project ini membahas rancang bangun Sistem Pengelolaan Rute Transportasi Kota Pintar menggunakan struktur data Graph (Adjacency List) dan Algoritma Dijkstra. Program diimplementasikan menggunakan bahasa C berbasis teks (CLI) untuk menemukan rute perjalanan terpendek antar-lokasi secara efisien. Proyek ini ditujukan untuk memenuhi tugas akhir mata kuliah Praktikum Struktur Data di Universitas Pembangunan Nasional "Veteran" Jakarta

This research paper presents an autonomous robot-based warehouse management system that optimizes product retrieval using Dijkstra's algorithm for energy-efficient and collision-aware pathfinding. The system integrates a computer vision module trained on a custom dataset containing six distinct product classes to ensure accurate item identification and inspection. Real-time inspection is achieved through two deep learning models: DETR (87.56% accuracy) and YOLOv8 (87.26% accuracy), capable of classifying products as damaged, open, or perfect, enhancing quality control at the point of pickup. To validate system performance, three core operational scenarios are analyzed: (1) single-robot operation, (2) coordinated multi-robot interaction, and (3) high-density inventory environments. In multi-robot scenarios, a conflict mitigation strategy based on task initiation time prioritization and dynamic rerouting prevents collisions and deadlocks. For orders exceeding two items, a load-balancing strategy is applied where the first robot handles the initial two products while additional robots retrieve the rest, ensuring parallelism and efficiency. The system minimizes delays by evaluating multiple path options in real time, selecting the shortest available route while avoiding congested zones. Experimental case studies confirm the system's adaptability, robustness, and scalability in handling varied warehouse conditions and product types. This architecture demonstrates potential for full automation in industrial warehouses. Future work will focus on global delay computation, improved dynamic path prediction, and real-time decision-making enhancements to support increasingly complex warehouse workflows.

This study presents the design, development, and evaluation of an Online Cemetery Management System (OCMS) with an integrated mapping module that uses Dijkstra's Algorithm for path selection, implemented at Holy Gardens Memorial Park in Taytay, Rizal, Philippines. Traditional cemetery operations continue to rely on paper-based records, informal reservation channels, and static physical maps, resulting in inefficiencies, data inconsistencies, and navigational difficulties, particularly during peak visitation periods such as Undas. To address these challenges, the system integrates Geographic Information Systems (GIS) via Leaflet.js with PostGIS-enabled spatial databases, real-time GPS navigation, augmented-reality wayfinding, and an online burial-plot reservation module within a unified web-based platform. The system was developed using an Agile methodology with a Node.js and Express.js backend, PostgreSQL with PostGIS for spatial data management, and EJS for server-side rendering.

This study presents the design, development, and evaluation of an Online Cemetery Management System (OCMS) with an integrated mapping module that uses Dijkstra’s Algorithm for path selection, implemented at Holy Gardens Memorial Park in Taytay, Rizal, Philippines. Traditional cemetery operations continue to rely on paper-based records, informal reservation channels, and static physical maps, resulting in inefficiencies, data inconsistencies, and navigational difficulties, particularly during peak visitation periods such as Undas. To address these challenges, the system integrates Geographic Information Systems (GIS) via Leaflet.js with PostGIS-enabled spatial databases, real-time GPS navigation, augmented-reality wayfinding, and an online burial-plot reservation module within a unified web-based platform. The system was developed using an Agile methodology with a Node.js and Express.js backend, PostgreSQL with PostGIS for spatial data management, and EJS for server-side rendering. Evaluation followed ISO/IEC 25010 quality standards across seven domains: Functional Suitability, Performance Efficiency, Compatibility, Usability, Reliability, Security, and Portability. Quality assurance testing employed Cypress, Postman, Google Lighthouse, OWASP ZAP, and BrowserStack, yielding scores between 8/10 and 9/10. User evaluation data collected from 63 respondents produced mean scores ranging from 3.66 to 3.90 on a 4-point Likert scale, with all domains rated as Excellent. The findings demonstrate that integrating GIS, algorithmic pathfinding, and web-based administrative tools within a single platform effectively addresses the operational gaps identified in both the literature and existing cemetery management applications. The study contributes to the growing body of research on digital cemetery management by providing an empirically validated, open-source implementation model applicable to resource-constrained cemetery administrations in Southeast Asia and comparable contexts.

Electric automobiles transform urban mobility by offering a clean and eco-friendly alternative to traditional internal combustion vehicles. Planning and optimizing electric automobile (EA) travel routes involve considering energy consumption, battery range, and the availability of charging stations. By optimizing routes that account for delivery deadlines and charging outlet availability, the Electric Automobile Path Planning with Time Frame (EAPPTF) aims to reduce travel time and energy consumption. While decision tree models forecast and optimize energy consumption and charging stops, route planning uses Dijkstra's algorithm to identify the shortest path. Using real-time data from Indian cities, this article enhances electric automobile routing by providing insights into traffic flow and charging station availability, thereby enabling efficient travel and energy management. Data from Bengaluru and Hyderabad demonstrate that the proposed methods effectively address the routing challenges for electric automobiles, resulting in shorter trips and lower energy consumption, thereby promoting sustainable urban mobility. By improving autonomous driving technologies and charging infrastructure, these algorithms can also boost urban mobility and sustainability. This strategy supports optimal vehicle operation while addressing pressing issues in emerging nations.

Physical accessibility constitutes a fundamental dimension of spatial justice, ensuring that all individuals can equally benefit from the built environment. This study aims to evaluate and quantify the accessibility challenges faced by wheelchair users within the Sivas Cumhuriyet University campus and to propose a model that objectively identifies spatial inequalities. For this purpose, the intra-campus pedestrian network was modelled using Python, and shortest-path analyses were conducted via Dijkstra's algorithm for 1,000 randomly selected origin-destination pairs. These routes were further simulated within a multi-agent system (MAS) environment to estimate travel times and compare mobility performance between wheelchair users and able-bodied individuals. This study provides one of the first quantitative frameworks to integrate Dijkstra-based shortest-path computation and MAS-driven simulation for assessing wheelchair accessibility in outdoor environments. The resulting data were used to develop a numerical accessibility scoring system that expresses spatial disadvantage as an accessibility coefficient. The findings revealed that 85.8% of the routes were completely inaccessible for wheelchair users and that, where access was possible, travel distances were on average 8.5 times longer than those of non-disabled individuals. By establishing a reproducible and data-driven framework, the study connects the aim of promoting spatial equity with quantifiable outcomes, thereby providing a decision-support tool for campus redesign and urban accessibility planning. These findings provide a scalable analytical framework for promoting spatial equity, offering practical guidance for policymakers and urban planners seeking to improve accessibility in built environments.

Ovaj seminarski rad obrađuje Dijkstrin algoritam, jedan od najpoznatijih algoritama za pronalaženje najkraćeg puta u grafu. Rad objašnjava osnovne principe rada algoritma, njegovu matematičku osnovu i način implementacije kroz pseudokod i praktičan primer. Posebna pažnja posvećena je procesu oslobađanja ivica, radu sa skupovima čvorova i postupnom određivanju minimalnih udaljenosti. Prikazan je primer grafa sa implementacijom u programskom jeziku C, čime se demonstrira praktična primena algoritma. Na kraju se ističe značaj Dijkstrinog algoritma u različitim oblastima, od navigacije i planiranja ruta do računarskih mreža i optimizacije sistema, što potvrđuje njegovu univerzalnu primenu i trajnu vrednost u informatici i tehnici.

Jumlah kecamatan dan kelurahan yang ada di Kota Bandar Lampung adalah 20 Kecamatan dan 126 Kelurahan. Teknologi Sistem Informasi Geografis (SIG) telah berkembang pesat. SIG dibuat dengan menggunakan informasi yang berasal dari pengolahan sejumlah data, yaitu data geografis. Tujuan dari penelitian ini adalah mengembangkan SIG untuk mencari rute terpendek kecamatan dan kelurahan di Kota Bandar Lampung dengan menggunakan algoritma A* dan Dijkstra serta melakukan analisis perbandingan dari kedua algoritma tersebut. Hasil penelitian menunjukkan bahwa antara Algoritma A* dan Dijkstra menghasilkan jarak yang sama pada saat pengujian. Namun terdapat perbedaan waktu proses pencarian rute terpendek. Pada jarak 2 km, algoritma A* lebih cepat dibandingkan dengan algoritma Dijkstra dengan waktu rata-rata yang dibutuhkan selama 159 ms dan 369 ms secara berturut-turut.

This research studies the optimization and the generation of the most optimized paths in heavy-traffic urban transport for trucks using modified and dynamic short path algorithms. Logisticians are always in need of effective methods to reduce the cost in the distribution process within a supply chain, and also to determine the best incoterm for their trades, either for sales or acquisition, thus the objective of this research is to equip logisticians with e-Logistics tools and technologies to help them adapt and adjust their planification to gain the most from the incoterm of their choice during every trade. Our focus is to maximize the benefits of the chosen incoterms for each transaction, as this study focuses specifically on urban areas with heavy traffic, which consistently present challenges for logistics optimization, particularly for trucks navigating designated international transport routes or urban delivery points.

The growing complexity of modern power distribution systems, coupled with increasing electricity demand, necessitates innovative solutions to minimize losses and enhance system efficiency. This paper focuses on the strategic placement and sizing of Distributed Generation (DG) units within a distribution network to achieve these objectives. Utilizing a hybrid analytical approach combining the Power Loss Index (PLI) and the Radial Correction Factor (RCF), the study optimizes DG placement and capacity within an IEEE-15 bus radial distribution system. Results demonstrate significant improvements, with a 47.677% reduction in real power losses and a notable enhancement of the voltage profile. The optimal configuration involved installing five DGs at selected buses, yielding the highest efficiency gains compared to traditional optimization methods like the Artificial Bee Colony (ABC) and PLI-GA algorithms. The proposed methodology not only reduced operational losses but also improved system reliability and power quality, demonstrating its superiority and practical viability. Strategic DG integration and optimal capacitor placement together offer a robust framework for enhancing the performance of modern distribution networks.

This study addresses the challenges of path optimization in rural settings, particularly villages, by integrating dijkstra's algorithm with precision geo-mapping technologies. Key features include an interactive interface for real-time path visualization, and predictive analytics for anticipating disruptions. This research seeks to improve navigation and resource management to local communities, government agencies, urban planners, emergency services, and future researchers. The study's participants, comprising 50 individuals from balasan, iloilo, encompassed residents, emergency responders, and visitors. This study employs a quantitative research approach to systematically gather and analyze numerical data. The findings from the study demonstrate that the modified dijkstra's algorithm effectively adapts to rural environments, addressing unique spatial and infrastructural challenges. Geographic information systems and advanced spatial analysis tools provide detailed maps crucial for accurate pathfinding, enhanced by an interactive interface for real-time updates and predictive analytics for proactive path management. Overall, the system achieved high ratings across iso 25010 standards, indicating strong performance, usability, reliability, and user satisfaction in optimizing paths within villages. The study concludes that the system, utilizing a modified dijkstra's algorithm, mapping tools, interactive visualization, and predictive analytics, significantly improves pathfinding and navigation efficiency in rural areas of balasan, iloilo. It has demonstrated strong acceptability and usability across multiple metrics, highlighting its potential benefit for local communities. Based on the study's findings, recommendations include refining dijkstra's algorithm for rural terrains, enhancing predictive analytics with advanced machine learning, developing multi-criteria optimization algorithms, expanding the system's application beyond villages, establishing monitoring frameworks, and fostering ongoing research for continuous improvement.

Hasil penelitian oleh peneliti terdahulu, wilayah Provinsi Sumatera Barat termasuk Kota Padang terletak di sepanjang pantai serta mempunyai kondisi topografi yang rendah (relatif datar) sehingga daerah ini mempunyai riwayat karakteristik yang lekat dengan potensi bencana dan merupakan salah satu daerah paling rawan di Indonesia bila terjadi bencana, maka tidak heran jika kerap terjadi bencana alam besar. Dari potensi bencana yang kerap terjadi di Kota Padang tidak banyak masyarakat difabel yang tahu secara detail media untuk merekomendasikan jalur evakuasi bencana terdekat, sehingga informasi menentukan jalur evakuasi bencana terdekat tidak dapat langsung sampai ke masyarakat difabel, sehingga berpotensi menambah jumlah korban dan kerusakan ketika terjadi bencana. Penelitian dengan pendekatan kualitatif ini bertujuan untuk mengkaji jalur-jalur evakuasi bencana Kota Padang dengan membangun Direktori berbasis Android serta implementasi Sistem Informasi Geografi menggunakan algoritma Dijkstra dan memberikan rekomendasi informasi juga menentukan jalur evakuasi bencana terdekat yang dapat diakses kapan saja juga dimana saja, dilengkapi dengan peta lokasi dan rute perjalanan sehingga masyarakat difabel dapat memperkirakan waktu tempuh perjalanan, serta bisa langsung mengevakuasi dirinya menuju tempat yang lebih aman. Diharapkan hasil penelitian ini dapat menyediakan berbagai kemudahan dalam mengakses jalur evakuasi bencana terdekat Kota Padang juga melalui alat bantu penentu jalur evakuasi bencana terdekat ini dapat meningkatkan efisiensi waktu, jarak tempuh, dan biaya serta meminimalkan jumlah korban dan kerusakan skala kecil menengah dan besar.

This presentation is part of my work as a Teaching Assistant (TA) during my time as a Master of Technology (M.Tech) student at the National Institute of Technology, Patna. I worked along with a 1st year PhD student with our respective responsibilities for the Lab Teaching work.

The aim of this study is to develop a Mobile-Based Smart Transport Route Optimization and Hazard Reporting System that could improve navigation, minimize travel time, and increase road safety in San Juan City. The complex road system of the city and the ever-changing traffic rules, such as one-way and two-way rules based on time, pose great challenges to drivers, which often result in congestion and unintended traffic violations. This study solves these problems by giving a localized and adaptive navigation solution. The proposed system uses a combination of Dijkstra's Algorithm, Google Maps Application Programming Interface and real-time traffic information to produce the most efficient and accurate routes. It also has a hazard reporting feature that allows users to share updates on accidents, road closures, police presence, and other disruptions. Other features include English and Tagalog voice navigation, a built-in speedometer with overspeed warnings, two-factor authentication for secure access, a favorites feature for easy recall of commonly traveled routes. The system was developed following an iterative prototyping approach with user feedback and validated and filtered with data collected from local drivers and the San Juan City Traffic and Parking Management Office to maintain accuracy and usability. Its area of focus is private vehicles, motorcycles, and taxis that are operating within San Juan City. Findings indicate that the system offers better route guidance, minimizes traveling time, and improves the safety of commuters by combining algorithmic route optimization and communitybased hazard reporting. This study illustrates the role of localized systems in ensuring safer and efficient mobility in urban settings. This study shows the need to design navigation tools based on the actual community needs and conditions. Through the case of San Juan City, the system demonstrates how technology can directly address daily traffic issues, can offer a safer traveling experience, and can also serve as an example that can be copied in other cities with complicated traffic schemes.

Berdasarkan fakta di lapangan, bahwa Palang Merah Indonesia (PMI) Tasikmalaya memiliki permasalahan yang sama dengan cabang PMI lainnya, yaitupada bagian Unit Donor Darah masih menggunakan pengolahan data secara manual dan integrasi data antara PMI terhadap Bank Darah Rumah Sakit (BDRS) masih menjadi faktor berkurangnya kualitas pelayanan kepada pasien. Teknologi Informasi menjadi salah satu solusi dalam melakukan manajemen data antara PMI dan BDRS. Metode dalam penelitian ini adalah what, who, where, when, why, how (5W1H) dengan metode pengembangan aplikasi adalah Extreme Programming (XP) hanya pada tahapan Planning dan tahapan design. SMSgateway dilibatkan pada sistem pelayanan donor darah, sehingga memudahkan pasien mendapatkan informasi data darah. Hasil dari penelitian ini adalah aplikasi Transaction Processing System (TPS) dan SMS gateway berjalan sesuai dengan rancangan, pada tahapan planning dan tahapan design pada metode XP (Extreme Programming)melibatkan satu admin dan ban...

This paper introduces a novel method for accelerating shortest path computations. We propose a hybrid mantissa-exponent bucketing technique to optimize priority queue operations and a relative distance encoding scheme to reduce memory footprint. Combined, these innovations significantly decrease computation time and memory overhead compared to state-of-the-art algorithms, as demonstrated on standard benchmark graphs.

Taman Buah Mekarsari merupakan salah satu pusat pelestarian keanekaragaman hayati buah-buahan tropika terbesar di dunia, khususnya jenis buah-buahan unggul yang dikumpulkan dari seluruh daerah di Indonesia. Taman Buah Mekarsari juga merupakan tempat penelitian budidaya (agronomi), pemuliaan (breeding), dan perbanyakan bibit unggul untuk kemudian disebarluaskan kepada petani dan masyarakat umum. Penelitian ini bertujuan untuk mempermudah wisatawan memperoleh informasi tentang lokasi area wahana landmark yang ada di Taman Buah Mekarsari dengan memanfaatkan sebuah layanan aplikasi mobile berbasis teknologi augmented reality .Aplikasi mobile ini memanfaatkan peta yang sudah tersedia di Taman Buah Mekarsari dan membuatnya menjadi lebih interaktif untuk d igunakan oleh wisatawan. Metode yang diterapkan pada penelitian kali ini adalah menggunakan augmented reality sebagai pendukung utama aplikasi mobile yang akan dikembangkan. Keunggulan dari teknologi augmented realityini adalahmenjadikan...

One of the major challenges in deregulated power system is determination of Available Transfer
Capability on the interconnected transmission lines. It is necessary to determine and accurately gauge the transfer
capability remaining in the lines for further transactions, ATC determination methodology that enables one to
evaluate the realistic transmission transfer capability by accounting for all related important requirements. The
assessment of ATC gives valuable information to the system operator regarding the ability of an interconnected
network to reliably transfer bulk power between two nodes or between different areas of the network without
causing threat to system reliability. There are several methods to find ATC in deregulated system. The proposed
computation of the ATC using AC power transfer distribution factors (ACPTDFs) and to determine the shortest path
for the power flow between buyer and seller which is implemented by shortest path algorithm were discussed. ATC
calculation of IEEE-5 bus have been simulated by using Power world simulator and the results have been
presented by considering PTDF/OTDF factor and shortest path between buyer and seller is determined by
considering the line impedance as parameter simulation is carried out using MATLAB

Congestion management is a common issue in power system and becomes more challenging task in
competitive electricity market. Power lines are often loaded beyond their thermal limits in order to satisfy the
increased demand. With increase in demand the unplanned power exchange takes place between producers and
consumers. In the deregulated electricity market, Independent System Operator (ISO) is the one responsible for
keeping track of various transactions taking place between various entities. The ISO is an entity entrusted with the
responsible of ensuring the reliability and security of the entire system. Therefore Congestion Management and
Demand Side Response are very necessary in this context. The economical benefit comes from reducing the line
losses. This is because the energy usually has to travel a considerable distance from power plants to customers.
These two concepts contribute in relieving heavily loaded lines and reducing losses. Demand Side Management
(DSM) provides an excellent reliability resource for the most critical reliability needs. The graph theory shortest
path algorithm finds more suitable to identifying the shortest path power flow and determination of Available
Transfer Capacity (ATC) in the lines avoids unnecessary loading the lines to avoid the congestion in the power
network.

Penelitian ini bertujuan untuk mencari rute tercepat yang bisa ditempuh untuk mendistribusikan susu dari produsen di daerah Kepanjen Malang ke Pabrik pengolah di daerah Tanggulangin dengan menggunakan algoritma Min Plus Algebra. Metode penelitian yang digunakan adalah kualitatif deskriptif. Tahap penelitian yang dilakukan meliputi 1) observasi lapangan, 2) pembuatan prototipe program Matlab Min plus algebra, 3) perhitungan rute tercepat menggunakan program Matlab, dan 4) analisis data. Dari hasil penelitian didapat digraf searah yang terdiri dari 10 titik sebagai representasi rute pengiriman. Dengan menggunakan prototipe program Matlab didapat jalur yang tercepat yang dapat dilalui adalah produsenjalan Raya Kebon Agung-Gadangjalur Arjosarijalur jalan Raya Malang Pandaan lanjut tolpabrik pengolah dengan waktu tempuh 134 menit.

Due to increasing mobility in the city of Jakarta, traffic congestion is increasing. To reduce the impact of traffic congestion, this research implements the Dijkstra algorithm to find the shortest route on the Jakarta highway network. This algorithm was chosen because of its high efficiency in solving shortest path problems. The data used in this research includes Jakarta's main road network and average travel time. The research results show that the application of the Dijkstra algorithm can reduce travel time significantly compared to a randomly selected route.

Efficient delivery of goods is a crucial aspect of supply chain management. Dijkstra's algorithm, well known in computer science for finding the shortest path in a directed graph with non-negative weights, can be used to optimize goods delivery routes. This research aims to apply the Dijkstra Algorithm in the context of a distribution network to determine the most efficient delivery route. The results of implementing this algorithm show a significant reduction in costs and delivery times.

Dijkstra's algorithm is a graph algorithm that is used to find the shortest path from one point to another. In the context of public transportation, this algorithm can be applied to calculate the fastest and most efficient route between two specific points, such as a station or bus stop. This research aims to analyze the use of the Dijkstra algorithm in calculating the shortest paths in public transportation systems and evaluate its effectiveness compared to other methods.

Dijkstra's algorithm is a graph algorithm that is used to find the shortest path from one point to another. In the context of public transportation, this algorithm can be applied to calculate the fastest and most efficient route between two specific points, such as a station or bus stop. This research aims to analyze the use of the Dijkstra algorithm in calculating the shortest paths in public transportation systems and evaluate its effectiveness compared to other methods.

Dijkstra's algorithm is a graph algorithm that is used to find the shortest path from one point to another. In the context of public transportation, this algorithm can be applied to calculate the fastest and most efficient route between two specific points, such as a station or bus stop. This research aims to analyze the use of the Dijkstra algorithm in calculating the shortest paths in public transportation systems and evaluate its effectiveness compared to other methods.

This research proposes an innovative approach to model and optimize a waste disposal management system using Dijkstra's algorithm. The goal is to find the shortest routes for proper waste disposal in order to reduce pollution and costs. The intention is to minimize expenses and pollution by discovering the most efficient routes for disposing of garbage. The trash disposal pathways were modeled and optimized using Dijkstra's algorithm. This allows the waste management board to find the most efficient routes, minimizing distance, time and costs. The results show Dijkstra's algorithm can be effectively applied to improve the waste disposal process in Ebonyi state. Optimized waste disposal routing in Abakaliki, Ebonyi State. Modeled an equation to calculate the shortest paths between dumpsites. Applied Dijkstra's algorithm to design the optimization model. The system is a scalable and adaptable model, it advances the integration of technology in municipal services, promoting the use of Geographic Information Service (GIS) and real-time data for dynamic route optimization. The paper recommends further research on integrating a user-friendly interface and alerts for the system. It also discusses the broader applications of this Dijkstra-based route optimization approach beyond just waste management, such as in traffic management, urban planning, and other logistics/transportation domains. The work presents a practical application of Dijkstra's algorithm to enhance the efficiency and sustainability of waste disposal systems, with potential for wider impact across different sectors.

This research proposes an innovative approach to model and optimize a waste disposal management system using Dijkstra's algorithm. The goal is to find the shortest routes for proper waste disposal in order to reduce pollution and costs. The intention is to minimize expenses and pollution by discovering the most efficient routes for disposing of garbage. The trash disposal pathways were modeled and optimized using Dijkstra's algorithm. This allows the waste management board to find the most efficient routes, minimizing distance, time and costs. The results show Dijkstra's algorithm can be effectively applied to improve the waste disposal process in Ebonyi state. Optimized waste disposal routing in Abakaliki, Ebonyi State. Modeled an equation to calculate the shortest paths between dumpsites. Applied Dijkstra's algorithm to design the optimization model. The system is a scalable and adaptable model, it advances the integration of technology in municipal services, promoting the use of Geographic Information Service (GIS) and real-time data for dynamic route optimization. The paper recommends further research on integrating a user-friendly interface and alerts for the system. It also discusses the broader applications of this Dijkstra-based route optimization approach beyond just waste management, such as in traffic management, urban planning, and other logistics/transportation domains. The work presents a practical application of Dijkstra's algorithm to enhance the efficiency and sustainability of waste disposal systems, with potential for wider impact across different sectors.

Warisan budaya terbagi menjadi warisan budaya yang dapat diraba (tangible cultural heritage) dan tidak diraba (intangible cultural heritage). Tangible cultural heritage adalah benda hasil karya manusia yang dapat dipindahkan atau bergerak, maupun yang tidak dapat dipindahkan atau tidak bergerak. Dinas Kebudayaan dan Pariwisata Provinsi Jawa Tengah telah mendokumentasikan warisan budaya secara manual yang rentan dengan kerusakan. Proses pendataan dan perekaman mengalami kesulitan yang sangat tinggi karena sumber data yang melengkapi sebuah koleksi masih banyak tersebar dan belum terorganisasi dengan baik. Sistem informasi database multimedia yang dikhususkan untuk perekaman data warisan budaya kategori tangible cultural heritage dapat menjadi salah satu solusi media pelestarian budaya.

On the crossroads of course required setting traffic lights for vehicles that can be flashed with a sense of security and comfort. The duration of the traffic lights can be set to the maximum extent possible so that the vehicle could pass the road regularly. There are many solutions to manage traffic at a crossroads. One of them is a solution which will be given through this observation. This paper aims to describe the related optimization settings traffic by using the algorithm staining which aims to get the chromatic number of graphs. The optimization needs to be done due to the settings of the traffic at the Intersection of Palimanan often seen traffic jams and crowded at rush hour as a result of policies that allow the current to be incompatible. The application of the algorithm staining Welch-Powel to determine the chromatic number of graphs can be another option to resolve the problem. After the currentthe current at the traffic being transformed into a graph model that will be coloring a graph and calculating the number lens. Chromatic number of the graph model is 4 so there is a change in the duration of the red and green lights on the traffic. Although there is a reduction in the duration of the red light and the addition of the duration of the green light, the removal of the current incompatibility can minimize the possibility of congestion.

On the crossroads of course required setting traffic lights for vehicles that can be flashed with a sense of security and comfort. The duration of the traffic lights can be set to the maximum extent possible so that the vehicle could pass the road regularly. There are many solutions to manage traffic at a crossroads. One of them is a solution which will be given through this observation. This paper aims to describe the related optimization settings traffic by using the algorithm staining which aims to get the chromatic number of graphs. The optimization needs to be done due to the settings of the traffic at the Intersection of Palimanan often seen traffic jams and crowded at rush hour as a result of policies that allow the current to be incompatible. The application of the algorithm staining Welch – Powel to determine the chromatic number of graphs can be another option to resolve the problem. After the current – the current at the traffic being transformed into a graph model that w...

Kemacetan merupakan salah satu masalah yang dihadapi oleh masyarakat, khususnya di kota besar. Salah satu penyebabnya adalah tidak sebandingnya jumlah kendaraan dengan ruas jalan raya yang dilalui. Salah satu upaya penanganan kemacetan yang terjadi tersebut adalah dengan menggunakan pengalihan kendaraan ke jalur alternatif yang jumlah kendaraannya lebih sedikit. Untuk itu diperlukan metode pemilihan jalur alternatif yang tepat untuk mengurangi masalah kemacetan tersebut. Penelitian ini bertujuan untuk menentukan jalurjalur alternatif yang lebih efektif dan efisien sehingga dapat mengurangi kemacetan di suatu ruas-ruas jalan tertentu dengan menentukan bobot terkecil dari masing-masing ruas jalan menggunakan Algoritma Dijkstra. Dari penelitian ini akan dihasilkan jalur-jalur alternatif yang dapat dilalui pengendara untuk menghindari terjadinya kemacetan di ruas jalan tertentu.

Kemacetan merupakan salah satu masalah yang dihadapi oleh masyarakat, khususnya di kota besar. Salah satu penyebabnya adalah tidak sebandingnya jumlah kendaraan dengan ruas jalan raya yang dilalui. Salah satu upaya penanganan kemacetan yang terjadi tersebut adalah dengan menggunakan pengalihan kendaraan ke jalur alternatif yang jumlah kendaraannya lebih sedikit. Untuk itu diperlukan metode pemilihan jalur alternatif yang tepat untuk mengurangi masalah kemacetan tersebut. Penelitian ini bertujuan untuk menentukan jalurjalur alternatif yang lebih efektif dan efisien sehingga dapat mengurangi kemacetan di suatu ruas-ruas jalan tertentu dengan menentukan bobot terkecil dari masing-masing ruas jalan menggunakan Algoritma Dijkstra. Dari penelitian ini akan dihasilkan jalur-jalur alternatif yang dapat dilalui pengendara untuk menghindari terjadinya kemacetan di ruas jalan tertentu.

Kecelakaan lalu lintas yang sering terjadi di jalan merupakan situasi darurat yang harus dilakukan penanganan secepatnya. Penanganan yang wajib dilakukan saat terjadi kecelakaan lalu lintas adalah melakukan evakuasi korban kecelakaan langsung kerumah sakit. Namun, untuk melakukan evakuasi, petugas  memiliki banyak kendala dalam menentukan rute jalan untuk sampai ke rumah sakit. Seiring berkembangnya teknologi, kendala penentuan rute tersebut saat ini sudah dapat diselesaikan menggunakan berbagai algoritma pathfinding atau pencarian jalur terpendek, beberapa diantaranya dengan menggunakan metode pencarian rute yaitu menggunakan algoritma Floyd-Warshall dan Dijkstra. Penelitian ini bertujuan untuk mengetahui perbandingan antara algoritma Floyd-Warshall dengan Dijkstra dalam menentukan rute terpendek yang akan dipilih sebagai pendukung keputusan bagi petugas untuk melakukan evakuasi korban kecelakaan

Blood transfusion is an activity that is often carried out in order to save human life. The availability of appropriate bloodstock is crucial for use during special medical conditions. Therefore, the blood collection center must ensure availability; therefore, it needs to recruit active blood donors, difficult patients to find blood stocks, which will be discussed in this study. The contribution of this research is to design an information system that can find blood donors in the Bandar Lampung area with geolocation technology and use the Dijkstra algorithm to determine the closest route, with a system developed on the Android platform. The system can recommend donors to patients who need blood according to the patient's qualifications. Results obtained are an android-based mobile application that can search for geolocation-based blood donors using the Dijkstra algorithm, which can map the location of the nearest blood donor based on the patient's location. Based on data obt...

Pandemi COVID-19 telah memicu krisis kesehatan global. Sampai dengan saat ini, belum ada pilihan yang terbukti untuk pemulihan bagi masyarakat yang terkonfirmasi positif. Salah satu strategi jangka pendek untuk membantu pemulihan pasien terkonfirmasi adalah melalui terapi plasma konvalesen. Plasma konvalesen yang didapat dari individu penyintas COVID-19 mampu digunakan untuk pemeliharaan kesehatan pasca terpapar atau mempercepat penyembuhan penyakit menular. Saat ini, jumlah penyintas yang banyak di Indonesia tidak sebanding dengan masyarakat yang telah melakukan donor plasma konvalesen. Hal tersebut mengakibatkan kebutuhan plasma yang tinggi dengan ketersediaan pendonor yang rendah. Pasien harus menyebarkan data pribadi mereka melalui media sosial untuk mendapatkan golongan darah yang cocok. Tim Satuan Tugas COVID-19 ITS bekerja sama dengan ikatan alumni penyintas COVID-19 RS Indrapura berpartisipasi aktif dalam membangun aplikasi berbasis web PlasmaHub, untuk membantu menjembatani...

Advances in technology and information offer various conveniences and alternatives in every activity and community activity. There are various types of activities and community activities that do not escape the role of technology and information. Of course, this makes it easier for the community to make decisions in every activity and activity. In fact, in determining the fastest route, people are faced with a choice of available routes and are required to make the right decision regarding the alternative shortest route. One of them is in determining the route/path to hospitals and health centers. To take the shortest route/path, you can use public transportation, such as buses, which are often the people's choice compared to other modes of transportation. The existence of hospitals and health centers is very important because they can help treat people who are sick and provide 24-hour Emergency Unit (ER) services. In particular, immigrants who still don't know where the hos...

Proses pengiriman pada PT. Pos Indonesia saat ini masih ada kesulitan dalam pendataan sekaligus penentuan rute atau jarak kiriman, karena masih terjadinya surat atau dokumen dan barang yang akan dikirim kepada penerima tersebut melewati dari rute atau wilayah walaupun sudah disortir ketujuan masing-masing.Dari permasalahan diatas maka diperlukan sistem pencarian jalur terpendek untuk jasa pengiriman barang menggunakan metode algoritma dijkstra, metode yang cukup popular karena dapat menyelesaikan pencarian jalur terpendek dari satu ke semua simpul yang ada pada suatu graf bearah dengan bobot dan nilai tidak negatif.Dengan pembuatan aplikasi ini dapat membantu pegawai kurir PT. Pos Indonesia dalam menentukan jarak terpendek dan pendataan pengiriman tiap wilayah atau rute yang sudah ditentukan.

PT Citra Akes Indonusa is a company that operates on the expertise of information technology services in Banten Province. One of the services provided by the company requires the construction of a Base Transceiver Station (BTS) tower. The tower requires maintenance if there is damage to the network signal. As a result, the shortest route is needed to make it easier for employees to reach the tower location to be more effective. There are eight BTS tower locations in Tangerang Regency and three BTS tower locations in Tangerang City. The process of finding the shortest route in this study uses the Floyd Warshall algorithm, which is unique in finding the shortest route by comparing each edge of all edges that are passed. The process of testing the shortest route is done by selecting the starting point, then selecting several BTS tower locations. Next, the shortest route will be searched using the Floyd Warshall algorithm from each point of destination for the BTS tower location, then t...

Dijkstra is a greedy algorithm that gives a choice of several available shortest routes and then provides a solution. The application of Dijkstra's Algorithm in everyday life is very diverse. This study collects research results regarding the application of Dijkstra's Algorithm to solve everyday problems such as the shortest path problem, this mini-review paper can explain the study of Dijkstra's Algorithm for various things, including solving bi-objective shortest routes, multi-objective routes, emergency evacuation, Dijkstra's graph, the connection between LBS features, best route distribution, and fuzzy solution.

The application of technology that is increasingly developing is almost felt to benefit in various aspects of life, one of which is in terms of searching for veterinary clinics. This study aims to help animal owners who have difficulty in finding clinics and shops that sell various kinds of animal needs closest to the user's location. This research uses the Scrum method, which consists of Product Backlog, Sprint Backlog, Sprint and Imcrement. The output from Dijkstra's algorithm can display the location and route of the closest veterinary clinic to application users wherever they are in an average of 4 minutes 29 seconds.

Dijkstra is a greedy algorithm that gives a choice of several available shortest routes and then provides a solution. The application of Dijkstra's Algorithm in everyday life is very diverse. This study collects research results regarding the application of Dijkstra's Algorithm to solve everyday problems such as the shortest path problem, this mini-review paper can explain the study of Dijkstra's Algorithm for various things, including solving bi-objective shortest routes, multi-objective routes, emergency evacuation, Dijkstra's graph, the connection between LBS features, best route distribution, and fuzzy solution.

Proses evakuasi tsunami dengan menggunakan lintasan terpendek sebagai jalur evakuasi untuk setiap individu mengakibatkan penumpukan individu pada satu titik tertentu. Oleh karena itu dalam proses evakuasi diperlukan lintasan optional yang merupakan lintasan hasil modifikasi lintasan terpendek. Penentuan lintasan terpendek dari satu titik ke titik lain pada graf dilakukan dengan menggunakan algoritma Dijkstra. Simulasi proses evakuasi tsunami pada penelitian ini dilakukan pada kasus yang terjadi di Kecamatan Padang Utara bagian selatan, Kota Padang. Aplikasi yang digunakan pada simulasi ini adalah software MATLAB. Dari hasil simulasi diperoleh gambaran kapasitas shelter dan jalur evakuasi yang dapat direkomendasikan kepada stakeholder.

Finding shortest path for various applications is important in various domains. But to provide result for complex graphs in real time is a challenging task. So in this paper four shortest path algorithms namely Dijkstra's algorithm, Floyd Warshall, Bellman Ford and Jhonsons algorithm are studied and analyzed to detect parallelism in them and the parallelized version of all three is implemented using parallel computing framework OpenCL. It is found that Bellman Ford and Floyd Warshall contains fine grained parallelism while Jhonsons has less parallelism.

Pencarian rute terpendek menuju rumah sakit umum se-provinsi aceh ini menggunakan algoritma dijkstra yang bertujuan memberikan rekomendasi kepada masyarakat dalam pencarian rute terpendek menuju lokasi rumah sakit umum diwilayah Provinsi Aceh. Permasalahan utama dalam pencarian rute terpendek ini adalah mencari solusi paling efektif yang dapat diterapkan dalam persoalan yang dihadapi. Pada penelitian ini menggunakan penelitian deskriptif yaitu penelitian yang berorientasikan pemecahan masalah, serta perancangan desain sistem menggunakan metode UML. Aplikasi ini dibuat dengan menggunakan Code Editor yakni Visual Studio Code. Informasi rumah sakit sepenuhnya hanya terkait dengan data yang dimasukkan kedalam server database dan hasil dari aplikasi ini menampilkan lokasi rumah sakit terdekat dengan waktu tempuh dan jarak menuju rumah sakit beserta jalur atau rute menuju rumah sakit terdekat dengan titik lokasi pengguna. Dan dari aplikasi yang dijalankan didapatkan rumah sakit terdekat p...

Bangunan bersejarah merupakan salah satu daya tarik di bidang pariwisata. Banyak wisatawan yang berkunjung untuk dapat melihat bangunan bersejarah yang ada di suatu kota. Kota Palembang memiliki banyak bangunan bersejarah. Untuk membantu wisatawan mencari lokasi objek bangunan di kota Palembang, peta lokasi objek bangunan bersejarah dibuat sebagai media promosi. Namun, peta yang digunakan terbatas hanya dapat menampilkan gambar 2 dimensi, sehingga kurang menarik untuk dilihat oleh wisatawan. Pengembangan pada peta diperlukan agar dapat menampilkan visualisasi objek secara 3 dimensi, sehingga lebih menarik. Tujuan penelitian ini adalah melakukan pengembangan peta pariwisata bangunan bersejarah dengan menggunakan visualisasi augmented reality.  Metode yang digunakan adalah metode research and development. Metode tersebut terdiri dari tiga tahapan yaitu studi pendahuluan, pengembangan produk dan pengujian. Hasil penelitian ini adalah peta pariwisata objek bangunan bersejarah di Kota Pa...

Abstrak�� Ambulance berperan penting dalam penanganan pasien gawat darurat yang membutuhkan kecepatan dalam penanganan pasien. Namun demikian, karena kondisi lalu lintas dijalan raya ambulance seringkali mengalami keterlambatan kedatangan maupun keterlambatan dalam membawa pasien kerumah sakit. Maka dari itu, tujuan dari penelitian ini adalah untuk membuat aplikasi yang dapat memudahkan supir mobil ambulance untuk menemukan rute terpendek dari titik asal ke titik tujuan. Metode pengembangan perangkat lunak yang digunakan adalah Rational Unified Proccess (RUP) yang memiliki 4 tahapan : Inception, Elaboration, Construction, dan Transition. Algortima Bellmand ford merupakan algortima pencarian rute yang dapat menemukan rute terpendek dari titik awal (rumah sakit) sampai ke titik tujuan dengan cepat, yang merupakan pencarian rute terpendek dengan memperhitungkan semua rute. Aplikasi ini dibangun dengan menggunakan bahasa pemograman Android Studio untuk editor yang dimana bisa diakses ol...

Palang Merah Indonesia (PMI) Kota Bengkulu memiliki peranan yang penting dalam mengambil darah dari pendonor dan menyalurkannya kepada pasien yang ada di rumah sakit di Kota Bengkulu. Pendonor yang ada di Kota Bengkulu dapat melakukan donor darah dengan cara menghubungi petugas PMI atau datang ke rumah sakit yang dapat melakukan donor darah dan rumah sakit dapat mengambil darah yang telah diterima untuk kepentingan pasien. Dalam beberapa kasus, golongan darah yang diperlukan tidak ada, sehingga membuat rumah sakit kesulitan untuk melakukan pengobatan seperti operasi dan petugas PMI Kota Bengkulu harus menghubungi pendonor satu persatu untuk meminta melakukan pendonoran darah. Dengan masalah yang ada maka diperlukan permodelan perangkat lunak pemilihan calon pendonor darah potensial dengan menggunakan metode pengembangan prototype. Permodelan dengan metode prototype memberikan konsep dasar dalam pengembangan sistem informasi perangkat lunak pemilihan calon pendonor darah potensial.

Kota Sukabumi merupakan sebuah wilayah yang berada di Jawa Barat yang mengalami perkembangan pesat. Terutama dalam pembangunan tempat ibadah. Tempat ibadah, rumah sakit. Tempat peribadatan adalah sebuah tempat yang digunakan oleh umat beragama untuk beribadah menurut ajaran agama. Masjid adalah rumah tempat ibadah umat islam atau muslim, masjid artinya tempat ibadah. Masjid juga merupakan pusat kehidupan komunitas muslim. Kegiatan – kegiatan perayaan hari besar, diskusi kajian agama. Ceramah dan belajar Al-Qur’an sering dilaksankan di Masjid. Bahkan dalam sejarah islam, masjid turut memegang peranan dalam aktivitas sosial kemasyarakatan hingga kemiliteran. Adapun di Kota Sukabumi terdapat 20 Masjid. Agar lebih memudahkan dalam pencarian masjid yang berada di Kota Sukabumi dengan banyaknya jumlah masjid yang berada di kota sukabumi dengan menggunakan aplikasi berbasis web. Penerapan algoritma Dijkstra dalam proses menentukan lokasi masjid yang akan di tuju di Kota Sukabumi berdasarka...