A Robust Routing Protocol in Cognitive Unmanned Aerial Vehicular Networks. [PDF]
Sensors (Basel)Rozario A, Ahmed E, Mansoor N.
europepmc +1 more source
Research on time-varying path optimization for multi-vehicle type fresh food logistics distribution considering energy consumption. [PDF]
Sci RepChen H, Wang W, Jia L, Wang H.
europepmc +1 more source
FLDQN: Cooperative Multi-Agent Federated Reinforcement Learning for Solving Travel Time Minimization Problems in Dynamic Environments Using SUMO Simulation. [PDF]
Sensors (Basel)Mamond AW +4 more
europepmc +1 more source
A new solution to the K-shortest paths problem and its application in wavelength routed optical networks [PDF]
Photonic Network Communications, 2006 In communication networks, traffic carried over long paths suffers from a higher call blocking probability (CBP) than those carried over short paths. This is a well-known fairness problem. Such a problem becomes more serious in wavelength-routed optical networks (WRONs) due to the wavelength continuity constraint.
Junjie Li, Hanyi Zhang
openalex +2 more sources
Transmission Line Route Selection: An Application of K-Shortest Paths and Goal Programming
IEEE Power Engineering Review, 1984 A two-stage solution procedure is developed as a managerial decision making tool in the transmission line route selection process. In stage one, the K least costly alternatives are found, based strictly on monetary considerations. In stage two, the alternative which causes the least amount of social and environmental disruption is selected from the ...
F. Choobineh, T. Burgman
openalex +4 more sources
Ak-SHORTEST PATHS ROUTING HEURISTIC FOR STOCHASTIC NETWORK EVACUATION MODELS
Engineering Optimization, 1984 Stochastic-network evacuation models require an optimization process to determine the best evacuation routes for a building's occupants. The optimization process developed and applied below is a heuristic based on the K-th Shortest Path Algorithm.
C. J. KARBOWICZ, J. MacGregor Smith
openalex +3 more sources
Comparison of k-shortest paths and maximum flow routing for network facility restoration
IEEE Journal on Selected Areas in Communications, 1994 In the development of technologies for span failure restoration, a question arises about the restoration rerouting characteristics to be specified. In theory, maximal rerouting capacity is obtained with a maximum flow (Max Flow) criterion. However, rerouting that realizes the k-successively shortest link disjoint paths (KSP) may be faster, easier, and,
D. A. Dunn, W.D. Grover, M.H. MacGregor
openalex +3 more sources
An Efficient K-Shortest Paths Based Routing Algorithm
Advanced Materials Research, 2012 We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm.
Jian Lian, Yan Zhang, Cheng Jiang Li
openalex +3 more sources
Performance optimization of intelligent optical networks by multiple alternate routes based on the K-shortest path algorithm [PDF]
SPIE Proceedings, 2006 Blocking probability is one of the key factors to evaluate the routing and wavelength algorithms for intelligent optical network. Two kinds of Dynamic K-Shortest Path (DKSP) Algorithms were designed. One is based on Linear Link Weight Function (LW) and the other is based on Piecewise Linear Link Weight Function (PLW).
Xinyou Cui +4 more
openalex +2 more sources
K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks
, 2005 Actually, various kinds of sources (such as voice, video, or data) with diverse traffic characteristics and Quality of Service Requirements (QoS), which are multiplexed at very high rates, leads to significant traffic problems such as packet losses, transmission delays, delay variations, etc, caused mainly by congestion in the networks.
Saïd Hoceïni +2 more
openalex +3 more sources