Results 71 to 80 of about 4,841 (225)
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
Application Teaching Case of Dijkstra Algorithm
DEStech Transactions on Social Science, Education and Human Science, 2017 Dijkstra algorithm has been widely applied in many fields, such as optimization, image processing and grid processing. In the tradition teaching process, we find that students could not understand the use of Dijkstra algorithm, think this algorithm is complex and have no interest.
Xiao-Chao SUN +3 more
openaire +2 more sources
An Improved Dijkstra Shortest Path Algorithm [PDF]
Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013), 2013 An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed
Min Shi, Qingming Yi, Yizhen Huang
openaire +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
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
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
Adaptation Of The Variable Neighborhood Search Heuristic To Solve The Vehicle Routing Problem
Jurnal Teknik Industri, 2012 The vehicle routing problem is investigated by using some adaptations of the variable neighborhood search (VNS). The initial solution was obtained by Dijkstra’s algorithm based on cost network constructed by the sweep algorithm and the 2-opt.
Arif Imran, Liane Okdinawati
doaj +1 more source
Bidirectional Dijkstra’s Algorithm is Instance-Optimal
Fixed a bug in the bidirectional search pseudocode where e_mid was updated even if $\mu$ wasn't. Fixed a typo in the proof of Theorem 3: changed all $v_1u_2$ to $u_2v_1$.
Haeupler, Bernhard +4 more
openaire +2 more sources
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
Landmark Guided Probabilistic Roadmap Queries
, 2017 A landmark based heuristic is investigated for reducing query phase run-time of the probabilistic roadmap (\PRM) motion planning method. The heuristic is generated by storing minimum spanning trees from a small number of vertices within the \PRM graph ...
Frazzoli, Emilio +2 more
core +1 more source