|
|
|
|
|
Juarez Machado da Silva, Gabriel de Oliveira Ramos and Jorge Luis Victória Barbosa
The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization of the SP is the Dynamic Shortest Path (DSP) problem, which also models changes in the graph at a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tamás Kegyes, Alex Kummer, Zoltán Süle and János Abonyi
We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line bal...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yinghui Meng, Qianying Zhi, Minghao Dong and Weiwei Zhang
The coordinates of nodes are very important in the application of wireless sensor networks (WSN). The range-free localization algorithm is the best method to obtain the coordinates of sensor nodes at present. Range-free localization algorithm can be divi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jeong-Seok Lee, Tae-Hoon Kim and Yong-Gil Park
The increase in maritime traffic and vessel size has strengthened the need for economical and safe maritime transportation networks. Currently, ship path planning is based on past experience and shortest route usage. However, the increasing complexity of...
ver más
|
|
|
|
|
|
|
|
|
|
|
Qiuling Tang and Wanfeng Dou
Calculating the least-cost path (LCP) is a fundamental operation in raster-based geographic information systems (GIS). The LCP is applied to raster cost surfaces, in which it determines the most cost-effective path. Increasing the raster resolution resul...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhenyu Tian, Jiali You and Linlin Hu
Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining a multicast group, a group member first sends a request to a designated router (DR). Then, the DR selects a node in the existing multi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Daeyoub Kim and Jihoon Lee
One of the most common approaches for enhancing network performance is to retrieve data from nearby data holders that have previously obtained the desired data, not only from the original data source itself. In this case, since a data receiver cannot ide...
ver más
|
|
|
|
|
|
|
|
|
|
|
Qingying Yu, Fan Hu, Chuanming Chen, Liping Sun and Xiaoyao Zheng
Numerous Global Positioning System connected vehicles are collecting extensive data remotely in cities, enabling data-driven infrastructure planning. To truly benefit from this emerging technology, it is important to combine telematics and map data to ma...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang and Yang Zhong
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd?Warsh...
ver más
|
|
|
|
|
|
|
|
|
|
|
Federico Mosquera, Pieter Smet and Greet Vanden Berghe
A direct way of reducing the number of cars on the road is to dissuade individuals from exclusively using their car and instead integrate public transport into their daily routine. Planning multi-modal journeys is a complex task for which individuals oft...
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
|
|
|
|
|
|
|
|
|
|
|
Pedro Maristany de las Casas, Ralf Borndörfer, Luitgard Kraus and Antonio Sedeño-Noda
The Dynamic Multiobjective Shortest Path problem features multidimensional costs that can depend on several variables and not only on time; this setting is motivated by flight planning applications and the routing of electric vehicles. We give an exact a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kunihiko Hiraishi
In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computational ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Spyros Kontogiannis, Andreas Paraskevopoulos and Christos Zaroliagis
We consider the problem of computing a set of meaningful alternative origin-to-destination routes, in real-world road network instances whose arcs are accompanied by travel-time functions rather than fixed costs. In this time-dependent alternative route ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christoph Hansknecht, Imke Joormann and Sebastian Stiller
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. With traffic data abundantly available, methods to optimize routes with res...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alejandro Murrieta-Mendoza, Charles Romain and Ruxandra Mihaela Botez
Aircrafts require a large amount of fuel in order to generate enough power to perform a flight. That consumption causes the emission of polluting particles such as carbon dioxide, which is implicated in global warming. This paper proposes an algorithm wh...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dennis Nii Ayeh Mensah, Hui Gao and Liang Wei Yang
Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall?s algorithms are limited to small networks due to computational complexity and cost. We propose an efficient and a more accurate approximation algorithm that is a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Duy Nguyen Duc, Thong Tran Huu and Narameth Nananukul
Due to the availability of Industry 4.0 technology, the application of big data analytics to automated systems is possible. The distribution of products between warehouses or within a warehouse is an area that can benefit from automation based on Industr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rhyd Lewis
In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mattia D?Emidio
Computing shortest-path distances is a fundamental primitive in the context of graph data mining, since this kind of information is essential in a broad range of prominent applications, which include social network analysis, data routing, web search opti...
ver más
|
|
|
|
|
|