| 000 | 05023nas|a2200565 i 4500 | ||
|---|---|---|---|
| 005 | 20260818155857.0 | ||
| 008 | 040827s2004 th uzm rtt 00| a1eng d | ||
| 035 | _a.b11938067 | ||
| 099 | 9 | _aAIT Thesis no.CM-04-21 | |
| 100 | 0 | _aAkkarapol Tangphaisankun | |
| 245 | 1 | 0 | _aMulti-objective optimization model using constraint-based genetic algorithms for Thailand pavement management |
| 260 |
_aPathum Thani, Thailand : _bAsian Institute of Technology, _c2004 |
||
| 300 | _a127 leaves | ||
| 490 | 1 |
_aThesis ; _vno. CM-04-21 |
|
| 500 | _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Civil Engineering | ||
| 502 | _aThesis (M.Eng.) - Asian Institute of Technology, 2004 | ||
| 520 | _aIn Thailand, maintenance program is planned based on the TPMS Budgeting Module. Proper treatments are recommended based on h·affic volume and road condition and implemented based on the prioritization. Most maintenance treatments are assigned to the heavy h·affic sections and deferred for the light h·affic roads which make the maintenance programs not optimal. Due to the limited budgets, the overall network condition is not well-maintained because most of the roads are defened until their IRI values exceed the acceptable levels. The objective of this study is to develop a multi-objective optimization model to suppo1t the decision making process of DOH to provide the optimal maintenance programs. Various levels of preventive maintenance programs are set based on the best condition and the maximum acceptable level to determine the most suitable preventive maintenance levels. Vehicle operating cost (VOC) minimization is taken into account in a singleobjective optimization, and road network condition maximization is established to be simultaneously considered in the multi-objective optimization. This study selects the flexible pavements in Pathumtani province to be the study area. To accomplish this study, optimization models, both single- and multi-objective, over a multiyear planning period (30 years) are developed by incorporating with the consh·aint-based genetic algorithms to deal with the combinated characteristic of the network-level maintenance planning. Two consh·aints, budget and system preservation, are employed to make the solutions more realistic. Pareto optimality and non-dominated sorting are inh·oduced to handle the multi-objective genetic algorithms model. The results show that the optimal maintenance programs of both single- and multi-objective models typically implement preventive maintenance before their conditions reach the maximum acceptable levels. | ||
| 650 | 0 | _aGenetic algorithms | |
| 650 | 0 |
_aPavements _xManagement _zThailand |
|
| 650 | 0 |
_aDecision-making _zThailand |
|
| 700 | 0 |
_aPannapa Herabat, _eChairperson |
|
| 700 | 0 |
_aPannapa Herabat, _eChairperson |
|
| 700 | 1 |
_aOgunlana, Stephen O., _eExamination Committee |
|
| 700 | 1 |
_aHanaoka, Shinya, _eExamination committee |
|
| 710 | 2 |
_aRoyal Thai Government, _eScholarship donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. CM-04-21 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B08750 |
||
| 907 |
_a.b11938067 _bmnait _cu |
||
| 902 | _a250319 | ||
| 998 |
_b0 _c040827 _dm _ea _fu _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 942 | _c20 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120683916 _bCREATED : 2003-03-30 _cRECORD # : i1241377x _dLPATRON : 1015151 _eLCHKIN : 2007-01-05 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 7 _jTOT RENEW : 10 |
||
| 909 |
_aBarcode : 30050120683759 _bCREATED : 2003-03-30 _cRECORD # : i12413781 _dLPATRON : 1018445 _eLCHKIN : 2007-03-01 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 8 _jTOT RENEW : 2 |
||
| 909 |
_aBarcode : 30050160063995 _bCREATED : 2016-06-06 _cRECORD # : i13018188 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120916951 _bCREATED : 2019-11-15 _cRECORD # : i13229631 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120916969 _bCREATED : 2019-11-15 _cRECORD # : i13229643 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120916977 _bCREATED : 2019-11-15 _cRECORD # : i13229655 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120916944 _bCREATED : 2019-11-15 _cRECORD # : i13229667 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050121003130 _bCREATED : 2021-03-31 _cRECORD # : i13337397 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c78931 _d78931 |
||