scholarly journals Automatic Toll Collection System and Detection of Theft Vehicle by using RFID

2020 ◽  
pp. 24-27
Author(s):  
Mohammed Ovaiz A ◽  
Pradeep Katta ◽  
Senthil Kumar R ◽  
Hariharan R ◽  
Thanigaivel T ◽  
...  
Keyword(s):  
Road Network ◽  
Major Part ◽  
Road Networks ◽  
Road Transportation ◽  
Collection System ◽  
The Road ◽  
Toll Plazas ◽  
Toll Collection ◽  
Automated Registration ◽  
Day By Day

The road transportation in India has growing day by day. The Indian road network carries about 65 percent of its Goods and about 85 percent of passengers. The national highways in India are now increased from 44,076 miles to 88,313 miles in 2018 to 2019. Along these road networks there are about 450 toll plazas totally in India. These toll plazas contribute some major part of India’s economy, it is estimated the toll revenue can swell up to 1 lakh crore rupees in next five years. In spite of this enormous growth the toll plazas have huge traffic during peak most of the time which incurs delay and loss human hours to surpass the toll. The proposed system focuses on an automatic toll collection system which will automatically debit the amount from vehicle owner’s bank. The automated registration and collection are based on using the RFID chip which is amalgamated in the vehicle’s windshield. By this method, the information about registration ID of the vehicle can be obtained therefore stolen vehicle can also be detected by this system as the vehicle ID is linked to the user’s account. Thus, this system provides fast and efficient surpassing of toll plazas without any delay.

A Study on Job Satisfaction among Tamil Nadu State Transport Corporation (TNSTC) Employees at Tiruvarur Branch

GIS Business ◽  
2019 ◽  
Vol 14 (6) ◽  
pp. 230-242
Author(s):  
M. Ganesan, K ◽  
K. Veerakumar ◽  
N. R Vembu ◽  
Dr. M. K Durgamani ◽  
Dr. Renuka
Keyword(s):  
Job Satisfaction ◽  
Job Stress ◽  
Tamil Nadu ◽  
Heavy Traffic ◽  
Road Transportation ◽  
The Road ◽  
Tamil Nadu State ◽  
On The Road ◽  
Day By Day ◽  
Labour Turnover

Job satisfaction is an important factor for employees working in formal and informal sector. The job is small or big, permanent or temporary, risky or non-risky, job satisfaction is important. It is the mental feeling which drives the employees to excel. Job satisfaction is a combination of psychological, physiological and environmental circumstances. A satisfied employee is a contented and happy human being. The labour turnover depends upon job satisfaction. Even highly paid employees quit the job when they are not satisfied with the job. Road transportation in Tamilnadu is growing day by day. Job stress in the road transportation is very high due to increase in number of vehicle playing on the road and heavy traffic. The drivers and conductors working in public transport corporation are suffering from high job stress. If drivers and conductors are not satisfied with their job which leads to mental stresses and affects the productivity and also creates accidents. In this present study the researchers made an attempt to study the level of job satisfaction among the drivers and conductors who are working in the Tamilnadu State Transport Corporation (TNSTC). The study reveals the expectations of drivers and conductors working in TNSTC with regards to the attributes like salary, promotion and fringe benefits etc., are satisfactory and not detrimental. 

scholarly journals Modeling of Emergency Supply Scheduling Problem Based on Reliability and Its Solution Algorithm under Variable Road Network after Sudden-Onset Disasters

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-15 ◽  
Author(s):  
Tinggui Chen ◽  
Shiwen Wu ◽  
Jianjun Yang ◽  
Guodong Cong ◽  
Gongfa Li
Keyword(s):  
Road Network ◽  
Road Networks ◽  
Sudden Onset ◽  
The Road ◽  
Bee Colony ◽  
Proposed Model ◽  
Effectiveness And Efficiency ◽  
In Transit ◽  
Emergency Supply

