Time-Dependent Route Planning for Truck Drivers

Author(s):  
Alexander Kleff ◽  
Christian Bräuer ◽  
Frank Schulz ◽  
Valentin Buchhold ◽  
Moritz Baum ◽  
...  
Author(s):  
Radek Tomis ◽  
Jan Martinovič ◽  
Kateřina Slaninová ◽  
Lukáš Rapant ◽  
Ivo Vondrák

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Carlos T. Calafate ◽  
David Soler ◽  
Juan-Carlos Cano ◽  
Pietro Manzoni

Intelligent Transportation System (ITS) technologies can be implemented to reduce both fuel consumption and the associated emission of greenhouse gases. However, such systems require intelligent and effective route planning solutions to reduce travel time and promote stable traveling speeds. To achieve such goal these systems should account for both estimated and real-time traffic congestion states, but obtaining reliable traffic congestion estimations for all the streets/avenues in a city for the different times of the day, for every day in a year, is a complex task. Modeling such a tremendous amount of data can be time-consuming and, additionally, centralized computation of optimal routes based on such time-dependencies has very high data processing requirements. In this paper we approach this problem through a heuristic to considerably reduce the modeling effort while maintaining the benefits of time-dependent traffic congestion modeling. In particular, we propose grouping streets by taking into account real traces describing the daily traffic pattern. The effectiveness of this heuristic is assessed for the city of Valencia, Spain, and the results obtained show that it is possible to reduce the required number of daily traffic flow patterns by a factor of 4210 while maintaining the essence of time-dependent modeling requirements.


2021 ◽  
Vol 15 (5) ◽  
pp. 1-24
Author(s):  
Wensheng Gan ◽  
Jerry Chun-Wei Lin ◽  
Jiexiong Zhang ◽  
Hongzhi Yin ◽  
Philippe Fournier-Viger ◽  
...  

Knowledge extraction from database is the fundamental task in database and data mining community, which has been applied to a wide range of real-world applications and situations. Different from the support-based mining models, the utility-oriented mining framework integrates the utility theory to provide more informative and useful patterns. Time-dependent sequence data are commonly seen in real life. Sequence data have been widely utilized in many applications, such as analyzing sequential user behavior on the Web, influence maximization, route planning, and targeted marketing. Unfortunately, all the existing algorithms lose sight of the fact that the processed data not only contain rich features (e.g., occur quantity, risk, and profit), but also may be associated with multi-dimensional auxiliary information, e.g., transaction sequence can be associated with purchaser profile information. In this article, we first formulate the problem of utility mining across multi-dimensional sequences, and propose a novel framework named MDUS to extract <underline>M</underline>ulti-<underline>D</underline>imensional <underline>U</underline>tility-oriented <underline>S</underline>equential useful patterns. To the best of our knowledge, this is the first study that incorporates the time-dependent sequence-order, quantitative information, utility factor, and auxiliary dimension. Two algorithms respectively named MDUS EM and MDUS SD are presented to address the formulated problem. The former algorithm is based on database transformation, and the later one performs pattern joins and a searching method to identify desired patterns across multi-dimensional sequences. Extensive experiments are carried on six real-life datasets and one synthetic dataset to show that the proposed algorithms can effectively and efficiently discover the useful knowledge from multi-dimensional sequential databases. Moreover, the MDUS framework can provide better insight, and it is more adaptable to real-life situations than the current existing models.


2013 ◽  
Vol 64 (6) ◽  
pp. 26-29
Author(s):  
Pramod SinghRathore ◽  
Atul Chaudhary

Author(s):  
Takashi Hasuike ◽  
Hideki Katagiri ◽  
Hiroe Tsubaki ◽  
Hiroshi Tsuda

This paper proposes an interactive approach to obtain an appropriate sightseeing route for the tourist under various uncertain traffic and climate conditions including time-dependent parameters and ambiguous satisfaction values at sightseeing sites. Since the uncertain traffic and climate conditions include time-dependent conditions, Time Expanded Network (TEN) are proposed for each condition. Furthermore, interval numbers for ambiguous satisfaction values are proposed, and hence, the proposed model is formulated as a multiobjective interval programming problem with many constraints derived from network optimization. In order to transform the multiobjective into the single-objective, Minkowski's Lp-metric is introduced as a compromise approach. From the final formulation of our proposed model using the optimistic satisfactory for interval numbers, an interactive algorithm to obtain the appropriate sightseeing route communicating with the tourist is developed.


Sign in / Sign up

Export Citation Format

Share Document