Dijkstra algorithm applied: Design and implementation of a framework to find nearest hotels and booking systems in Iraqi

Ahmed, Aram Mahmood; Ahmed, Sarkar Hasan; Ahmed, Omed Hassan

doi:10.1109/crcsit.2017.7965546

Cited by 13 publications

(9 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Literatures also indicate that optimization frameworks and algorithms for locating the nearest pharmacy are very few. A framework was developed to locate the nearest hotel for tourists in Iraq using the Dijkstra algorithm to search and locate different hotels in the city and sort them according to their price, the number of stars, and location distance [21]. Since the framework was not developed for locating the nearest pharmacy, it didn't take into consideration constraints like prescribed drug cost, pharmacy working hours, and others constraints which are considered in this study.…”

Section: Discussionmentioning

confidence: 99%

“…Also, in Iraq, a framework for developing an online hotel booking system for tourists was also developed and tested in a similar way. Customers were able to do the payment process through their cell phones using payment services providers and were able sort hotels according to their price or quality [21]. But, it would have been ideal to test this application with people with less experience in technology which will be done for the future in Ethiopia and when the application is hosted on remote server.…”

Section: Simulationmentioning

confidence: 99%

See 1 more Smart Citation

A framework for locating prescribed medication at pharmacies

Wondmagegn

Nabassa

Melesse³

et al. 2023

Preprint

View full text Add to dashboard Cite

The availability of medication at pharmacies is one of the major problems in the health sector of developing countries. Patients are frequently forced to arbitrarily switch pharmacies in search of the prescribed prescription. Lack of hospital and pharmacy drug information communication and inventory systems, as well as a lack of knowledge about the locations of pharmacies that carry the necessary medications, are some of the issues. The goal of this project is to provide a framework that will make it easier for anyone looking for a local pharmacy to find and locate one. The framework was created using the primary obstacles to obtaining necessary prescribed medications identified in the literature. The framework uses the client's and pharmacies' latitude and longitude coordinates to find the closest pharmacies that have the required prescribed medication in stock. To achieve this, the identified restrictions are optimized (distance, drug cost, travel time, travel cost, opening and closing hours of nearby pharmacies). The framework may reduce patient expenditures and prevent delays in the delivery of medications. It will also pave the way for future pharmacy and e-Health information systems.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Simulationmentioning

confidence: 99%

A framework for locating prescribed medication at pharmacies

Wondmagegn

Nabassa

Melesse³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…In [5], the authors investigated the problem of finding of nearest gas stations and determining the shortest distance using Dijkstra's Algorithm. A study of design and implementation of a framework to find nearest hotels and booking systems in Iraqi was provided in [6]. Compared to other algorithms such as Floyd-Warshall Algorithm, Dijkstra's Algorithm has more advantages and one of the advantages is the less time and storage in using it [7].…”

Section: Related Workmentioning

confidence: 99%

Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia)

Sebayang¹,

Rosyida²

2022

Advances in Computer Science Research

View full text Add to dashboard Cite

Ojek Online is a motorcycle taxi that is usually used by people that need a short time for traveling. It is one of the easiest forms of transportation, but there are some obstacles in hilly areas such as Semarang City. The fare produced by online motorcycle taxis is sometimes not in accordance with the distance and difficulty of the terrain. The problems in this research are as follows: (1) How to find the shortest route of Ojek Online using the Dijkstra Algorithm, (2) How are the difficulties of the terrain along the shortest routes, (3) How to determine the fare using a fuzzy inference system (FIS) where the inputs are distance and the level of difficulty of the terrain on the geographical map in Semarang City area. The Dijkstra's Algorithm is used to assist in finding the shortest path and the Mamdani FIS is applied for fixing the fares. The results show that the Dijkstra Algorithm can find the shortest routes of ojek online from UNNES (initial node) to some destinantions in Semarang City. The result using fuzzy logic toolbox in matlab with the input of distance 5.5 km and terrain difficulty 300 m produced an output fare of 13,500 IDR. Further, the input of distance 5.5 km and the terrain difficulty of 100 m poduced an output fare of 13,100 IDR. Some routes with the same distance and different terrain heights have different fares.

show abstract

“…Sensors follow shortest path route to deliver their packets to the next hop. Dijkstra algorithm [18] [19] has been applied to find the shortest path between nodes. The total energy [9] spent by the system can be represented as follows:…”

Section: B Energy Consumption Modelmentioning

confidence: 99%

An energy efficient long hop (LH) first scheduling algorithm for scalable Internet of Things (IoT) networks

Farhan

Al-Issa

Shukur

et al. 2017

2017 Eleventh International Conference on Sensing Technology (ICST)

View full text Add to dashboard Cite

Internet of Things (IoT) is becoming more and more pervasive in everyday life and connecting an array of diverse physical objects. It is fast growing and receiving a tremendous amount of research focus. Billions of objects communicate each other with or without human intervention to achieve smart applications. Most of the connected devices are constrained nodes to its ecosystem which have limited memories, CPU capabilities and power sources. Therefore, for implementing autonomous smart systems, efficient energy consumption is imperative. This paper introduces a novel scheduling algorithm called Long Hop (LH) first to optimize energy usage on a Wireless Sensor Network (WSN) that enables IoT system. LH algorithm schedules high priority for packets coming with more hops and longer distances to be served first at the cluster head (CH) nodes of the WSN. Since these packets require more links and nodes (thus increased energy and bandwidth usage) to reach the ultimate destination if not prioritized, the proposed algorithm reduces the overall energy usage and minimizes the total number of packets re-transmission and the effective data transmission distances. This improves the overall system performance and elongates the network lifetime.

show abstract

Dijkstra algorithm applied: Design and implementation of a framework to find nearest hotels and booking systems in Iraqi

Cited by 13 publications

References 3 publications

A framework for locating prescribed medication at pharmacies

A framework for locating prescribed medication at pharmacies

Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia)

An energy efficient long hop (LH) first scheduling algorithm for scalable Internet of Things (IoT) networks

Contact Info

Product

Resources

About