It is common that many roads in disaster areas are damaged and obstructed after sudden-onset disasters. The phenomenon often comes with escalated traffic deterioration that raises the time and cost of emergency supply scheduling. Fortunately, repairing road network will shorten the time of in-transit distribution. In this paper, according to the characteristics of emergency supplies distribution, an emergency supply scheduling model based on multiple warehouses and stricken locations is constructed to deal with the failure of part of road networks in the early postdisaster phase. The detailed process is as follows. When part of the road networks fail, we firstly determine whether to repair the damaged road networks, and then a model of reliable emergency supply scheduling based on bi-level programming is proposed. Subsequently, an improved artificial bee colony algorithm is presented to solve the problem mentioned above. Finally, through a case study, the effectiveness and efficiency of the proposed model and algorithm are verified.

scholarly journals A Parallel-Computing Approach for Vector Road-Network Matching Using GPU Architecture

2018 ◽  
Vol 7 (12) ◽  
pp. 472 ◽  
Author(s):  
Bo Wan ◽  
Lin Yang ◽  
Shunping Zhou ◽  
Run Wang ◽  
Dezhi Wang ◽  
...  
Keyword(s):  
Road Network ◽  
Large Scale ◽  
Graphics Processing Unit ◽  
Road Networks ◽  
Processing Unit ◽  
Data Partition ◽  
Matching Method ◽  
The Road ◽  
Central Processing ◽  
Relaxation Matching

The road-network matching method is an effective tool for map integration, fusion, and update. Due to the complexity of road networks in the real world, matching methods often contain a series of complicated processes to identify homonymous roads and deal with their intricate relationship. However, traditional road-network matching algorithms, which are mainly central processing unit (CPU)-based approaches, may have performance bottleneck problems when facing big data. We developed a particle-swarm optimization (PSO)-based parallel road-network matching method on graphics-processing unit (GPU). Based on the characteristics of the two main stages (similarity computation and matching-relationship identification), data-partition and task-partition strategies were utilized, respectively, to fully use GPU threads. Experiments were conducted on datasets with 14 different scales. Results indicate that the parallel PSO-based matching algorithm (PSOM) could correctly identify most matching relationships with an average accuracy of 84.44%, which was at the same level as the accuracy of a benchmark—the probability-relaxation-matching (PRM) method. The PSOM approach significantly reduced the road-network matching time in dealing with large amounts of data in comparison with the PRM method. This paper provides a common parallel algorithm framework for road-network matching algorithms and contributes to integration and update of large-scale road-networks.

scholarly journals Road Networks Winter Risk Estimation Using On-Board Uncooled Infrared Camera for Surface Temperature Measurements over Two Lanes

2011 ◽  
Vol 2011 ◽  
pp. 1-8 ◽  
Author(s):  
M. Marchetti ◽  
M. Moutton ◽  
S. Ludwig ◽  
L. Ibos ◽  
V. Feuillet ◽  
...  
Keyword(s):  
Data Analysis ◽  
Road Network ◽  
Risk Estimation ◽  
Risk Index ◽  
Road Networks ◽  
Infrared Camera ◽  
Atmospheric Parameters ◽  
The Road ◽  
Measurement Rate

Thermal mapping has been implemented since the late eighties to establish the susceptibility of road networks to ice occurrence with measurements from a radiometer and some atmospheric parameters. They are usually done before dawn during wintertime when the road energy is dissipated. The objective of this study was to establish if an infrared camera could improve the determination of ice road susceptibility, to build a new winter risk index, to improve the measurements rate, and to analyze its consistency with seasons and infrastructures environment. Data analysis obtained from the conventional approved radiometer sensing technique and the infrared camera has shown great similarities. A comparison was made with promising perspectives. The measurement rate to analyse a given road network could be increased by a factor two.

scholarly journals Impact of Road Network Topology on Public Transportation Development

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Minzhi Chen ◽  
Fan Wu ◽  
Min Yin ◽  
Jiangang Xu
Keyword(s):  
Public Transportation ◽  
Road Network ◽  
Road Networks ◽  
Urban Road Network ◽  
Urban Road ◽  
The Road ◽  
Layout Structure ◽  
Per Capita ◽  
Transportation Development ◽  
The Impact

