Results 81 to 90 of about 3,733 (151)
Multi-point path planning based on the algorithm of colony-particle swarm optimization
Tongxin xuebao, 2019 The problem of multi-point path planning is a NP-hard problem,which is equivalent to finding the shortest path of a starting point and some specific node.Aiming at the problem of multi-point path planning,a retrospective ant colony-particle swarm ...
Lijue LIU +3 more
doaj +2 more sources
Evaluation of Shortest Paths in Road Network [PDF]
Pakistan Journal of Commerce and Social Sciences, 2009 Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based ...
Farrukh Shehzad, Muhammad Akbar Ali Shah
doaj
A Study on Price-Based Charging Strategy for Electric Vehicles on Expressways
Energies, 2016 With the large-scale adoption of electric vehicles (EVs) on expressways, the exploration of a guiding-based charging method to effectively adjust interactions between EVs and the fast charging stations (CSs) is urgently needed.
Lixing Chen +3 more
doaj +1 more source
Fail Path Analysis on Openflow Network Using Floyd-Warshall Algorithm
Jurnal Mantik, 2020 Software-Defined Network (SDN) is a new concept used to solve network problems by separating the control plane and data plane in a different device. Communication between the control plane and the data plane uses the Openflow scenario. SDN has several capabilities in many network technology methods and has been implemented, among others, for routing ...
Rohman, Ebim Fatur +2 more
openaire +1 more source
Optimal path calculation method of optical network under complex constraints
Engineering Reports, Volume 6, Issue 12, December 2024.In view of the complex logical constraints in SDON services, a unified constraint expression is proposed, and the network topology is layered to transform, creatively solving the urgently needed “and,” “or,” bidirectional link and other logical types in SDON services, constrained path calculation problem.
Peng Zhu +3 more
wiley +1 more source
AlgorithmsFloyd–Warshall’s algorithm is a widely-known procedure for computing all-pairs shortest paths in a graph of n vertices in Θ(n3) time complexity. A simplified version of the same algorithm computes the transitive closure of the graph with the same time ...
Giuseppe Lancia, Marcello Dalpasso
doaj +1 more source
IEEE Access, 2019 Cloud radio access network (C-RAN) is considered as a promising architecture for 5G with advantages of green energy, convenient resources allocation. In this paper, we explore the feasibility of C-RAN for high-speed railway (HSR) scenarios.
Botao Han +7 more
doaj +1 more source
Thermoring basis for heat unfolding‐induced inactivation in TRPV1
Natural Sciences, Volume 4, Issue 4, October 2024.In the heat‐evoked irreversible inactivated or desensitized state of the rat TRPV1 channel, H410 (green) in the pre‐S1 domain forms a lone pair–π interaction and an H‐bond with E692 (blue) and N695 (orange) in the TRP domain, respectively. These two noncovalent interactions induce a smaller random thermoring with a two‐residue size.
Guangyu Wang
wiley +1 more source
Floyd-Warshall Algorithm 1 [PDF]
: There are several applications in VLSI technology that require high-speed shortest-path computations. The shortest path is a path between two nodes (or points) in a graph such that the sum of the weights of its constituent edges is minimum.
Ajay Somkuwar +2 more
core
The Floyd-Warshall Algorithm, the AP and the TSP
, 2001 We use admissible permutations and a variant of the Floyd-Warshall algorithm to obtain an optimal solution to the Assignment Problem. Using another variant of the F-W algorithm, we obtain an approximate solution to the Traveling Salesman Problem. We also give a sufficient condition for the approximate solution to be an optimal solution.
openaire +2 more sources