scholarly journals The Mathematical Model for searching the Shortest Route for TB Patients with the help of Dijkstra’s Algorithm

2021 ◽  
Vol 5 (2) ◽  
pp. 41-48
Author(s):  
Muhammad Ayoub Kamal ◽  
Muhammad Shahid ◽  
Hammad Khawar
Keyword(s):  
Mathematical Model ◽  
Research Work ◽  
Dijkstra’S Algorithm ◽  
Private Hospitals ◽  
Medical Treatments ◽  
Dijkstra's Algorithm ◽  
Medical Issues ◽  
Shortest Route ◽  
The Government ◽  
Medical Relief

In this research paper, we have studied TB (Tuberculosis) patients who come from different traffic routes in order to seek medical help and treatment in Karachi, Sindh, Pakistan. In this research work, we have focused on the transportation problems of the TB patients. These TB patients can travel on the paths having minimum distance as found out in this paper using Dijktra’s Algorithm. People hope that they have better treatment opportunities and financial medical relief in the government and private hospitals in Karachi. There are many private hospitals in the city but unfortunately, they provide expensive treatments. As a consequence, people belonging to the poor or lower and middle classes approach government hospitals adequately. Among them, Nazimabad Chest Hospital for TB patients (under the supervision of Dow University of Health Sciences) is providing better facilities as compared to the other hospitals involved in providing medical treatments for the similar medical issues. Nazimabad Chest Hospital for TB patients is renowned for its high quality treatment of TB patients. The hospital is located inside Government Hospital Nazimabad (under the control of Dow University), Karachi. It has latest equipments, competent and qualified staff to treat TB patients. Patients have to visit the hospital on weekly basis from their homes and residences. They use several combinations of traffic routes to reach the hospital as these patients live in different areas like, Malir Cantt, Safari Park, Hassan Square, North-Nazimabad, North Karachi, Gulshan-e-Iqbal, etc.  A path or road is required which takes the least amount of time and subsequently reduces the transportation charges. In this paper, an effort has been made to locate the shortest route for the convenience for these TB patients. In this paper, a mathematical model has been developed by using the method of Dijkstra’s algorithm to attain the desired objective.

scholarly journals APLIKASI ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK DARI KAMPUS A KE B UIN RADEN FATAH

2021 ◽  
Vol 10 (3) ◽  
pp. 173
Author(s):  
RENDI SAPUTRAMA ◽  
HARTATIANA HARTATIANA
Keyword(s):  
Graph Theory ◽  
Directed Graph ◽  
Applied Research ◽  
Dijkstra’S Algorithm ◽  
The Road ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Starting Point ◽  
Route Option

Finding the shortest direction is one of the options that have been considered while traveling. One of the problems that occur for lecturers, staff, and students of UIN Raden Fatah is determining the shortest direction from Campus A to B. The application of graph theory by using Dijkstra's Algorithm becomes a solution for this problem. This algorithm has the advantage to minimize the expense of the costs by finding the shortest route from starting point to the destination. This study is applied research. The study will discuss the determination of the origin and destination end-point, traverse route, the calculation of the weight distance, analyzes the Dijkstra's iteration to determine the shortest route, and conclusion. As the result, the land route becomes the shortest route option from UIN Raden Fatah Campus A to B. The directed graph of the route represents the location as point, the road as the side, and distance as weight. The result shows that the route distance is 6.94 km using Dijkstra's Algorithm.

scholarly journals Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu

2021 ◽  
Vol 5 (2) ◽  
pp. 103
Author(s):  
Putriana Mayang Sari ◽  
Fauziah Fauziah ◽  
Aris Gunaryati
Keyword(s):  
Total Weight ◽  
Search Process ◽  
Business Sector ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Route Search

Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.Keywords:Dijkstra’s Algorithm, Android, Flutter, Shortest Line, Tofu Factory.

scholarly journals Shortest Path Finding Using Dijkstra’s Algorithm

2021 ◽  
Vol 9 (1) ◽  
pp. 89-102
Author(s):  
Fitri Yani Nurhasanah ◽  
Windu Gata ◽  
Dwiza Riana ◽  
Muh. Jamil ◽  
Surya Fajar Saputra
Keyword(s):  
Shortest Path ◽  
Work Ethic ◽  
Dijkstra’S Algorithm ◽  
Professional Work ◽  
The Road ◽  
Effective Time ◽  
Employee Discipline ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
On The Road

In the professional work, discipline is a very important to see work ethic of an employee. Discipline has also the most important element of good behavior, both as individual and social. A problem is when people on the road in finding the shortest path in order to get to the destination on time. Finding shortest path improves workers discipline and add value to employees. With the Dijkstra’s Algorithm, we can find the shortest route. The value on the edge of a graph can be expressed as the distance between nodes (roads). Through this proposed application, it easier for us to find the shortest route in a more effective time.

scholarly journals Implementation of Dijkstra's Algorithm in the Shortest Route

2019 ◽  
Vol 05 (12) ◽  
pp. 681-689
Author(s):  
Wawan Gunawan ◽  
Susafaati . ◽  
Budi Sudrajat
Keyword(s):  
Dijkstra’S Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route

scholarly journals FLOYD–WARSHALL ALGORITHM FOR SHORTEST ROUTE CALCULATION BETWEEN LATVIA'S CITIES

2019 ◽  
pp. 31
Author(s):  
Raivis Gavars ◽  
Einārs Netlis-Galejs ◽  
Jānis Artūrs Lazdiņš ◽  
Ilmārs Kangro
Keyword(s):  
Programming Language ◽  
Good Choice ◽  
Good Thing ◽  
Dijkstra’S Algorithm ◽  
Sparse Graphs ◽  
C Programming Language ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
C Programming

