scholarly journals Flight-schedule using Dijkstra's algorithm with comparison of routes findings

2022 ◽  
Vol 12 (2) ◽  
pp. 1675
Author(s):  
Israa Ezzat Salem ◽  
Maad M. Mijwil ◽  
Alaa Wagih Abdulqader ◽  
Marwa M. Ismaeel
Keyword(s):  
Lower Cost ◽  
Cost Effective ◽  
Complex Problem ◽  
Search Algorithms ◽  
Destination Node ◽  
Simulation Environment ◽  
Dijkstra Algorithm ◽  
Large Cities ◽  
Shortest Route ◽  
Route Algorithm

<span>The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.</span>

scholarly journals Shortest Path Search Futsal Field Location With Dijkstra Algorithm

2018 ◽  
Vol 12 (2) ◽  
pp. 161 ◽  
Author(s):  
Delpiah Wahyuningsih ◽  
Erzal Syahreza
Keyword(s):  
Shortest Path ◽  
Destination Node ◽  
Dijkstra Algorithm ◽  
Initial Node ◽  
Shortest Route ◽  
Path Search ◽  
Surrounding Areas ◽  
The City ◽  
Shortest Path Search

Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have little difficulty in accessing futsal field places in this city because they do not know in detail information about the route to the futsal field. This research can facilitate futsal players in searching shortest path futsal field with algorithm dijkstra. The dijkstra algorithm determines the shortest path by computing the nodes passed from the initial node to the destination node. Dijkstra algorithm by forming the node graph, the new node then perform the calculation of the number of nodes that will form a new node for the determination of the node to be passed so that the algorithm dijkstra find the smallest node that will form the shortest path in the geographic information system. This system displays the shortest route from the user position to the futsal field which is the destination in the city of Pangkalpinang and surrounding areas.

scholarly journals Dijkstra Algorithm Application: Shortest Distance between Buildings

2018 ◽  
Vol 7 (4.10) ◽  
pp. 974 ◽  
Author(s):  
G. Deepa ◽  
Priyank Kumar ◽  
A. Manimaran ◽  
K. Rajakumar ◽  
V. Krishnamoorthy
Keyword(s):  
Shortest Path ◽  
Engineering Calculation ◽  
Destination Node ◽  
Efficiency Improvement ◽  
Storage Space ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Basic Concepts

The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph” in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two types of DA one is the basic one and other one is optimized. This paper is focused on the basics one which provides a shortest route between source node and the destination node. Main focus has been kept on keeping the work simple and easy to understand with some basic concepts .Storage space and operational efficiency improvement has been tried to improve. 

scholarly journals Gamma models for estimating the odds ratio for a skewed biomarker measured in pools and subject to errors

Biostatistics ◽  
2019 ◽  
Author(s):  
Dane R Van Domelen ◽  
Emily M Mitchell ◽  
Neil J Perkins ◽  
Enrique F Schisterman ◽  
Amita K Manatunga ◽  
...  
Keyword(s):  
Odds Ratio ◽  
Adjusted Odds Ratio ◽  
Lower Cost ◽  
Cost Effective ◽  
Ratio Estimation ◽  
Statistical Efficiency ◽  
Function Model ◽  
Processing Error ◽  
Wide Range ◽  
Pooled Samples

SUMMARYMeasuring a biomarker in pooled samples from multiple cases or controls can lead to cost-effective estimation of a covariate-adjusted odds ratio, particularly for expensive assays. But pooled measurements may be affected by assay-related measurement error (ME) and/or pooling-related processing error (PE), which can induce bias if ignored. Building on recently developed methods for a normal biomarker subject to additive errors, we present two related estimators for a right-skewed biomarker subject to multiplicative errors: one based on logistic regression and the other based on a Gamma discriminant function model. Applied to a reproductive health dataset with a right-skewed cytokine measured in pools of size 1 and 2, both methods suggest no association with spontaneous abortion. The fitted models indicate little ME but fairly severe PE, the latter of which is much too large to ignore. Simulations mimicking these data with a non-unity odds ratio confirm validity of the estimators and illustrate how PE can detract from pooling-related gains in statistical efficiency. These methods address a key issue associated with the homogeneous pools study design and should facilitate valid odds ratio estimation at a lower cost in a wide range of scenarios.