Planning of road networks is fundamental for public transportation. The impact of road network density on public transportation has been extensively studied, but few studies in this regard involved evaluation indicators for connectivity and layout of road networks. With 29 cities in China as the study cases, this paper quantifies the layout structure of the road network based on the network’s betweenness centralization and establishes a multivariate linear regression model to perform regression of the logarithm of the frequency of per capita public transportation on betweenness centralization. It is found in the present work that there is a significant correlation between the layout structure of an urban road network and the residents’ utilization degree of public transportation. A greater betweenness centralization of the urban road network, namely a more centralized road network, means a higher frequency of per capita public transportation of urban residents and a higher degree of the residents’ utilization of public transportation. In the development of public transportation, centralized and axial-shaped layout structures of road networks can be promoted to improve the utilization of public transportation.

scholarly journals Analysis of Traffic Evolution on Road Networks of a Roundabout

2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Tolesa Hundesa Muleta ◽  
Legesse Lemecha Obsu
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Road Networks ◽  
Point Of View ◽  
Traffic Dynamics ◽  
Demand And Supply ◽  
The Road ◽  
On The Road ◽  
Detailed Mathematical Analysis ◽  
Control Traffic

In this paper, the analyses of traffic evolution on the road network of a roundabout having three entrances and three exiting legs are conducted from macroscopic point of view. The road networks of roundabouts are modeled as a merging and diverging types 1×2 and 2×1 junctions. To study traffic evolution at junction, two cases have been considered, namely, demand and supply limited cases. In each case, detailed mathematical analysis and numerical tests have been presented. The analysis in the case of demand limited showed that rarefaction wave fills the portion of the road network in time. In the contrary, in supply limited case, traffic congestion occurs at merging junctions and shock wave propagating back results in reducing the performance of a roundabout to control traffic dynamics. Also, we illustrate density and flux profiles versus space discretization at different time steps via numerical simulation with the help of Godunov scheme.

scholarly journals A Privacy-Preserving Location-Based System for Continuous Spatial Queries

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Doohee Song ◽  
Kwangjin Park
Keyword(s):  
Road Network ◽  
Road Networks ◽  
Nearest Neighbors ◽  
Privacy Preserving ◽  
Spatial Queries ◽  
The Road ◽  
Mobile Clients ◽  
Previous Location

K-anonymization generated a cloaked region (CR) that was K-anonymous; that is, the query issuer was indistinguishable from K-1 other users (nearest neighbors) within the CR. This reduced the probability of the query issuer’s location being exposed to untrusted parties (1/K). However, location cloaking is vulnerable to query tracking attacks, wherein the adversary can infer the query issuer by comparing the two regions in continuous LBS queries. This paper proposes a novel location cloaking method to resist this attack. The target systems of the proposed method are road networks where the mobile clients’ trajectories are fixed (the road network is preknown and fixed, instead of the trajectories), such as subways, railways, and highways. The proposed method, called adaptive-fixed K-anonymization (A-KF), takes this issue into account and generates smaller CRs without compromising the privacy of the query issuer’s location. Our results show that the proposed A-KF method outperforms previous location cloaking methods.

scholarly journals Continuous Anonymity with Users in the Same Direction in Road Networks

2018 ◽  
Vol 220 ◽  
pp. 10001
Author(s):  
Yu Lili ◽  
Zhang Lei ◽  
Su Xiaoguang ◽  
Li Jing ◽  
Zhang Xu ◽  
...  
Keyword(s):  
Euclidean Space ◽  
Privacy Protection ◽  
Road Network ◽  
Location Privacy ◽  
Road Networks ◽  
The Road ◽  
Shortest Distance ◽  
Location Privacy Protection ◽  
Road Segments

Compared with the Euclidean space, road network is restricted by its direction in traveling, velocity and some other attribute profiles. So the algorithms that designed for the Euclidean space are usually invalid and difficult to provide privacy protection services. In order to cope with this problem, we have proposed an algorithm to provide the service of collecting anonymous users that their directions in traveling similar with the initiator in the road networks. In this algorithm, the shortest distance between multiple road segments is calculated, and then utilizes the distance to select the user who has the same direction in traveling with the initiator. Consequently, the problem of the discrepancy of the anonymous users in the routing that invalidates the location privacy protection is solved. At last, we had compared this algorithm with other similar algorithms, and through the results of the comparison and the cause of this phenomenon, we have concluded that this algorithm is better not only in the level of privacy protection, but in the performance of execution efficiency.

