Shortest Path Problem under Fuzziness
shortest path problem plays a paramount role in a wide spectrum of domains including transportation, communication and networking
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:
shortest path problem plays a paramount role in a wide spectrum of domains including transportation, communication and networking
efficient. In transportation optimization, personnel scheduling, network routing, and other areas, the constrained shortest path (CSP) problem is frequently employed. As an NP-hard problem, it is still a matter ... this…
complete problems such as Hamilton Path Problem, 3-SAT Problem, and Maximum Clique Problem. In this paper we apply DNA computing to solve Shortest Hamiltonian Path Problem using two steps ... determine all Hamilton path…
Shortest Path problems are inevitable in road network applications such as city emergency handling and drive guiding system. Basic concepts of network analysis in connection with traffic issues are explored…
The shortest paths, sets of paths with the shortest distance between a
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
path between different locations appears to be a key problem in the road networks. The wide range of applications was introduced to overcome the problem by developing various shortest path ... still persists to find the…
vehicle routing problem with quantity discounts for outsourcing, a non-linear programming model is established; and an evolutionary algorithm based on the shortest path encoding approach is designed to solve
considered so that the multimedia delivery problem is transformed into a conventional shortest path problem. The experimental simulation results show that the algorithm is a kind of high efficient
most important problems in this field is the Hamiltonian Path Problem which consists in determining the shortest path traversing each node of a directed graph exactly once and returning ... text. Most importantly, DNA…
Similar kind of algorithms has been devised to solve various combinatorial optimization problems including routing, shortest path, packet transmission, assignments and many more. These algorithms subsist with the names
This study investigate application for Particle Swarm Optimization (PSO) to robot mobility problem to determine a shortest path possible with minimum time required to move from starting point to target ... ideal…
capacity of 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 ... search…
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 and qualities and PWD works
widely used as the first stage of classification task to reduce the dimension of problem, decrease noise, improve speed and relieve memory constraints by the elimination of irrelevant or redundant ... observation on…
researcher and 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
Dijkstra’s Algorithm to find the shortest path between two points, Also, for this case was developed a network model of the transportation problem which is analyzed in detail
routing void problem” is always around. In order to solve the “routing void problem” in the modern wireless sensor networks, a routing algorithmbased on greedy forwarding is proposed by introducingVirtual ... been…
setting up relatively stable cluster structure. But the problem is that the cluster head selection is based upon only shortest path Due to this strategy, the cluster head selection algorithm
protocol is threaded by a security problem called cooperative black hole attack, in which all malicious nodes introduces themselves as having shortest path to the destination node. In this paper
cities will double during the next 30 years. This rapid growth raises serious problems in the central sections of both traditional and smart cities. One of the key areas ... route. The technology uses google maps as a…
arenas for researchers. The fundamental problem in sensor networks states the relevance and routing of data through a genuine path as path length decides some basic performance parameters for sensor ... networks. This…
routing methods which include shortest path routing to comfort congestion in mobile network. In this paper authors main objective is to short comings the routing problem and find optimized routing
infrastructure. This gives rise to the optimization,reliability,high fault tolerant and highly distributed problem which we overcome in this project using . PASTRY distributed algorithm and non-trivial approximation…
Graph Theory is a fundamental area of mathematics and computer science that
For authors and organisers
Find the right journal for your paper and submit your manuscript.