Dose-escalation strategy in refractory metastatic colorectal cancer: A change in terms of cost-effectiveness

2021 ◽  
pp. 107815522199254
Author(s):  
Jacopo Giuliani ◽  
Francesco Fiorica ◽  
Giovanni Ponturo ◽  
Maurizio Azzurro ◽  
Andrea Ruzzenente ◽  
...  
Keyword(s):  
Colorectal Cancer ◽  
Cost Effectiveness ◽  
Metastatic Colorectal Cancer ◽  
Dose Escalation ◽  
Lower Cost ◽  
Cost Effective ◽  
Phase Iii ◽  
Controlled Trials ◽  
Pivotal Phase ◽  
Randomized Controlled

The analysis was conducted to assess the pharmacological costs of regorafenib and trifluridine/tipiracil in the treatment of refractory metastatic colorectal cancer (mCRC). Pivotal phase III randomized controlled trials (RCTs) of regorafenib and trifluridine/tipiracil in the treatment of refractory mCRC were considered. We have also considered the ReDOS trial, in order to verify if the dose-escalation strategy (practice changing for regorafenib) could influences the results. Differences in OS (expressed in months) between the different arms were calculated and compared with the pharmacological costs (at the Pharmacy of our Hospital and expressed in euros (€)) needed to get one month of OS. Trifluridine/tipiracil resulted the less expensive, with 1167.50 €per month OS-gained. The ReDOS trial further reduce costs with 510.41 €per month OS-gained in favour of regorafenib with the escalation-dose strategy. Both regorafenib and trifluridine/tipiracil can be considered economically sustainable treatments for refractory mCRC, apparently with a lower cost of trifluridine/tipiracil. The adoption of a dose-escalation strategy (ReDOS trial) could reverse the situation making regorafenib more cost-effective than trifluridine/tipiracil.

scholarly journals Behavioral Intervention Components Associated With Cost-effectiveness: A Comparison of Six Domains

2021 ◽  
Author(s):  
E Beard ◽  
F Lorencatto ◽  
B Gardner ◽  
S Michie ◽  
L Owen ◽  
...  
Keyword(s):  
Cost Effectiveness ◽  
Behavior Change ◽  
Lower Cost ◽  
Self Regulation ◽  
Cost Effective ◽  
Cost Effectiveness Ratio ◽  
Behavior Change Techniques ◽  
Multiple Health Behaviors ◽  
Behavior Change Interventions ◽  
Multiple Health

Abstract Background To help implement behavior change interventions (BCIs) it is important to be able to characterize their key components and determine their effectiveness. Purpose This study assessed and compared the components of BCIs in terms of intervention functions identified using the Behaviour Change Wheel Framework (BCW) and in terms of their specific behavior change techniques (BCTs) identified using the BCT TaxonomyV1, across six behavioral domains and the association of these with cost-effectiveness. Methods BCIs in 251 studies targeting smoking, diet, exercise, sexual health, alcohol and multiple health behaviors, were specified in terms of their intervention functions and their BCTs, grouped into 16 categories. Associations with cost-effectiveness measured in terms of incremental cost-effectiveness ratio (ICER) upper and lower estimates were determined using regression analysis. Results The most prevalent functions were increasing knowledge through education (72.1%) and imparting skills through training (74.9%). The most prevalent BCT groupings were shaping knowledge (86.5%), changing behavioral antecedents (53.0%), supporting self-regulation (47.7%), and providing social support (44.6%). Intervention functions associated with better cost-effectiveness were those based on training (βlow = −15044.3; p = .002), persuasion (βlow = −19384.9; p = .001; βupp = −25947.6; p &lt; .001) and restriction (βupp = −32286.1; p = .019), and with lower cost-effectiveness were those based on environmental restructuring (β = 15023.9low; p = .033). BCT groupings associated with better cost-effectiveness were goals and planning (βlow = −8537.3; p = .019 and βupp = −12416.9; p = .037) and comparison of behavior (βlow = −13561.9, p = .047 and βupp = −30650.2; p = .006). Those associated with lower cost-effectiveness were natural consequences (βlow = 7729.4; p = .033) and reward and threat (βlow = 20106.7; p = .004). Conclusions BCIs that focused on training, persuasion and restriction may be more cost-effective, as may those that encourage goal setting and comparison of behaviors with others.

A Cost-Effective FPGA-based Fault Simulation Environment

2011 ◽  
Author(s):  
Angelika Janning ◽  
Johann Heyszl ◽  
Frederic Stumpf ◽  
Georg Sigl
Keyword(s):  
Fault Simulation ◽  
Cost Effective ◽  
Simulation Environment

P0434COST-EFFECTIVENESS OF MAINTANCE THERAPY WITH AZATHIOPRIME VERSUS RITUXIMAB (TAILORED OR FIXED-SCHEDULE) IN ADULTS WITH GENERALIZED ANCA VASCULITIS IN COLOMBIA

2020 ◽  
Vol 35 (Supplement_3) ◽  
Author(s):  
Kateir Mariel Contreras ◽  
Viviana Orozco Ortiz ◽  
Eduardo José Puche ◽  
Paola Karina Garcia ◽  
Camilo Alberto Gonzalez ◽  
...  
Keyword(s):  
Cost Effectiveness ◽  
Lower Cost ◽  
Transition Probabilities ◽  
Cost Effective ◽  
Sensitivity Analyses ◽  
Fixed Dose ◽  
National Guidelines ◽  
Anca Vasculitis ◽  
Life Years ◽  
The Cost

Abstract Background and Aims Azathioprine has been for decades the drug of choice for maintenance therapy in patients with generalized ANCA vasculitis in remission. However, recent studies show that rituximab, a high-cost biological agent, which can be administrated in two different schedules, might be more effective, so it is necessary to know the cost- effectiveness. Our goal was to compare the cost-effectiveness of the 3 maintenance schemes: standard therapy with azathioprine; fixed-dose rituximab and rituximab tailored according to CD19 lymphocyte level and ANCA titres, from the perspective of the Colombian healthcare system. Method We designed a 5-year annual cycle Markov model with the following stages: remission, minor relapse, mayor relapse and death. Transition probabilities were obtained from a systematic review of the literature (Scopus and Pubmed). Following national guidelines for economic studies, costs (in 2018, 1 euro = 3489 Colombian pesos) were estimated based on national drug registries, and official tariff manuals for procedures and other resources. Main outcome was quality-adjusted life years (QALY), using lupus nephropathy as a proxy; values were obtained from Tufts CEA Registry and validated by local expert panel through a modified Delphi technique. Cost-effectiveness threshold was three-times per capita GDP (16.872 euros). Discount rate was 5%. Univariate and probabilistic sensitivity analyses were performed. Results Overall discounted 5-years costs were € 1149 for azathioprine; € 4025 for tailored rituximab and € 5221 for fixed rituximab. QALY gains were 2.94, 3.63 and 3.64, respectively. Both tailored and fixed rituximab were cost-effective (cost per QALY gained: € 4168 and € 5817 respectively), but tailored dosing was preferable due to its lower cost. Sensitivity analyses did not modify these results significantly. Conclusion To our knowledge this is the first economic evaluation that compare azathioprine with tailored and fixed rituximab regimens as a vasculitis maintenance treatment in adults with ANCA generalized. Due to its lower effectiveness azathioprine should not be the first line of treatment. Tailored rituximab should be a better option than fixed schedule due to its lower cost with similar effectiveness.

