scholarly journals An approximation of balanced score in neutrosophic graphs with weak edge weights

2021 ◽  
Vol 11 (6) ◽  
pp. 5286
Author(s):  
V. Srisarkun ◽  
C. Jittawiriyanukoon
Keyword(s):  
Ad Hoc ◽  
Minimum Spanning Tree ◽  
Road Traffic ◽  
Undirected Graph ◽  
Real Life ◽  
Stable Condition ◽  
Minimum Cost ◽  
Threshold Value ◽  
Traffic Condition ◽  
Weak Edge

Neutrosophic concept is known undirected graph theory to involve with complex logistic networks, not clearly given and unpredictable real life situations, where fuzzy logic malfunctions to model. The transportation objective is to ship all logistic nodes in the network. The logistic network mostly experiences in stable condition, but for some edges found to be volatile. The weight of these erratic edges may vary at random (bridge-lifting/bascule, ad hoc accident on road, traffic condition) In this article, we propose an approximation algorithm for solving minimum spanning tree (MST) of an undirected neutrosophic graphs (UNG), in which the edge weights represent neutrosophic values. The approximation upon the balanced score calculation is introduced for all known configurations in alternative MST. As the result, we further compute decisive threshold value for the weak weights amid minimum cost pre-computation. If the threshold triggers then the proper MST can direct the decision and avoid post-computation. The proposed algorithm is also related to other existing approaches and a numerical analysis is presented.

scholarly journals METRICS FOR PERFORMANCE EVALUATION OF SAFETY APPLICATIONS IN VEHICULAR AD HOC NETWORKS

Transport ◽  
2008 ◽  
Vol 23 (4) ◽  
pp. 291-298 ◽  
Author(s):  
Saleh Yousefi ◽  
Mahmood Fathy
Keyword(s):  
Performance Evaluation ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Road Traffic ◽  
Real Life ◽  
Message Exchange ◽  
To Come ◽  
Hoc Networks ◽  
Safety Applications

In the recent years, direct message exchange between vehicles in order to improve the safety of road traffic has been attracting lots of interest in both networking and road safety communities. While travelling on a road, vehicles form an ad hoc network called Vehicular Ad hoc NETwork (VANET) and deploy life safety applications. Evaluating the performance of these applications is primordial for realizing VANETs in real life. Current literature lacks efficient ways to evaluate the performance of safety applications and mostly leverages on classical networking metrics like delay, delivery rate etc. In this paper, we consider both networking and safety concerns simultaneously to come up with more efficient methods. In particular, we first point out the significance of fairness and coverage from safety viewpoint. Then, we introduce two new metrics called beaconing rate and effective range aiming at providing more facilities for safety performance evaluation in VANET s research. Furthermore, realizing special characteristics of safety applications while disseminating beacon messages, we study the way that beacon dissemination protocols affect the performance of safety applications. We then conduct extensive simulation study to show the usefulness of the introduced metrics and derive some insights on the feasibility of driver‐assistant safety applications. Our evaluation also shows that sending the aggregated status of neighbouring vehicles in addition to vehicle's own status, and instead, increasing beacon transmission interval may be invoked in order to assist safety applications in providing satisfactory services to drivers.

scholarly journals Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Carlos Contreras-Bolton ◽  
Carlos Rey ◽  
Sergio Ramos-Cossio ◽  
Claudio Rodríguez ◽  
Felipe Gatica ◽  
...  
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Undirected Graph ◽  
Minimum Cost ◽  
Practical Applications ◽  
Minimum Spanning Tree Problem ◽  
Generalized Minimum Spanning Tree ◽  
Np Hardness ◽  
New Algorithms

