Author: Chu, Yiu Chung
Title: Prediction of noise generated from road traffic in urban environment using neural networks
Advisors: Tang, S. K. (BSE)
Degree: M.Phil.
Year: 2014
Subject: Traffic noise.
Noise control.
Hong Kong Polytechnic University -- Dissertations
Department: Department of Building Services Engineering
Pages: xiii, 109 leaves : illustrations ; 30 cm
Language: English
Abstract: Noise pollution casts a serious threat to human health in modern society, and traffic noise is one of the major contributors to urban noise. By monitoring and predicting the traffic noise level in our environment, we can ensure that citizens are not subject to unhealthy noise hazards when building roads or performing urban planning. Traffic noise prediction provides information about the unknown noise levels due to a new establishment. In this study, the performances of prediction methods on traffic noise level are analyzed. Traditionally, the Calculation of Road Traffic Noise (CRTN) method is used for predicting traffic noises. However, a new artificial intelligent method using artificial neural networks (ANN) is used in this study. The purpose of this investigation is to study the use of neural networks in the traffic noise prediction by investigating what would be the best network configuration for the prediction of road traffic noise, and by comparing the predictions from the traditional CRTN method and neural network method. A sensitivity analysis of using neural network on the prediction of traffic noise is also performed. With ANN, input parameters are used to predict the output. In this study, traffic flow parameters are used as inputs to predict traffic noise levels (as outputs). The performances of a number of commonly adopted net configurations in the prediction of traffic noise are tested. In this research, noise level data measured at various Hong Kong heavy road traffic sites are used. The 56 data sets used in this study are provided by Professor S.K. Tang of Department of Building Service Engineering of The Hong Kong Polytechnic University.
These data are pre-processed and part of them is used for the artificial neural network learning and testing. The predicted values are then compared with the measured noise data not involved in the network training to find the mean absolute percentage error (MAPE). These MAPEs are then used to determine the best net configuration, and then based on the best net configuration, a sensitivity analysis on the effect of input data on the ANN prediction is carried out. It is found that the best net configuration for L₁₀ and Leq is that with 1 hidden layer and 2 nodes using Radial Basis Function (RBF) activation net method and the best net configuration for L₅₀ and L₉₀ are that with 3 hidden layers and 2 nodes using the RBF activation net. For sensitive analysis, the more sensitive parameters for L₁₀, Leq, L₅₀ and L₉₀ are as follows. For L₁₀, they are receiver height [m], distance from kerb [m]; for Leq, the mean vehicle speed (kph) and percentage of heavy vehicles [%]; for L₅₀, the mean vehicle speed (kph), percentage of heavy vehicles [%], receiver height [m], distance from kerb [m] and traffic flow [Veh/hr]; and for L90, the traffic flow [Veh/hr], mean vehicle speed (kph), distance from kerb [m] and receiver height [m]. Another main purpose of this thesis is also to develop an optimized scheme to develop the best ANN configurations. It is by first find out the optimized number of layers, optimized number of nodes and the best activation functions then use ANN matrix to find the best ANN configurations.
Rights: All rights reserved
Access: open access

Files in This Item:
File Description SizeFormat 
b27804999.pdfFor All Users8.47 MBAdobe PDFView/Open

Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show full item record

Please use this identifier to cite or link to this item: