Results 81 to 90 of about 10,050 (224)
This study proposes a multi‐stage optimal allocation method for newly added electric vehicle (EV) charging stations, integrating probabilistic user behaviour analysis, fuzzy‐based service performance evaluation, and economic optimisation. Simulation results demonstrate that the proposed approach effectively balances service performance and investment ...
Yufei Wang +5 more
wiley +1 more source
Implementasi Algortima Floyd-Warshall Untuk Menentukan Jarak Terdekat Pada Rute Trans Musi Palembang [PDF]
Trans musi is public transportation in the city of Palembang . Along the corridor there are shelters dismissal . The more stops dismissal of the passengers or potential passengers would find it difficult to determine the shortest distance between stops .
Kriswanto, Y. Rudi
core
An Floyd-Warshall Evolution Relations Algorithm Based on Social Networks Key Groups
Abstract With the development of the society, people increasingly frequent application in social network, the formation of social networking groups become important step in people’s life. How to analyze the evolution of social network group relations become very important.
Zhan Gao +5 more
openaire +1 more source
Optimizing Traffic Routes With Enhanced Double Q‐Learning
This paper presents a novel approach to optimizing urban traffic routes using reinforcement learning techniques. By leveraging advanced algorithms and simulation models, the study demonstrates how machine learning can improve traffic flow and reduce congestion in high‐density urban areas. The results show the potential for scalable solutions to enhance
Mayur Patil +2 more
wiley +1 more source
Tuning block-parallel all-pairs shortest path algorithm for efficient multi-core implementation
Finding shortest paths in a weighted graph is one of the key problems in computer-science, which has numerous practical applications in multiple domains.
O. N. Karasik, A. A. Prihozhy
doaj +1 more source
FLOYD–WARSHALL ALGORITHM FOR SHORTEST ROUTE CALCULATION BETWEEN LATVIA'S CITIES
The Floyd–Warshall algorithm is a good choice for computing paths between all pairs of vertices indense graphs, in which most or all pairs of vertices are connected by edges. For sparse graphs with non-negative edgeweights, a better choice is to use Dijkstra's algorithm from each possible starting vertex.
Gavars, Raivis +3 more
openaire +3 more sources
This paper addresses the problem of a 500‐kV main grid partition planning by proposing a partition method based on complex network theory and an improved multi‐objective cuckoo search optimisation (MOCSO) algorithm to achieve grid optimal partition and the generation of key channel set.
Xun Lu, Xianfu Gong, Peng Wang
wiley +1 more source
City transportation is a motorized vehicle with a fixed line that connects one area to another in one city. Information about the city transportation route in Semarang has been provided by the Department of Transportation of Semarang city which contains ...
A. Khamami, R. Saputra
semanticscholar +1 more source
An iterated greedy algorithm with variable reconstruction size for the obnoxious p‐median problem
Abstract The obnoxious p$p$‐median problem is a facility location problem where we maximise the sum of the distances between each client point and its nearest facility. Since it is nondeterministic polynomial‐time (NP)‐hard, most algorithms designed for the problem follow metaheuristic strategies to find high‐quality solutions in affordable time but ...
Seyed Mousavi +2 more
wiley +1 more source
A Selection of Bandung City Travel Route Using The FLOYD-WARSHALL Algorithm
The rapid development of information and technology, the city of Bandung tourism has also increased. However, tourists who visit the city of Bandung have problems with a limited time when visiting Bandung tourist attractions. Traffic congestion, distance, and the number of tourist destinations are the problems for tourists travel.
Muhammad Ghifari Arfananda +2 more
openaire +1 more source

