Results 71 to 80 of about 550,853 (271)
RUTE TERPENDEK UNTUK PENGANGKUTAN SAMPAH DENGAN PENDEKATAN LINTASAN HAMILTON
E-Jurnal Matematika, 2021 This research is related to the route of picking up the waste which done by janitors in housing complex of Aur Duri Indah Rt.14 Jambi considering the condition of that housing which have some crossroads, such that janitors take the same road twice which ...
SYAMSYIDA ROZI, CUT MULTAHADAH
doaj +1 more source
Open source environment to define constraints in route planning for GIS-T [PDF]
, 2004 Route planning for transportation systems is strongly related to shortest path algorithms, an optimization problem extensively studied in the literature.
Pérez Vidal, Lluís +1 more
core +1 more source
The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective
, 2017 In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu.
Guillot, Matthieu, Stauffer, Gautier
core +2 more sources
Study on k-shortest paths with behavioral impedance domain from the intermodal public transportation system perspective [PDF]
, 2003 Behavioral impedance domain consists of a theory on route planning for pedestrians, within which constraint management is considered. The goal of this paper is to present the k-shortest path model using the behavioral impedance approach.
Lozada, Eleazar G. Madrid +2 more
core +1 more source
Near-Linear Query Complexity for Graph Inference
, 2015 How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let $G = (V,E)$ be an unweighted, connected graph of bounded degree.
Kannan, Sampath +2 more
core +1 more source
Exploring the brachistochrone (shortest-time) path in fire spread
Scientific Reports, 2022 The brachistochrone (shortest-time) curve is the path connecting two points that enables the shortest travel time. This work explores the “brachistochrone path” of fire spread connecting two points at the same altitude and with a fixed path length.
Peiyi Sun, Yanhui Liu, Xinyan Huang
doaj +1 more source
The origin-destination shortest path problem [PDF]
, 1993 Includes bibliographical references (p. 34-35).Supported by the Air Force. AFOR-88-0088 Supported by the National Science Foundation. DDM-8921835 Supported by UPS.Muralidharan S.
core
Frontiers in NeuroroboticsTo reduce transportation time, a discrete zeroing neural network (DZNN) method is proposed to solve the shortest path planning problem with a single starting point and a single target point.
Feifan Song +3 more
doaj +1 more source
MathematicsThe shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it often ...
Adrien Durand +3 more
doaj +1 more source
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
Jurnal Informatika, 2005 A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj