Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory

Go slow to go fast: minimal on-road time route scheduling with parking facilities using... For thousands of years, people have been innovating new technologies to make their travel faster, the latest of which is GPS technology that is used by millions of drivers every day. The routes recommended by a GPS device are computed by path planning algorithms (e.g., fastest path algorithm), which aim to minimize a certain objective function (e.g., travel time) under the current traffic condition. When the objective is to arrive the destination as early as possible, waiting during travel is not an option as it will only increase the total travel time due to the First-In-First-Out property of most road networks. However, some businesses such as logistics companies are more interested in optimizing the actual on-road time of their vehicles (i.e., while the engine is running) since it is directly related to the operational cost. At the same time, the drivers’ trajectories, which can reveal the traffic conditions on the roads, are also collected by various service providers. Compared to the existing speed profile generation methods, which mainly rely on traffic monitor systems, the trajectory-based method can cover a much larger space and is much cheaper and flexible to obtain. This paper proposes a system, which has an online component and an offline component, to solve the minimal on-road time problem using the trajectories. The online query answering component studies how parking facilities along the route can be leveraged to avoid predicted traffic jam and eventually reduce the drivers’ on-road time, while the offline component solves how to generate speed profiles of a road network from historical trajectories. The challenging part of the routing problem of the online component lies in the computational complexity when determining if it is beneficial to wait on specific parking places and the time of waiting to maximize the benefit. To cope with this challenging problem, we propose two efficient algorithms using minimum on-road travel cost function to answer the query. We further introduce several approximation methods to speed up the query answering, with an error bound guaranteed. The offline speed profile generation component makes use of historical trajectories to provide the traveling time for the online component. Extensive experiments show that our method is more efficient and accurate than baseline approaches extended from the existing path planning algorithms, and our speed profile is accurate and space efficient. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory

Li, Lei; Zheng, Kai; Wang, Sibo; Hua, Wen; Zhou, Xiaofang
The VLDB Journal , Volume 27 (3) – Mar 21, 2018
Download PDF
25 pages

Loading next page...
 
/lp/springer_journal/go-slow-to-go-fast-minimal-on-road-time-route-scheduling-with-parking-0YhscB8A0M

References (64)

Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer-Verlag GmbH Germany, part of Springer Nature
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
DOI
10.1007/s00778-018-0499-4
Publisher site
See Article on Publisher Site

Abstract

For thousands of years, people have been innovating new technologies to make their travel faster, the latest of which is GPS technology that is used by millions of drivers every day. The routes recommended by a GPS device are computed by path planning algorithms (e.g., fastest path algorithm), which aim to minimize a certain objective function (e.g., travel time) under the current traffic condition. When the objective is to arrive the destination as early as possible, waiting during travel is not an option as it will only increase the total travel time due to the First-In-First-Out property of most road networks. However, some businesses such as logistics companies are more interested in optimizing the actual on-road time of their vehicles (i.e., while the engine is running) since it is directly related to the operational cost. At the same time, the drivers’ trajectories, which can reveal the traffic conditions on the roads, are also collected by various service providers. Compared to the existing speed profile generation methods, which mainly rely on traffic monitor systems, the trajectory-based method can cover a much larger space and is much cheaper and flexible to obtain. This paper proposes a system, which has an online component and an offline component, to solve the minimal on-road time problem using the trajectories. The online query answering component studies how parking facilities along the route can be leveraged to avoid predicted traffic jam and eventually reduce the drivers’ on-road time, while the offline component solves how to generate speed profiles of a road network from historical trajectories. The challenging part of the routing problem of the online component lies in the computational complexity when determining if it is beneficial to wait on specific parking places and the time of waiting to maximize the benefit. To cope with this challenging problem, we propose two efficient algorithms using minimum on-road travel cost function to answer the query. We further introduce several approximation methods to speed up the query answering, with an error bound guaranteed. The offline speed profile generation component makes use of historical trajectories to provide the traveling time for the online component. Extensive experiments show that our method is more efficient and accurate than baseline approaches extended from the existing path planning algorithms, and our speed profile is accurate and space efficient.

Journal

The VLDB Journal – Springer Journals

Published: Mar 21, 2018

There are no references for this article.