|
|
|
Panagiotis Farmakis, Athanasios Chassiakos and Stylianos Karatzas
Hub-and-Spoke (H&S) network modeling is a form of transport topology optimization in which network joins are connected through intermediate hub nodes. The Short Sea Shipping (SSS) problem aims to efficiently disperse passenger flows involving multipl...
ver más
|
|
|
|
|
|
|
Claudio Bruno, Antonella Ingenito and Domenico Simone
A human Mars mission is more challenging to astronauts than the Apollo mission because of travel time, life support requirements, and the space environment. Although plans for Mars exploration by NASA and SpaceX based on conventional rockets have been pr...
ver más
|
|
|
|
|
|
|
Lina Wang, Xiang Li, Linfang Ding, Xinkai Yu and Tao Hu
Visualization of the spatial distribution pattern of transport accessibility and its changes can be crucial for understanding and assessing the performance of transportation systems. Compared to traditional maps representing geographic space, time cartog...
ver más
|
|
|
|
|
|
|
Xiao Zhou, Jiangpeng Tian and Mingzhan Su
This study designed a tour-route-planning and recommendation algorithm that was based on an improved AGNES spatial clustering and space-time deduction model. First, the improved AGNES tourist attraction spatial clustering algorithm was created. Based on ...
ver más
|
|
|
|
|
|
|
Junxin Huang, Yuchuan Luo, Ming Xu, Bowen Hu and Jian Long
Online ride-hailing (ORH) services allow people to enjoy on-demand transportation services through their mobile devices in a short responding time. Despite the great convenience, users need to submit their location information to the ORH service provider...
ver más
|
|
|
|
|
|
|
Mostafa Mo. Massoud, A. Abdellatif and Mostafa R. A. Atia
Omni-wheeled mobile robots (Omni WMRs) are commonly used in indoor navigation applications like surveillance, search and rescue, and autonomous transportation. They are always characterized by their versatility, mobility and high payload. This paper pres...
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
|
|
|
|
|
|
|
Ben Strasser, Dorothea Wagner and Tim Zeitz
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, for example, to avoid commuter traffic congestions. Existing techniques foll...
ver más
|
|
|
|
|
|
|
Sumit Mishra, Nikhil Singh and Devanjan Bhattacharya
Short distance travel and commute being inevitable, safe route planning in pandemics for micro-mobility, i.e., cycling and walking, is extremely important for the safety of oneself and others. Hence, we propose an application-based solution using COVID-1...
ver más
|
|
|
|
|
|
|
Litao Han, Huan Guo, Haisi Zhang, Qiaoli Kong, Aiguo Zhang and Cheng Gong
When the occupant density of buildings is large enough, evacuees are prone to congestion during emergency evacuation, which leads to the extension of the overall escape time. Especially for multi-exit buildings, it?s a challenging problem to afford an ef...
ver más
|
|
|
|