Results 41 to 50 of about 32,185 (303)
A Hybrid Routing Approach Using Two Searching Layers
Electrical, Control and Communication Engineering, 2021 This paper considers SUB_GOALs by using basic A* algorithm and Subgoal Graphs in a hybrid approach to execute optimal route. SUB_GOALs identified with pre-searching from basic A* at break points and Subgoal Graphs at corners of obstacles are added to ...
Koca Gonca Ozmen, Yetkin Seda
doaj +1 more source
International Journal of Analysis and Applications, 2023 The Shortest Path Problem is a core problem in network optimization, with applications in various scientific and engineering fields, such as communication, transportation, routing, scheduling, and computer networks.
K. Vidhya, A. Saraswathi
doaj +1 more source
The disjoint shortest paths problem
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, 2021 The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
doaj +1 more source
IEEE AccessPathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions ...
Amr Elshahed +4 more
doaj +1 more source
High Health Care Utilization Preceding Diagnosis With Juvenile Idiopathic Arthritis
Arthritis Care &Research, EarlyView.Objective Although early diagnosis improves long‐term outcomes, patients with juvenile idiopathic arthritis (JIA) often experience prolonged, circuitous paths to diagnosis. To inform diagnostic improvement, we sought to characterize health care utilization in the year preceding diagnosis. Methods We identified 10,021 patients with an incident diagnosis
Anna Costello +5 more
wiley +1 more source
The design of transportation networks: a multi objective model combining equity, efficiency and efficacy [PDF]
, 2012 A network design problem consists in locating facilities (nodes and arcs) that enable the transfer of flows (passengers and/or goods) from given origin-destination pairs.
Barbati, Maria
core +1 more source
A fast layered path planning algorithm for job shop scheduling problem
IET Collaborative Intelligent Manufacturing, 2022 Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm to solve JSP, which first removes part of jobs from the ...
Lin Huang, Shikui Zhao, Qing Han
doaj +1 more source
Advanced Engineering Materials, EarlyView.Additive manufacturing provides precise control over the placement of continuous fibres within polymer matrices, enabling customised mechanical performance in composite components. This article explores processing strategies, mechanical testing, and modelling approaches for additive manufactured continuous fibre‐reinforced composites.
Cherian Thomas, Amir Hosein Sakhaei
wiley +1 more source
MATEC Web of Conferences, 2016 Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj +1 more source