T
Tien Fang Fwa
Researcher at National University of Singapore
Publications - 248
Citations - 4965
Tien Fang Fwa is an academic researcher from National University of Singapore. The author has contributed to research in topics: Skid (automobile) & Pavement management. The author has an hindex of 35, co-authored 248 publications receiving 4105 citations. Previous affiliations of Tien Fang Fwa include Chang'an University & Purdue University.
Papers
More filters
BookDOI
The Handbook of Highway Engineering
TL;DR: In this article, the authors present a survey of highway condition surveys and serviceability evaluation of highway pavements and evaluate the performance of highway drainage and segmental paving.
Journal ArticleDOI
Multiobjective Optimization for Pavement Maintenance Programming
TL;DR: In this paper, a genetic-algorithm-based procedure for solving multi-objective network level pavement maintenance programming problems was developed, where the concepts of Pareto optimal solution set and rank-based fitness evaluation, and two methods of selecting an optimal solution, were adopted.
Journal ArticleDOI
Big AIS data based spatial-temporal analyses of ship traffic in Singapore port waters
TL;DR: In this article, the authors developed a tangible analytical approach to analyze ship traffic demand and the spatial-temporal dynamics of ship traffic in port waters using big AIS data and applied the developed approach to the Singapore port waters.
Journal ArticleDOI
Road-maintenance planning using genetic algorithms. I: Formulation
TL;DR: The present paper demonstrates the applicability of genetic algorithms, as an optimization tool capable of overcoming combinatorial explosion, to the road‐maintenance planning problem at the network level.
Journal ArticleDOI
Genetic-algorithm programming of road maintenance and rehabilitation
TL;DR: The development of a computer model based on genetic algorithms, an optimization tool capable of overcoming combinatorial explosion, to solve the pavement maintenance-rehabilitation trade-off problem at the network level is described.