Results 61 to 70 of about 15,993 (171)
A Performance Comparison of Shortest Path Algorithms in Directed Graphs
Engineering ProceedingsThis study examines the performance characteristics of four commonly used short-path algorithms, including Dijkstra, Bellman–Ford, Floyd–Warshall, and Dantzig, on randomly generated directed graphs.
Fatima Sapundzhi +4 more
doaj +1 more source
Study on Near-Optimal Path Finding Strategies in a Road Network
Journal of Algorithms & Computational Technology, 2008 In this paper we analyze the existing defects of hierarchical and nonhierarchical path finding algorithm respectively in detail and present a hierarchical path finding algorithm based on the heuristic directing search approach which is used for promoting
Shi Jun +3 more
doaj +1 more source
Speeding up shortest path algorithms
, 2012 Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg +10 more
core +1 more source
Sustainable Development, EarlyView.ABSTRACT Education is a cornerstone of sustainable development, yet large disparities in access persist across and within countries—particularly in Africa, where millions remain underserved. Among several factors influencing educational participation, physical accessibility to schools (in terms of travel time) is not comprehensively understood ...
Diana Jaramillo‐Araujo, Jim W. Hall
wiley +1 more source
Systems Engineering, EarlyView.ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza +3 more
wiley +1 more source
Algorithmic Aspects of Energy-Delay Tradeoff in Multihop Cooperative Wireless Networks [PDF]
, 2011 We consider the problem of energy-efficient transmission in delay constrained cooperative multihop wireless networks. The combinatorial nature of cooperative multihop schemes makes it difficult to design efficient polynomial-time algorithms for deciding ...
Baghaie, Marjan +2 more
core
Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms
Decision Sciences, EarlyView.Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham +2 more
wiley +1 more source
Infrastructure expansion, tourism and electoral outcomes
Economica, EarlyView.Abstract This paper examines the electoral impact of economic growth through increased foreign tourism using data from Croatia. To identify causal effects, the paper applies an instrumental variable strategy, which uses variation in the ruggedness of the local terrain to estimate the network of least‐cost paths.
Adrian Mehic
wiley +1 more source
Multi‐objective maritime vessel routing with safety considerations
International Transactions in Operational Research, EarlyView.Abstract The routing of maritime vessels is a challenging optimization problem that involves finding an adequate balance between conflicting and multiple objectives. This paper proposes a methodology based on inverse optimization to find appropriate objective weights that account for conflicting objectives. To formulate the inverse optimization problem,
Nazanin Sharif +4 more
wiley +1 more source
Numerical Solutions to the Variational Problems by Dijkstra’s Path-Finding Algorithm
Applied SciencesIn this work, we propose the general idea of using a path-finding algorithm to solve a variational problem. By interpreting a variational problem of finding the function that minimizes a functional integral as a shortest path finding, we can apply the ...
Thanaporn Arunthong +6 more
doaj +1 more source