Results 71 to 80 of about 4,817 (226)
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
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
International Transactions in Operational Research, EarlyView.Abstract This paper introduces a novel heuristic method, the smart selective navigator (SSN), for addressing arc routing problems (ARPs) with a focus on integrating hard turn restrictions in urban winter operations. Addressing a significant gap in existing ARP methodologies, SSN seamlessly incorporates common side constraints, such as vehicle ...
Farhad Baghyari, Jaho Seo
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
An Improved Search Algorithm for Optimal Multiple-Sequence Alignment
, 2011 Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP-hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits ...
Schroedl, S.
core +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
Integrated routing of heavy electrical and diesel trucks in forest transports
International Transactions in Operational Research, EarlyView.Abstract Fossil‐free forestry transports are important to reach climate goals. In Sweden, road transports account for around 50% of the industry's CO2 emissions and almost 20% of the road freight volumes. Previous studies have shown that electrification is a cost‐effective way for carbon abatement, while at the same time the requirements for ...
Mikael Rönnqvist +4 more
wiley +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