Results 91 to 100 of about 4,841 (225)

The shortest-path and bee colony optimization algorithms for traffic control at single intersection with NetworkX application

Demonstratio Mathematica
In this article, we study the application of NetworkX, a Python library for dealing with traffic networks, to the problem of signal optimization at a single intersection.
Jovanović Aleksandar, Uzelac Ana, Kukić Katarina, Teodorović Dušan   +3 more
doaj   +1 more source

Node Detection and Tracking in Smart Cities Based on Internet of Things and Machine Learning

UHD Journal of Science and Technology, 2019
It is essential to know that using technologies in a good manner will facilitate human live. Internet of Things (IoT) used widely due to developments in information and verbal exchange technologies.
Ramyar A. Teimoor, Aso M. Darwesh
doaj   +1 more source

Smart selective navigator (SSN): enhancing urban winter road maintenance through optimized arc routing with hard turn restrictions

International Transactions in Operational Research, Volume 33, Issue 5, Page 3580-3597, September 2026.
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

Integrated routing of heavy electrical and diesel trucks in forest transports

International Transactions in Operational Research, Volume 33, Issue 5, Page 3088-3109, September 2026.
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, Patrik Flisberg, Anna Pernestål, Lovisa Engberg Sundström, Oskar Gustavsson   +4 more
wiley   +1 more source

Algorithms for Searching the Shortest Path and Its Modification

Цифровая трансформация, 2016
The article presents an overview of the main trends and methods of searching the shortest path information transmission in the telecommunications networks. The basic algorithms and their modifications are described.
N. I. Listopad, I. A. Karuk, A. A. Hayder   +2 more
doaj   +2 more sources

Heuristic estimates in shortest path algorithms [PDF]

Shortest path problems occupy an important position in Operations Research aswell as in Arti¯cial Intelligence. In this paper we study shortest path algorithms thatexploit heuristic estimates. The well-known algorithms are put into one framework.Besides
Pijls, W.H.L.M.
core   +1 more source

Some Recent Advances in Network Flows [PDF]

, 1989
The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems.
Ahuja, Ravindra K., 1956-, Magnanti, Thomas L., Orlin, James B., 1953-   +2 more
core   +1 more source

Assessing Post‐Earthquake Emergency Healthcare Accessibility Considering Damage to Hospital Buildings and Transportation Infrastructure

Earthquake Spectra, Volume 42, Issue 2, May 2026.
This article presents a framework for performing a regional assessment of the accessibility of emergency healthcare facilities after a major earthquake. Accessibility is assessed by applying the enhanced two‐step floating catchment area method to a regional road network, implemented in ArcGIS.
Kiranjot Kaur, Carlos Molina Hutt, Amy M. Kim   +2 more
wiley   +1 more source

PENCARIAN LINTASAN TERPENDEK DENGAN ALGORITME DIJKSTRA DAN MINIMUM SPANNING TREE DENGAN ALGORITME SOLLIN TERHADAP PERJALANAN WISATA SEJARAH DI KABUPATEN SUMENEP

E-Jurnal Matematika
A graph is a diagram that contains specific information.  One concept in graphs that can solve real-life problems is the concept of trees, which consists of various types of trees used to solve problems in life, such as finding the minimum path using the
LIKA HANIFA, LUH PUTU IDA HARINI, G.K. GANDHIADI   +2 more
doaj   +1 more source

Self-stabilizing mutual exclusion on a ring, even if K=N

, 1999
We show that, contrary to common belief, Dijkstra's self-stabilizing mutual exclusion algorithm on a ring [Dij74,Dij82] also stabilizes when the number of states per node is one less than the number of nodes on the ring.Comment: 2 ...
Hoepman, Jaap-Henk
core   +2 more sources