Application of Graph Theory In Air-Transportation Network
Minimum Spanning Tree by using Kruskal algorithm and graph search Dijkstra’s Algorithm to find the shortest path between two points, Also, for this case was developed a network model
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
Minimum Spanning Tree by using Kruskal algorithm and graph search Dijkstra’s Algorithm to find the shortest path between two points, Also, for this case was developed a network model
Obtaining of the shortest path set plays an important role in traffic network calculation n .However, most of existing algorithms do not consider the delay in the intersection
been devised to solve various combinatorial optimization problems including routing, shortest path, packet transmission, assignments and many more. These algorithms subsist with the names as Ant Colony Optimization…
taken for 2 - 3 months. We are using a routing algorithm to calculate the shortest and optimized path. The common problem in Indian road system was poor road direction ... going to propose a solution for the problem by…
areas, the constrained shortest path (CSP) problem is frequently employed. As an NP-hard problem, it is still a matter of debate. The adaptive amoeba algorithm's fundamental mechanism ... suggested procedure. To resolve…
determine a shortest path possible with minimum time required to move from starting point to target point in ergonomics with obstacles. In this paper, algorithm is used to chart global
weakness in routing because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain…
cooperative control for getting shortest path which can minimize the completion time. A new methodology that is supported on Travelling Salesman Problem (TSP) with Genetic Algorithm (GA) search technique ... task…
such as a long delay, frequent jitter and low reliability, this paper proposes RC algorithm RC estimates the dynamic data volume on service nodes and links through reasonable data volume ... multimedia delivery problem…
scientists are solving difficult optimization problems by proposing algorithms on ant behavior i.e. Ant Colony Optimization to find shortest paths from source to destination. Ant colonies present highly structured…
hybrid networks. This SCS protocol incorporates four algorithms: 1) Path Selection Algorithm to identify the neighbouring node at shortest distance to reduce the delay 2) Routing Algorithm for hopping
algorithm performs better than other basic pathfinding algorithms such as the Genetic and Dijkstra. Our proposed approach can find the shortest path in real-time even for large amounts
inspired by the reproduction strategy of cuckoos. This paper investigates the applications of Cuckoo algorithm in various domains. The applications of Cuckoo includes optimizing weights of neural networks, parameters…
that the cluster head selection is based upon only shortest path Due to this strategy, the cluster head selection algorithm is not much effective. Hence the proposed algorithm
optimization (ACO)-based method. Ant colony optimization algorithm is inspired by observation on real ants in their search for the shortest paths to food sources. Protein function prediction ... models is their large…
make the routing path algorithm with very high robustness, as well as the final routing path has been generated as close as possible to the shortest path routing ... next hop node, and to make the greedy forwarding…
multipath routing is an alternative to single shortest path routing to distribute load and lighten congestion in the network. There are various algorithms presented in literature for effectively calculating
shortest path problem is a typical problem of optimization. This paper presents the ant colony optimization (ACO) algorithm to solve a problem of routing vehicles in a Fire Department
that shortest path can be find out between the two communicating nodes in MANET. In this paper firstly we survey some optimization techniques which find out the optimizing path between ... propose a Cuckoo Ant Colony…
work, the Dijkstra Algorithm for Shortest route analysis was used to prove the advantage of Point to multi point approach in the optimal path planning in a transmission network taking
shortest path) causes attack. In this paper, we propose the secured solution and detection against attack by finding the optimum path in AODV protocol and providing high secured data transmission ... using AES Algorithm
Meta heuristic combinatorial optimization technique. Ant Colony System (ACS) is the algorithm in the ACO. This is based on the behavior of ants. Many ants starts to search food from ... ways. At last all ants reach the…
extracted from Functional Magnetic Resonance Imaging (fMRI) data. Afterwards node degree, clustering coefficient and shortest path length are used to analyse the functional characteristics of networks. Finally, the…
data in an energy efficient manner so that network lifetime is improved. A new algorithm which focuses on energy capable data transmission between all the source nodes and the sink ... concept of ‘Distance Metric’…
proposed approach is utilizing only shortest paths joining the border of a window with its center. In the 5x5 filtering window only 8 paths consisting of 2 nodes have ... uncorrupted pixels in the processing window. The…
For authors and organisers
Find the right journal for your paper and submit your manuscript.