scholarly journals Combining Interval Branch and Bound and Stochastic Search

2014 ◽  
Vol 2014 ◽  
pp. 1-15
Author(s):  
Dhiranuch Bunnag
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Branch And Bound ◽  
Lower Cost ◽  
Search Algorithms ◽  
Stochastic Search ◽  
Constrained Problems ◽  
Interval Branch And Bound ◽  
Unconstrained Problems

This paper presents global optimization algorithms that incorporate the idea of an interval branch and bound and the stochastic search algorithms. Two algorithms for unconstrained problems are proposed, the hybrid interval simulated annealing and the combined interval branch and bound and genetic algorithm. The numerical experiment shows better results compared to Hansen’s algorithm and simulated annealing in terms of the storage, speed, and number of function evaluations. The convergence proof is described. Moreover, the idea of both algorithms suggests a structure for an integrated interval branch and bound and genetic algorithm for constrained problems in which the algorithm is described and tested. The aim is to capture one of the solutions with higher accuracy and lower cost. The results show better quality of the solutions with less number of function evaluations compared with the traditional GA.

A Cost-Effective Upper Extremity Prosthesis Design

2007 ◽  
Author(s):  
Steven Chen ◽  
Vanessa Pau ◽  
Theresa Shar ◽  
Stephanie Tiaden ◽  
Anthony Wong
Keyword(s):  
Developing Countries ◽  
Upper Extremity ◽  
Lower Cost ◽  
Cost Effective ◽  
Developed Countries ◽  
Economic Resources ◽  
Less Developed Countries ◽  
Prosthetic Device ◽  
Medical Facilities ◽  
Lower Complexity

Upper extremity prostheses are a scarce necessity in less developed countries due to the lack of medical facilities, economic resources, and prevalent warfare. Prostheses have become a growing need as fifty-thousand amputations occur annually, with the current market being focused primarily on lower extremities. Leg prostheses have received much more attention and success than their upper extremity counterparts, due to their lower complexity that also yields lower cost. Prosthetic legs only need to fulfill basic motions such as walking and running, as opposed to the more complicated hands that encompass 22 degrees of motion. In less developed countries with few medical facilities, amputees need to travel long distances to find treatment. The objective is to design an affordable and easily assembled body-powered, below-elbow prosthetic device for adults that provides basic arm function and can be widely distributed in developing countries. Therefore, cost, availability, functionality, and simplicity are the primary considerations of the design.

Waste stabilisation ponds upgrading at Blenheim and Seddon, New Zealand - case studies

2003 ◽  
Vol 48 (2) ◽  
pp. 17-23
Author(s):  
H.E. Archer ◽  
S.A. Donaldson
Keyword(s):  
Wastewater Treatment ◽  
New Zealand ◽  
Lower Cost ◽  
Small Communities ◽  
Large Cities ◽  
Effluent Quality ◽  
Waste Stabilisation Ponds ◽  
Bank Protection ◽  
In Series ◽  
Final Effluent

Waste stabilisation ponds (WSP) have been a popular form of wastewater treatment in New Zealand both for large cities and small communities. Most WSP were constructed from 1960 to 1985 and were single ponds or a primary and secondary pond in series of similar size. Since 1995, improvements comprising primary and maturation ponds, with four to six cells in series have been constructed or retrofitted to original two cell ponds. The Seddon and Blenheim ponds include in-bank rock filters between maturation cells as a lower cost way of providing this feature for reduction of solids. Operating results show reduced variability in final effluent quality for BOD and SS. In addition, very good reductions of faecal coliform and enterococci have been achieved along with good reductions of ammonia and total nitrogen for most of the year except the middle of winter. Extensive use of rock as rip-rap bank protection and in the rock filters, appears to have provided sufficient extra surface area for a nitrifying biofilm to develop.

Sign in / Sign up

Export Citation Format

Share Document