The Floyd–Warshall algorithm is a good choice for computing paths between all pairs of vertices indense graphs, in which most or all pairs of vertices are connected by edges. For sparse graphs with non-negative edgeweights, a better choice is to use Dijkstra's algorithm from each possible starting vertex. Also, a very good thing is that thesolution is very accurate, when using a computer. In this paper, the authors tried to apply a solution using C++programming language to make possible many entries.

Research on Starvation in the Warsaw Ghetto – Ethical Problems

2010 ◽  
pp. 439-450
Author(s):  
Marta Janczewska
Keyword(s):  
Research Team ◽  
Ethical Dilemmas ◽  
Medical Profession ◽  
Research Work ◽  
Special Kind ◽  
Scientific Discipline ◽  
Medical Treatments ◽  
Warsaw Ghetto ◽  
Dying Patients ◽  
To Receive

Research team of physicians and lab technicians under Izrael Milejkowski’s direction undertook the effort to carry out a series of clinical and biochemical experiments on patients dying of starvation in the Warsaw ghetto so as to receive the fullest possible picture of hunger disease. The research was carried out according to all the rigors of strict scientific discipline, and the authors during their work on academic articles, published it after the war entitled: „Starvation disease: hunger research carried out in the Warsaw ghetto in 1942,” according to their own words, they “supplemented the gap in accordance with the progress of knowledge.” The article is devoted to the reflections over ethical dilemmas of the research team, who were forced in their work to perform numerous medical treatments of experimental nature on extremely exhausted patients. The ill, according to Dr Fajgenblat’s words,“demonstrated negativism toward the research and treatment, which extremely hindered the work, and sometimes even frustrated it.” The article attempts to look at the monumental research work of the Warsaw ghetto doctors as a special kind of response of the medical profession to the feeling of helplessness to the dying patients. The article analyzes the situation of Warsaw ghetto doctors, who undertook the research without support of any outer authority, which could settle their possible ethical dilemmas (Polish deontological codes, European discussions on the conditions of the admissibility of medical research on patients, etc.).

Coronavirus: Towards controlling of the pandemic - Indian scenario

2020 ◽  
Vol 11 (SPL1) ◽  
pp. 462-468
Author(s):  
Latika kothari ◽  
Sanskruti Wadatkar ◽  
Roshni Taori ◽  
Pavan Bajaj ◽  
Diksha Agrawal
Keyword(s):  
Control Measures ◽  
The Novel ◽  
Medical Treatments ◽  
Health Crisis ◽  
The Public ◽  
Infection Control Measures ◽  
The Social ◽  
Asking Questions ◽  
The Government ◽  
Novel Coronavirus

Coronavirus disease 2019 (COVID-19) is a communicable infection caused by the novel coronavirus resulting in severe acute respiratory syndrome coronavirus 2 (SARS-CoV). It was recognized to be a health crisis for the general population of international concern on 30th January 2020 and conceded as a pandemic on 11th March 2020. India is taking various measures to fight this invisible enemy by adopting different strategies and policies. To stop the COVID-19 from spreading, the Home Affairs Ministry and the health ministry, of India, has issued the nCoV 19 guidelines on travel. Screening for COVID-19 by asking questions about any symptoms, recent travel history, and exposure. India has been trying to get testing kits available. The government of India has enforced various laws like the social distancing, Janata curfew, strict lockdowns, screening door to door to control the spread of novel coronavirus. In this pandemic, innovative medical treatments are being explored, and a proper vaccine is being hunted to deal with the situation. Infection control measures are necessary to prevent the virus from further spreading and to help control the current situation. Thus, this review illustrates and explains the criteria provided by the government of India to the awareness of the public to prevent the spread of COVID-19.

scholarly journals The Innovation of Government Bonds in the Growth of an Emergent Capital Market

2021 ◽  
Vol 7 (1) ◽  
pp. 103
Author(s):  
Cordelia Onyinyechi Omodero ◽  
Philip Olasupo Alege
Keyword(s):  
Capital Market ◽  
Research Work ◽  
Government Bonds ◽  
Market Capitalization ◽  
Market Growth ◽  
Explanatory Variables ◽  
The Government ◽  
The Impact ◽  
Total Market ◽  
The Capital Market

The growth of an emerging capital market is necessary and requires all available resources and inputs from various sources to realize this objective. Several debates on government bonds’ contribution to Nigeria’s capital market developmental growth have ensued but have not triggered comprehensive studies in this area. The present research work seeks to close the breach by probing the impact of government bonds on developing the capital market in Nigeria from 2003–2019. We employ total market capitalization as the response variable to proxy the capital market, while various government bonds serve as the independent variables. The inflation rate moderates the predictor components. The research uses multiple regression technique to assess the explanatory variables’ impact on the total market capitalization. At the same time, diagnostic tests help guarantee the normality of the regression model’s data distribution and appropriateness. The findings reveal that the Federal Government of Nigeria’s (FGN) bond is statistically significant and positive in influencing Nigeria’s capital market growth. The other predictor variables are not found significant in this study. The study suggests that the Government should improve on the government bonds’ coupon, while still upholding the none default norm in paying interest and refunding principal to investors when due.

scholarly journals Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path

2020 ◽  
Author(s):  
Fredrik Ljunggren ◽  
Kristian Persson ◽  
Anders Peterson ◽  
Christiane Schmidt
Keyword(s):  
Experimental Evaluation ◽  
Temporal Distance ◽  
Dijkstra’S Algorithm ◽  
Passenger Traffic ◽  
Dijkstra's Algorithm ◽  
Railway Timetabling

Abstract We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.

Sign in / Sign up

Export Citation Format

Share Document