VehiCaching: Embracing User Request on Vehicle Route with Proactive Data Transportation

Author(s):  
Wonkwang Shin ◽  
Byoung-Yoon Min ◽  
Dong Ku Kim
Keyword(s):  
2020 ◽  
Vol 17 (5) ◽  
pp. 243-265 ◽  
Author(s):  
Jiandong Xie ◽  
Sa Xiao ◽  
Ying-Chang Liang ◽  
Li Wang ◽  
Jun Fang

2020 ◽  
Author(s):  
Kailang Chen ◽  
Hanyu Zhang ◽  
Xin Huang ◽  
Long Chen ◽  
Qi Shi

Author(s):  
Sami Demiroluk ◽  
Hani Nassif ◽  
Kaan Ozbay ◽  
Chaekuk Na

The roadway infrastructure constantly deteriorates because of environmental conditions, but other factors such as exposure to heavy trucks exacerbates the rate of deterioration. Therefore, decision-makers are constantly searching for ways to optimize allocation of the limited funds for repair, maintenance, and rehabilitation of New Jersey’s infrastructure. New Jersey legislation requires operators of overweight (OW) trucks to obtain a permit to use the infrastructure. The New Jersey Department of Transportation (NJDOT) issues a variety of permits based on the types of goods carried. These permits allow OW trucks to use the infrastructure either for a single trip or for multiple trips. Therefore, one major concern is whether the permit revenue of the agency can recoup the actual cost of damage to the infrastructure caused by these OW trucks. This study investigates whether NJDOT’s current permit fee program can collect enough revenue to meet the actual cost of damage to the infrastructure caused by these heavy-weight permit trucks. The infrastructure damage is estimated by using pavement and bridge deterioration models and New Jersey permit data from 2013 to 2018 containing vehicle configuration and vehicle route. The analysis indicates that although the cost of infrastructure damage can be recovered for certain permit types, there is room for improvement in the permit program. Moreover, based on permit rules in other states, the overall rank of the New Jersey permit program is evaluated and possible revisions are recommended for future permit policies.


2020 ◽  
Vol 26 (3) ◽  
pp. 169-183
Author(s):  
Phudit Ampririt ◽  
Yi Liu ◽  
Makoto Ikeda ◽  
Keita Matsuo ◽  
Leonard Barolli ◽  
...  

The Fifth Generation (5G) networks are expected to be flexible to satisfy demands of high-quality services such as high speed, low latencies and enhanced reliability from customers. Also, the rapidly increasing amount of user devices and high user’s requests becomes a problem. Thus, the Software-Defined Network (SDN) will be the key function for efficient management and control. To deal with these problems, we propose a Fuzzy-based SDN approach. This paper presents and compares two Fuzzy-based Systems for Admission Control (FBSAC) in 5G wireless networks: FBSAC1 and FBSAC2. The FBSAC1 considers for admission control decision three parameters: Grade of Service (GS), User Request Delay Time (URDT) and Network Slice Size (NSS). In FBSAC2, we consider as an additional parameter the Slice Priority (SP). So, FBSAC2 has four input parameters. The simulation results show that the FBSAC2 is more complex than FBSAC1, but it has a better performance for admission control.


Author(s):  
KIAM TIAN SEOW ◽  
MICHEL PASQUIER

This paper proposes a new logical framework for vehicle route-sequence planning of passenger travel requests. Each request is a fetch-and-send service task associated with two request-locations, namely, a source and a destination. The proposed framework is developed using propositional linear time temporal logic of Manna and Pnueli. The novelty lies in the use of the formal language for both the specification and theorem-proving analysis of precedence constraints among the location visits that are inherent in route sequences. In the framework, legal route sequences—each of which visits every request location once and only once in the precedence order of fetch-and-send associated with every such request—is formalized and justified, forming a basis upon which the link between a basic precedence constraint and the corresponding canonical forbidden-state formula is formally established. Over a given base route plan, a simple procedure to generate a feasible subplan based on a specification of the forbidden-state canonical form is also given. An example demonstrates how temporal logic analysis and the proposed procedure can be applied to select a final (feasible) subplan based on additional precedence constraints.


1999 ◽  
Author(s):  
Nigel Clark ◽  
James J. Daley ◽  
Ralph D. Nine ◽  
Christopher M. Atkinson
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document