Results 81 to 90 of about 5,425,704 (264)
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
Empirical Time Complexity of Generic Dijkstra Algorithm
IFIP/IEEE International Symposium on Integrated Network Management (IM 2021)
Piotr Jurkiewicz +3 more
openaire +3 more sources
Integrated routing of heavy electrical and diesel trucks in forest transports
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
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
An Exact Method for Reliable Shortest Path Problems With Correlation
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva +3 more
wiley +1 more source
Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core
Numerical Solutions to the Variational Problems by Dijkstra’s Path-Finding Algorithm
In 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
Seismic imaging of the critical zone of dolerite dykes at Cap Fréhel in Brittany (France)
Abstract In June 2023, we measured ten near‐surface seismic profiles to image the critical zone of dolerite (diabase) dykes that cut the sandstone at Cap Fréhel in Brittany (France). Seismic ray tracing and inversion are used to determine the thickness of the regolith layer from first‐arrival P‐wave traveltimes.
M. Zillmer +4 more
wiley +1 more source
The Effective Algorithm for Navigation of Quadrotor UAV in Indoor Environment
The quadrotor is an extensively researched and popular unmanned aerial vehicle in various fields, with navigation being one of the most widely studied areas.
Van-Long Trinh, Ngoc-Tien Tran
doaj +1 more source
ABSTRACT Structural equation modelling (SEM) has become a widely used method across various disciplines including educational leadership and management (EDLM). Although researchers in many disciplines have conducted reviews regarding the use of PLS‐SEM, its application in EDLM has not yet been reviewed comprehensively.
Yuting Zhang +4 more
wiley +1 more source