The generalized minimum spanning tree problem consists of finding a minimum cost spanning tree in an undirected graph for which the vertices are divided into clusters. Such spanning tree includes only one vertex from each cluster. Despite the diverse practical applications for this problem, the NP-hardness continues to be a computational challenge. Good quality solutions for some instances of the problem have been found by combining specific heuristics or by including them within a metaheuristic. However studied combinations correspond to a subset of all possible combinations. In this study a technique based on a genotype-phenotype genetic algorithm to automatically construct new algorithms for the problem, which contain combinations of heuristics, is presented. The produced algorithms are competitive in terms of the quality of the solution obtained. This emerges from the comparison of the performance with problem-specific heuristics and with metaheuristic approaches.

scholarly journals Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Yen Hung Chen
Keyword(s):  
Weight Function ◽  
Polynomial Time ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Undirected Graph ◽  
Minimum Cost ◽  
Approximation Schemes ◽  
Time Approximation ◽  
Minimum Spanning Tree Problem ◽  
Polynomial Time Approximation

LetG=(V,E)be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning treeTinGsuch that the total weight inTis at most a given boundB. In this paper, we present two polynomial time approximation schemes (PTASs) for the constrained minimum spanning tree problem.

A Groundwork Based Novel Routing Protocol for Vehicular Ad hoc Networks

2017 ◽  
Vol 7 (11) ◽  
pp. 121
Author(s):  
Amolkirat Singh ◽  
Guneet Saini
Keyword(s):  
Routing Protocol ◽  
Packet Loss ◽  
Secure Communication ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Road Traffic ◽  
Traditional Approach ◽  
Unexpected Events ◽  
The Road ◽  
On The Road

Many people lose their life and/or are injured due to accidents or unexpected events taking place on road networks. Besides traffic jams, these accidents generate a tremendous waste of time and fuel. Undoubtedly, if the vehicles are provided with timely and dynamic information related to road traffic conditions, any unexpected events or accidents, the safety and efficiency of the transportation system with respect to time, distance, fuel consumption and environmentally destructive emissions can be improved. In the field of computer and information science, Vehicular Ad hoc Network (VANET) have recently emerged as an effective tool for improving road safety through propagation of warning messages among the vehicles in the network about potential obstacles on the road ahead. VANET is a research area which is in more demand among the researchers, the automobile industries and scientists to discover about the loopholes and advantages of the vehicular networks so that efficient routing algorithms can be developed which can provide reliable and secure communication among the mobile nodes.In this paper, we propose a Groundwork Based Ad hoc On Demand Distance Vector Routing Protocol (GAODV) focus on how the Road Side Units (RSU’s) utilized in the architecture plays an important role for making the communication reliable. In the interval of finding the suitable path from source to destination the packet loss may occur and the delay also is counted if the required packet does not reach the specified destination on time. So to overcome delay, packet loss and to increase throughput GAODV approach is followed. The performance parameters in the GAODV comes out to be much better than computed in the traditional approach.

scholarly journals A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jianxun Cui ◽  
Shi An ◽  
Meng Zhao
Keyword(s):  
Flow Model ◽  
Time Window ◽  
Programming Model ◽  
Real Life ◽  
Minimum Cost ◽  
Emergency Evacuation ◽  
Mixed Integer ◽  
Fixed Cost ◽  
Minimum Cost Flow ◽  
Cost Flow

During real-life disasters, that is, earthquakes, floods, terrorist attacks, and other unexpected events, emergency evacuation and rescue are two primary operations that can save the lives and property of the affected population. It is unavoidable that evacuation flow and rescue flow will conflict with each other on the same spatial road network and within the same time window. Therefore, we propose a novel generalized minimum cost flow model to optimize the distribution pattern of these two types of flow on the same network by introducing the conflict cost. The travel time on each link is assumed to be subject to a bureau of public road (BPR) function rather than a fixed cost. Additionally, we integrate contraflow operations into this model to redesign the network shared by those two types of flow. A nonconvex mixed-integer nonlinear programming model with bilinear, fractional, and power components is constructed, and GAMS/BARON is used to solve this programming model. A case study is conducted in the downtown area of Harbin city in China to verify the efficiency of proposed model, and several helpful findings and managerial insights are also presented.

scholarly journals A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Threshold Value ◽  
Recovery Phase ◽  
Network Routing ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Random Manner ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

scholarly journals FUZZY SHORTEST ROUTE ALGORITHM FOR TELEPHONE LINE CONNECTION USING THE LC-MST ALGORITHM

2015 ◽  
Vol 2 (2) ◽  
pp. 37-39
Author(s):  
Vijayalakshmi D ◽  
Kalaivani R
Keyword(s):  
Transmission Lines ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Cost ◽  
Distribution Networks ◽  
Minimum Length ◽  
Fuzzy Graph ◽  
Telephone Line ◽  
Water Pipelines ◽  
Communication Links

In computer science, there are many algorithms that finds a minimum spanning tree for a connected weighted undirected fuzzy graph. The minimum length (or cost) spanning tree problem is one of the nicest and simplest problems in network optimization, and it has a wide variety of applications. The problem is tofind a minimum cost (or length) spanning tree in G. Applications include the design of various types of distribution networks in which the nodes represent cities, centers etc.; and edges represent communication links (fiber glass phone lines, data transmission lines, cable TV lines, etc.), high voltage power transmissionlines, natural gas or crude oil pipelines, water pipelines, highways, etc. The objective is to design a network that connects all the nodes using the minimum length of cable or pipe or other resource in this paper we find the solution to the problem is to minimize the amount of new telephone line connection using matrixalgorithm with fuzzy graph.

scholarly journals Comparative Study of Machine Learning Classifiers for Modelling Road Traffic Accidents

2022 ◽  
Vol 12 (2) ◽  
pp. 828
Author(s):  
Tebogo Bokaba ◽  
Wesley Doorsamy ◽  
Babu Sena Paul
Keyword(s):  
Machine Learning ◽  
Traffic Accidents ◽  
Road Traffic ◽  
Real Life ◽  
Support Vector ◽  
Road Traffic Accidents ◽  
Machine Learning Classifiers ◽  
Reduction Techniques ◽  
Learning Classifiers ◽  
Accident Data

Road traffic accidents (RTAs) are a major cause of injuries and fatalities worldwide. In recent years, there has been a growing global interest in analysing RTAs, specifically concerned with analysing and modelling accident data to better understand and assess the causes and effects of accidents. This study analysed the performance of widely used machine learning classifiers using a real-life RTA dataset from Gauteng, South Africa. The study aimed to assess prediction model designs for RTAs to assist transport authorities and policymakers. It considered classifiers such as naïve Bayes, logistic regression, k-nearest neighbour, AdaBoost, support vector machine, random forest, and five missing data methods. These classifiers were evaluated using five evaluation metrics: accuracy, root-mean-square error, precision, recall, and receiver operating characteristic curves. Furthermore, the assessment involved parameter adjustment and incorporated dimensionality reduction techniques. The empirical results and analyses show that the RF classifier, combined with multiple imputations by chained equations, yielded the best performance when compared with the other combinations.

scholarly journals Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems

2021 ◽  
Vol 20 ◽  
pp. 107-117
Author(s):  
TIMOTHY MICHAEL CHÁVEZ ◽  
DUC THAI NGUYEN
Keyword(s):  
Real Life ◽  
Minimum Cost ◽  
Simplex Algorithm ◽  
Efficient Algorithms ◽  
Computer Implementation ◽  
Loop Formation ◽  
Minimum Cost Flow ◽  
Flow Network ◽  
Network Problems ◽  
Cost Flow

While the minimum cost flow (MCF) problems have been well documented in many publications, due to its broad applications, little or no effort have been devoted to explaining the algorithms for identifying loop formation and computing the θ value needed to solve MCF network problems. This paper proposes efficient algorithms, and MATLAB computer implementation, for solving MCF problems. Several academic and real-life network problems have been solved to validate the proposed algorithms; the numerical results obtained by the developed MCF code have been compared and matched with the built-in MATLAB function Linprog() (Simplex algorithm) for further validation.

Sign in / Sign up

Export Citation Format

Share Document