Solution to Shortest Path Problem Using a Connective Probe Machine
نویسندگان
چکیده
منابع مشابه
Shortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملAn evolutionary solution for multimodal shortest path problem in metropolises
This paper addresses the problem of time-dependent shortest multimodal path in complex and large urban areas. This problem is one of the important and practical problems in several fields such as transportation, and recently attracts the research focus due to developments in new application areas. An adapted evolutionary algorithm, in which chromosomes with variable lengths and particularly def...
متن کاملThe Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods
We consider the problem of finding a shortest path in a directed graph with a quadratic objective function (the QSPP). We show that the QSPP cannot be approximated unless P = NP. For the case of a convex objective function, an n-approximation algorithm is presented, where n is the number of nodes in the graph, and APX-hardness is shown. Furthermore, we prove that even if only adjacent arcs play...
متن کاملDNA Solution of the Shortest Path Problem by Concentration Control
DNA computing is the method for computation by using DNA and its chemical reactions. Adleman and Lipton have shown that an instance of NP-complete problems can be solved by DNA computing [1, 2]. Their methods first generate all candidate solutions in parallel, and then extract target DNAs by some chemical operations. However, such a simple approach to combinatorial problems will be unpromising,...
متن کاملMultiobjective Optimization Solution for Shortest Path Routing Problem
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2019
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2019/8709042