Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0968-090X(00)00023-1
Title: Constraint handling methods in pavement maintenance programming
Authors: Chan, W.T. 
Fwa, T.F. 
Zahidul Hoque, Kh.
Keywords: Constraints
Genetic algorithms
Optimisation
Pavement maintenance programming
Issue Date: Jun-2001
Source: Chan, W.T., Fwa, T.F., Zahidul Hoque, Kh. (2001-06). Constraint handling methods in pavement maintenance programming. Transportation Research Part C: Emerging Technologies 9 (3) : 175-190. ScholarBank@NUS Repository. https://doi.org/10.1016/S0968-090X(00)00023-1
Abstract: The problem of pavement maintenance management at the network level is one of maintaining as high a level of serviceability as possible for a pavement network system through reactive and proactive repair actions, whilst optimising the use of available resources. This problem has traditionally been solved using techniques like mathematical programming and heuristic methods. Lately, the use of genetic algorithms (GAs) to solve resource allocation problems like the network pavement maintenance problem has received increased attention from researchers. GAs have been demonstrated to be better than traditional techniques in terms of solution quality and diversity. However, the performance of the GAs is affected by the method used to handle the many constraints present in the formulation of such resource allocation methods. Penalty as well as generate and repair methods are the usual techniques used to handle constraints, but these have their drawbacks in terms of computational efficiency and tendency to get trapped in sub-optimal solution spaces. The paper proposes a third method that is computationally more efficient than the previous methods. The method is based on prioritised allocation of resources to maintenance activities and the maximum utilisation of resources. Constraints on maximum resources availability are no longer used passively to check on solution feasibility (as in the previous methods) but are used to help generate feasible solutions during the resource allocation phase of the algorithm itself. It is demonstrated that the GA with the prioritised resource allocation method (PRAM) outperforms the traditional GA with repair or penalty methods. PRAM was able to consistently outperform the other two GA based methods, both in terms of solution quality as well as computational time. It is concluded that PRAM can be used as the basis of more efficient resource allocation procedures in the area of pavement maintenance management. ©2001 Elsevier Science Ltd. All rights reserved.
Source Title: Transportation Research Part C: Emerging Technologies
URI: http://scholarbank.nus.edu.sg/handle/10635/65347
ISSN: 0968090X
DOI: 10.1016/S0968-090X(00)00023-1
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

16
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

9
checked on Nov 18, 2017

Page view(s)

39
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.