scholarly journals Avaliação da influência do tipo de cobrança e da composição do tráfego sobre o desempenho operacional de praças de pedágio

TRANSPORTES ◽  
2010 ◽  
Vol 18 (3) ◽  
Author(s):  
Marta Rodrigues Obelheiro ◽  
Marcelo Leismann de Oliveira ◽  
Helena Beatriz Bettella Cybis
Keyword(s):  
Rio Grande ◽  
The State ◽  
Rio Grande Do Sul ◽  
Collection System ◽  
Electronic Toll Collection ◽  
Toll Plazas ◽  
Service Times ◽  
Toll Collection ◽  
Toll Plaza ◽  
The Impact

<p><strong>Resumo: </strong>Este trabalho tem por objetivo avaliar o impacto da composição do tráfego e das condições de cobrança na capacidade de praças de pedágio. As variações das condições de cobrança de pedágio avaliadas neste estudo incluem reduções nos tempos de atendimento nas cabines manuais, bem como os impactos decorrentes da adoção, e crescente adesão, dos usuários à cobrança eletrônica de pedágio. As informações sobre tempos de atendimento utilizados no estudo correspondem a dados reais coletados em praças de pedágio do estado do Rio Grande do Sul. As análises foram realizadas a partir da simulação de uma praça de pedágio através do software de microssimulação VISSIM. Os resultados evidenciaram e quantificaram o aumento de capacidade das praças associado ao treinamento de arrecadadores e à adoção de tarifas que facilitam o troco. Neste estudo melhorias associadas a estas medidas corresponderam a um aumento de até 19% na capacidade da praça. Melhorias bem mais significativas de desempenho, entretanto, podem ser atingidas com o aumento da adesão dos usuários ao sistema de cobrança eletrônica de pedágio.</p><p><strong>Abstract: </strong>This study aims to assess the impact of the composition of traffic and charging conditions on the capacity of toll plazas. The toll charging conditions evaluated in this study include the reductions in service times at manual toll booths, the introduction of electronic toll collection and the increase in electronic collection compliance rates. Service times adopted in this study correspond to data collected at toll plazas of the state of Rio Grande do Sul. Analyses presented in this paper are based on toll plaza simulations through the microsimulation software VISSIM. The simulation outcomes evidenced and quantified the capacity increase associated with collectors training and the adoption of fares that simplified the change. In this study, improvements associated with these measures corresponded to an increase of up to 19% of the plaza capacity. More significant improvements in performance, however, can be achieved by increasing the compliance of the electronic toll collection system.</p>

scholarly journals Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies

Algorithms ◽  
2019 ◽  
Vol 12 (9) ◽  
pp. 196
Author(s):  
Lars Gottesbüren ◽  
Michael Hamann ◽  
Tim Niklas Uhl ◽  
Dorothea Wagner
Keyword(s):  
Shared Memory ◽  
Graph Partitioning ◽  
Road Network ◽  
Road Networks ◽  
Geographical Information ◽  
Nested Dissection ◽  
High Quality ◽  
The Road ◽  
Inertial Flow ◽  
Path Queries

Graph partitioning has many applications. We consider the acceleration of shortest path queries in road networks using Customizable Contraction Hierarchies (CCH). It is based on computing a nested dissection order by recursively dividing the road network into parts. Recently, with FlowCutter and Inertial Flow, two flow-based graph bipartitioning algorithms have been proposed for road networks. While FlowCutter achieves high-quality results and thus fast query times, it is rather slow. Inertial Flow is particularly fast due to the use of geographical information while still achieving decent query times. We combine the techniques of both algorithms to achieve more than six times faster preprocessing times than FlowCutter and even faster queries on the Europe road network. We show that, using 16 cores of a shared-memory machine, this preprocessing needs four minutes.

Sign in / Sign up

Export Citation Format

Share Document