|
|
|
|
|
Keyju Lee and Junjae Chae
The vehicle routing problem (VRP) attempts to find optimal (minimum length) routes for a set of vehicles visiting a set of locations. Solving a VRP calls for a cost matrix between locations. The size of the matrix grows quadratically with an increasing n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dang-Viet-Anh Nguyen, Jérôme Szewczyk and Kanty Rabenorosoa
We propose a novel algorithm to determine the Euclidean shortest path (ESP) from a given point (source) to another point (destination) inside a tubular space. The method is based on the observation data of a virtual particle (VP) assumed to move along th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Na Zhao, Qian Liu, Ming Jing, Jie Li, Zhidan Zhao and Jian Wang
In research on complex networks, mining relatively important nodes is a challenging and practical work. However, little research has been done on mining relatively important nodes in complex networks, and the existing relatively important node mining alg...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hyung-Ju Cho
This paper considers k-farthest neighbor (kFN) join queries in spatial networks where the distance between two points is the length of the shortest path connecting them. Given a positive integer k, a set of query points Q, and a set of data points P, the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yaqian Chen, Jiangfeng She, Xingong Li, Shuhua Zhang and Junzhong Tan
Cost distance is one of the fundamental functions in geographical information systems (GISs). 3D cost distance function makes the analysis of movement in 3D frictions possible. In this paper, we propose an algorithm and efficient data structures to accur...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hung Vo-Trung
Pág. 25 - 32
Currently, the Internet has given people the opportunity to access to human knowledge quickly and conveniently through various channels such as Web pages, social networks, digital libraries, portals... However, with the process of exchanging and updating...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdelfattah Idri, Mariyem Oukarfi, Azedine Boulmakoul, Karine Zeitouni, Ali Masri
Pág. 294 - 300
In this paper we introduce a search approach for shortest path algorithm in a parallel distributed architecture which is designed to handle the time-dependency for multimodal transportation network. Our proposed algorithm relies on its effective target-o...
ver más
|
|
|
|
|
|