Analysis of Pavement Management Activities Programming by Genetic Algorithms

Author(s):  
T. F. Fwa ◽  
W. T. Chan ◽  
K. Z. Hoque

The application of genetic algorithms to programming of pavement maintenance activities at the network level is demonstrated. The operational characteristics of the genetic algorithm technique and its relevance to solving the programming problem in a Pavement Management System (PMS) are discussed. The robust search capability of genetic algorithms enables them to effectively handle the highly constrained problem of pavement management activities programming, which has an extremely large solution space of astronomical scale. Examples are presented to highlight the versatility of genetic algorithms in accommodating different objective function forms. This versatility makes the algorithms an effective tool for planning in PMS. It is also demonstrated that composite objective functions that combine two or more different objectives can be easily considered without having to reformulate the genetic algorithm computer program. Another useful feature of genetic algorithm solutions is the availability of near-optimal solutions besides the "best" solution. This has practical significance as it gives the users the flexibility to examine the suitability of each solution when practical constraints and factors not included in the optimization analysis are considered.

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Bing Li ◽  
Anxie Tuo ◽  
Hanyue Kong ◽  
Sujiao Liu ◽  
Jia Chen

This paper uses neural network as a predictive model and genetic algorithm as an online optimization algorithm to simulate the noise processing of Chinese-English parallel corpus. At the same time, according to the powerful random global search mechanism of genetic algorithm, this paper studied the principle and process of noise processing in Chinese-English parallel corpus. Aiming at the task of identifying isolated words for unspecified persons, taking into account the inadequacies of the algorithms in standard genetic algorithms and neural networks, this paper proposes a fast algorithm for training the network using genetic algorithms. Through simulation calculations, different characteristic parameters, the number of training samples, background noise, and whether a specific person affects the recognition result were analyzed and discussed and compared with the traditional dynamic time comparison method. This paper introduces the idea of reinforcement learning, uses different reward mechanisms to solve the inconsistency of loss function and evaluation index measurement methods, and uses different decoding methods to alleviate the problem of exposure bias. It uses various simple genetic operations and the survival of the fittest selection mechanism to guide the learning process and determine the direction of the search, and it can search multiple regions in the solution space at the same time. In addition, it also has the advantage of not being restricted by the restrictive conditions of the search space (such as differentiable, continuous, and unimodal). At the same time, a method of using English subword vectors to initialize the parameters of the translation model is given. The research results show that the neural network recognition method based on genetic algorithm which is given in this paper shows its ability of quickly learning network weights and it is superior to the standard in all aspects. The performance of the algorithm in genetic algorithm and neural network, with high recognition rate and unique application advantages, can achieve a win-win of time and efficiency.


Author(s):  
Xin Chen ◽  
Stuart Hudson ◽  
Masoud Pajoh ◽  
William Dickinson

A new pavement network optimization model based on the Markov decision process (MDP) is presented. The new model is a global optimization model in which the entire network can be optimized without being divided into mutually independent groups. Current MDP models in use for pavement management use only one routine maintenance model for all types of rehabilitation and reconstruction treatments. The new formulation provides separate routine maintenance models for each type of treatment, which is more realistic than the currently available formulations. Methods for estimating pavement maintenance and rehabilitation benefits are described. These methods can be used for the optimization models with objectives of maximization when inadequate data are available to consider road user costs. The model has been applied to the network-level pavement management system for the Oklahoma Department of Transportation. Results of example runs are discussed.


2022 ◽  
Vol 12 (1) ◽  
pp. 1-16
Author(s):  
Qazi Mudassar Ilyas ◽  
Muneer Ahmad ◽  
Sonia Rauf ◽  
Danish Irfan

Resource Description Framework (RDF) inherently supports data mergers from various resources into a single federated graph that can become very large even for an application of modest size. This results in severe performance degradation in the execution of RDF queries. As every RDF query essentially traverses a graph to find the output of the Query, an efficient path traversal reduces the execution time of RDF queries. Hence, query path optimization is required to reduce the execution time as well as the cost of a query. Query path optimization is an NP-hard problem that cannot be solved in polynomial time. Genetic algorithms have proven to be very useful in optimization problems. We propose a hybrid genetic algorithm for query path optimization. The proposed algorithm selects an initial population using iterative improvement thus reducing the initial solution space for the genetic algorithm. The proposed algorithm makes significant improvements in the overall performance. We show that the overall number of joins for complex queries is reduced considerably, resulting in reduced cost.


2013 ◽  
Vol 330 ◽  
pp. 1015-1019 ◽  
Author(s):  
Jyh Dong Lin ◽  
Wei Hsing Huang ◽  
Chia Tse Hung ◽  
Chien Ta Chen ◽  
Jih Chiang Lee

In recent years advancements in the Information Technology (IT), have enabled automation of pavement measurement data. A large amount of data can be saved for a pavement management system. The study of pavement maintenance and management has include many methods, such as expert system, decision support analysis and data mining (DM) . In this study we use decision tree for data mining algorithm C5.0 has been used in this analysis. After acceptance of the decision tree, we make use of algorithms and computing for classification. This method is used to check the pavement management system database and make a comparison of all data. The result shown a correct classification of about 61% its still improved space. According to this result we discuss three analysis results included: 1.Database information is correct or not 2.Road pavement never homogenization 3.Milling process never remove human factor. Finally useful pavement information and ways can improve system integrity and correctly.


2012 ◽  
Vol 616-618 ◽  
pp. 2064-2067
Author(s):  
Yong Gang Che ◽  
Chun Yu Xiao ◽  
Chao Hai Kang ◽  
Ying Ying Li ◽  
Li Ying Gong

To solve the primary problems in genetic algorithms, such as slow convergence speed, poor local searching capability and easy prematurity, the immune mechanism is introduced into the genetic algorithm, and thus population diversity is maintained better, and the phenomena of premature convergence and oscillation are reduced. In order to compensate the defects of immune genetic algorithm, the Hénon chaotic map, which is introduced on the above basis, makes the generated initial population uniformly distributed in the solution space, eventually, the defect of data redundancy is reduced and the quality of evolution is improved. The proposed chaotic immune genetic algorithm is used to optimize the complex functions, and there is an analysis compared with the genetic algorithm and the immune genetic algorithm, the feasibility and effectiveness of the proposed algorithm are proved from the perspective of simulation experiments.


2021 ◽  
Vol 13 (17) ◽  
pp. 9837
Author(s):  
Paola Di Mascio ◽  
Antonella Ragnoli ◽  
Silvia Portas ◽  
Marco Santoni

The conditions of airport movement-area pavements play a primary role on safety and regularity of airport operations; for this reason, the aerodrome operator needs to periodically survey their condition and provide their maintenance and rehabilitation in order to ensure the required operational characteristics. To meet these needs efficiently and effectively, the Airport Pavement-Management System (APMS) has proved to be a strategic tool to support decisions, aimed at defining a technically and economically sustainable management plan. This paper aims to investigate the theoretical elements and structure of the APMS; the appropriate methodologies to guarantee a constant updating of the system in all its aspects are presented, focusing on the specific case study of a medium-dimension Italian airport. The article describes the methods and the equipment used for the high-performance surveys and the condition indexes used for collecting and analyzing the data implemented to populate the APMS of Cagliari airport. Two major survey campaigns were carried out: the first in 2016 and the second in 2019. Both surveys were carried out using the same subdivision into sample units, following the ASTM D5340-12 criteria, to correctly compare data collected in different years. In order to sufficiently populate the APMS database, the measured and back-calculated data were stored and integrated using daily acquired pavement reports since 2009 and stored with the specific intention to develop customized decay curves for Cagliari Airport pavements. Preliminary results on the sustainable use of the APMS were reported even with data collected in a limited period and successfully applied to runway flexible pavement.


Author(s):  
Gulfam Jannat ◽  
Susan L. Tighe

In a pavement management system (PMS), time to maintenance is generally estimated based on the predicted condition of the pavement. Usually a deterministic approach is applied in the PMS to estimate the time to maintenance by following the deterioration equation of the performance index. However, it is necessary to be aware of the probability of failure to investigate whether the estimated time to maintenance by the deterministic approach is reasonably probable. For this reason, a probabilistic approach is applied in this study to estimate the probability of failure over the estimated time to maintenance. In this approach, the probability of failure is estimated from the distribution of the mean time to maintenance by considering both the overall condition of the pavement and individual instances of distress. These mean times to failure or maintenance are calculated from the overall condition of pavement in relation to the pavement condition index (PCI) when the trigger value becomes 65 or less. A pavement may be expected to fail, however, because of any specific distress before it reaches the PCI trigger value for maintenance. For this reason, the probability of failure of each specific distress is also investigated by using a Monte Carlo simulation. It is found that the survival probability up to the fifth year is approximately 80% to 90% for each category of traffic and material type based on the overall condition, and the probability of failure for individual distress is very low over the performance cycle.


2021 ◽  
Vol 13 (11) ◽  
pp. 5941
Author(s):  
Shabir Hussain Khahro ◽  
Zubair Ahmed Memon ◽  
Lillian Gungat ◽  
Muhamad Razuhanafi Mat Yazid ◽  
Abdur Rahim ◽  
...  

Governments face numerous challenges in sustaining road network conditions. This is attributed to road authorities’ shortages of financial and physical infrastructure. As a result, low-cost automated solutions are being pursued to solve these problems and provide people with appropriate road conditions. Several attempts have been made to improve these technologies and incorporate them into a Pavement Management System (PMS) but limited attempts are made for developing countries. This study aimed to design a low-cost pavement management system for flexible pavement maintenance. A detailed literature review has been carried out, followed by a qualitative assessment of the various indicators considered for PMS. The priority ranks of the PMS indicators were made using an Analytical Network Process (ANP) and each rank was validated by a sensitivity assessment test using the Super Decision-Making tool. This paper also provides the conceptual framework for the low-cost PMS, followed by a fishbone diagram of the indicators and sub-indicators. It is concluded that an emergency maintenance plan with an ANP weight of (0.41) is one of the most significant plans for a low-cost PMS, followed by a routine with an ANP weight of (0.39) and periodic maintenance plans with a (0.20) ANP weight. Moreover, the functional indicators with an ANP weight of (0.32) are the most significant indicators for a low-cost PMS, followed by structural (0.26), safety (0.24), and serviceability(0.18) indicators. This model will assist the road planners in making better decisions on pavement maintenance management plans. The model will suggest the pavement sections on a higher priority to be added in the maintenance plans, especially where the maintenance budget is limited.


Sign in / Sign up

Export Citation Format

Share Document