Please use this identifier to cite or link to this item:
https://doi.org/10.1061/(ASCE)0733-947X(2000)126:5(367)
Title: | Multiobjective optimization for pavement maintenance programming | Authors: | Fwa, T.F. Chan, W.T. Hoque, K.Z. |
Issue Date: | Sep-2000 | Citation: | Fwa, T.F., Chan, W.T., Hoque, K.Z. (2000-09). Multiobjective optimization for pavement maintenance programming. Journal of Transportation Engineering 126 (5) : 367-374. ScholarBank@NUS Repository. https://doi.org/10.1061/(ASCE)0733-947X(2000)126:5(367) | Abstract: | Pavement maintenance planning and programming requires optimization analysis involving multiobjective considerations. Traditionally single-objective optimization techniques have been employed by pavement researchers and practitioners because of the complexity involved in multiobjective analysis. This paper develops a genetic-algorithm-based procedure for solving multiobjective network level pavement maintenance programming problems. The concepts of Pareto optimal solution set and rank-based fitness evaluation, and two methods of selecting an optimal solution, were adopted. It was found that the robust search characteristics and multiple-solution handling capability of genetic-algorithms were well suited for multiobjective optimization analysis. Formulation and development of the solution algorithm were described and demonstrated with a numerical example problem in which a hypothetical network level pavement maintenance programming analysis was performed for two- and three-objective optimization, respectively. A comparison between the two- and three-objective solutions was made to highlight some practical considerations in applying multiobjective optimization to pavement maintenance management. | Source Title: | Journal of Transportation Engineering | URI: | http://scholarbank.nus.edu.sg/handle/10635/65848 | ISSN: | 0733947X | DOI: | 10.1061/(ASCE)0733-947X(2000)126:5(367) |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.