# Determination of Pavement Rehabilitation Activities through a Permutation Algorithm

Authors: Sangyum Lee; Sungho Mun; Hyungchul Moon
Journal: Journal of Applied Mathematics
 (2013)

---

## Abstract

This paper presents a mathematical programming model for optimal pavement rehabilitation planning. The model maximized the rehabilitation area through a newly developed permutation algorithm, based on the procedures outlined in the harmony search (HS) algorithm. Additionally, the proposed algorithm was based on an optimal solution method for the problem of multilocation rehabilitation activities on pavement structure, using empirical deterioration and rehabilitation effectiveness models, according to a limited maintenance budget. Thus, nonlinear pavement performance and rehabilitation activity decision models were used to maximize the objective functions of the rehabilitation area within a limited budget, through the permutation algorithm. Our results showed that the heuristic permutation algorithm provided a good optimum in terms of maximizing the rehabilitation area, compared with a method of the worst-first maintenance currently used in Seoul.


---

## Body

## 1. Introduction

This study involves the objective function of the rehabilitation area to be maximized, using the evaluation model of pavement performance, which is the structural and functional behavior of a road section or length of pavement; furthermore, using budget limitations for pavement rehabilitation, the more deteriorated areas are fixed, based on solving a maximizing problem in this paper. Regression analysis was used to characterize the structural performance under rutting and fatigue deterioration conditions (Figure1).Pavement distress: (a) rutting and (b) fatigue cracking.
(a)
(b)The functional behavior of the pavement is based on the passenger’s perception of the level of service of the pavement and is related to the comfort quality (i.e., smoothness and safety) of the ride. Pavement riding quality was determined in terms of the international roughness index (IRI), as shown in Figure2. The measurement of riding serviceability of the pavement used the quarter-car simulation model, which accounts for the sprung mass of the vehicle body, the suspension spring and damper constants, the unsprung mass of the suspension, tire, and wheel, and the spring constant of the tire [1]. For the calculation of IRI, the road profile was filtered using the quarter-car simulation, with specific parameter values that corresponded to a simulation speed of 80 kmh-1 (Figure 2) [2].Figure 2
International roughness index (IRI) determination through measurement of pavement roughness and quarter-car simulation.In this study, we created an efficient optimization method, based on the heuristic permutation algorithm, to determine the optimum pavement rehabilitation area for a specified budget. The proposed algorithm, based on the harmony search algorithm [3–6], was developed from field measurement data obtained from a road survey vehicle and quarter-car simulations. Section 2 presents a review of the relevant literature of structural and functional deterioration models. Section 3 describes the determination of the optimum rehabilitation area, using the permutation algorithm. Finally, Section 4 presents the application of a case study.


## 2. Structural and Functional Deterioration Models

Much attention has been paid to the deterioration model of pavement performance in terms of fatigue cracking and rut depth as permanent deformation [5]. In this approach, the initial value of fatigue cracking is assigned a value of 10 (i.e., undamaged status), which decreases as described in (1):
(1)SPIcrack=10-1.667·Cr0.38,
where SPIcrack is the Seoul pavement index (SPI) of the crack deterioration model for Seoul city, and Cr is the percentage of crack area of the pavement surface. The SPIcrack decreases as the crack area increases.The deterioration model related to rut depth is based on the averaged measurement of permanent deformation in specific pavement sections and is given as(2)SPIRD=10-0.267·RD,
where SPIRD is the SPI of the rutting deterioration model in Seoul city, and RD is the rut depth (mm). The intact status of 10 (the initial value) decreases as the rut depth increases.The functional pavement condition of the IRI value has a similar form as the structural deterioration models specified in (1) and (2):
(3)SPIIRI=10-0.727·IRI,
where SPIIRI is the functional pavement deterioration index of the IRI (mkm-1) value, related to ride quality, and IRI is the international roughness index. The unit for the IRI of meters per kilometer (mkm-1) is based on the slope measurement of the pavement roughness.Finally, the combination model for determining pavement integrity considers both structural and functional deterioration:(4)SPI=10-[(10-SPIcrack)5+(10-SPIRD)5+(10-SPIIRI)5]1/5,
where SPI is the integral SPI consisting of a combination of the structural and functional SPIs, including fatigue cracking, rutting, and IRI conditions, for surface deterioration of the pavement in Seoul. The threshold SPI value for pavement rehabilitation is 5.Figure3 shows three cases; each case is dependent on one of the indices, SPIcrack, SPIRD, or SPIIRI, while the other two indices remain constant. For example, the distress curve of the integral SPI can be calculated for a fixed value of 3 mm for the rut depth and 2 mkm-1 for the IRI value, as shown in Figure 3(a). The distress curves of the integral SPIs shown in Figures 3(b) and 3(c) are obtained from fixed values of 1% fatigue cracking and 2 mkm-1 IRI and 1% fatigue cracking and 3 mm rutting, respectively.Distress models: (a) fatigue cracking, (b) rutting, and (c) IRI.
(a)
(b)
(c)If the SPI integral is <5, then the rut depth, cracking area, and IRI are checked to determine the appropriate rehabilitation technique. The procedure is given as follows:(1) check whether the rut depth is ≥18 mm; if so, a modified asphalt overlay of 15 cm thickness is applied; (2) check whether the crack area on the pavement surface is ≥30%; if so, a modified asphalt overlay of 10 cm thickness is applied; if 17% ≤ crack area <30%, then a modified asphalt overlay of 5-cm thickness is applied; (3) check whether the IRI is ≥7.3 mkm-1; if so, a modified asphalt overlay of 5 cm thickness is applied; (4) for all other cases, a traditional asphalt overlay of 5 cm thickness is applied. The costs of the above rehabilitation overlays are shown in Table 1.Table 1
Costs of the rehabilitation overlays.
Rehabilitationmethod
Modified asphalt overlay of 15 cm
Modified asphalt overlay of 10 cm
Modified asphalt overlay of 5 cm
General asphalt overlay of 5 cm
Cost(million won/are*)
5.6
4.2
2.5
2.2

*Are is 100 m2.


## 3. Permutation Algorithm

The permutation algorithm conceptualizes a behavioral phenomenon of randomly generated permutations, in which a randomly selected permutation set continues to improve the optimization solution, similar to the search for a better state of harmony [6, 7]. This section describes the proposed permutation algorithm, based on the heuristic algorithm, which searches for an optimized solution. First, we present an application overview of the permutation algorithm, used to formulate the solution vectors for optimization. The object function is then evaluated. Finally, the application setup of the permutation algorithm is explained in terms of pavement rehabilitation.


### 3.1. Algorithm Procedure

Budget limitations for pavement rehabilitation in Seoul city require that the worst deteriorated areas are fixed first (worst-first maintenance) with an asphalt overlay, followed by subsequent areas with slightly less wear. The worst-first maintenance is currently used in Seoul city. However, this rehabilitation procedure has not been evaluated to determine whether or not it provides an increase in the overall averagedSPI value, an indicator of the overall pavement surface condition for Seoul city. The more deteriorated pavement surface areas should be rehabilitated through the permutation algorithm to optimize resources within a limited budget, compared with the current rehabilitation method, such as worst-first maintenance.The procedure for the permutation algorithm consists of Steps 1 through 4. Algorithm preparation is set up in Step 1, as follows: the sectionalSPI values of (4) are calculated, regarding the number of deteriorated sections; these values are then checked to determine whether or not they are below the threshold value of 5, to decide the appropriate rehabilitation method; the deteriorated sections below an SPI value of 5 are then grouped; the deteriorated sections are sorted in ascending order, in terms of their SPI values; and finally, the worst-first maintenance sequence is set up.In Step 2, the optimization problem is specified as follows:(5)MaximizeAreaT=∑i=1NDeAreaisubjecttoLBudget,
where DeAreai is the ith deteriorated area, which is computed by multiplying the length of the area by its width. For example, the worst deteriorated area, which shows the lowest value of SPI, can be found in DeArea1 (e.g., i=1). LBudget is the specified budget limitation.In Step 3, a sorted column vector of the worst-first sequence in Step 1 is filled in the first row of a permutation memory (PM) matrix. The second row of the PM matrix is filled with a randomly generated permutation vector, consisting of the columns of the rehabilitation sections covered by the limited budget, as well as the corresponding total area,AreaT, as shown in
(6)PM=[x11x21x31⋯⋯xNT1x112xNT2x32⋯x72⋯|AreaT1AreaT2],
where the first row represents the sorted column vector of the worst-first maintenance (e.g., x21 is the first row (superscript) and the second worst deterioration area (subscript)); the second row represents the randomly generated permutation vector; NT is the total number of deteriorated sections which show an SPI value <5, based on satisfying the limited city budget; and AreaT is the total deteriorated area. Some of the deteriorated sections will not be rehabilitated due to budget constraints.In Step 4, a comparison process is carried out between the first and second rows in (6). Firstly, the second row in the PM matrix is randomly permutated until AreaT2 is larger than AreaT1 in (6). Secondly, a new permutation vector is randomly generated until the new permutation set provides a larger rehabilitation area in comparison with the second row, as given in
(7)XNew=(x32New,x7New,x19New,…,x8New,…).
If the new permutation set satisfies the above criterion of the larger rehabilitation area then, it can be added to the third row in the PM matrix, as shown in (7) and
(8)PM=[x11x21x31⋯⋯xNT1x112xNT2x32⋯x72⋯x323x73x193⋯x83⋯······|AreaT1AreaT2AreaT3·].Additionally, based on an evaluation of the objective function value ofAreaT in (5), another new permutation set is randomly searched to update the fourth row of the PM matrix, consisting of a larger rehabilitation area, compared with the third row. Finally, if the stopping criterion (i.e., the maximum number of iterations) is satisfied, the procedure of adding better permutation sets into the PM matrix is terminated. Otherwise, Step 4 is repeated.


### 3.2. Application Setup for the Maximized Rehabilitation Area of Deteriorated Pavement Sections

In terms of applying the permutation algorithm to the area maximization problem of pavement rehabilitation, the costs of rehabilitation overlays shown in Table1 are considered, as well as the specified budget limitations of this study. The optimization problem can be solved using the permutation algorithm, based on the setup shown in Table 2. For the simplicity of applying the permutation algorithm, the section numbers shown in Table 2 are sequentially assigned in ascending order, in terms of the integral SPI values.Table 2
Setup of the measured field data used for the heuristic permutation algorithm.
Section number
Road width (m)
Road length (m)
IRI (m/km)
Rutting (mm)
Fatigue cracking (%)
1
4
200
10.55
7.76
4.69
2
23
380
10.02
13.27
8.02
3
23
600
9.29
6.80
3.43
⋮
⋮
⋮
⋮
⋮
⋮
150
18
320
5.92
4.33
5.64


## 3.1. Algorithm Procedure

Budget limitations for pavement rehabilitation in Seoul city require that the worst deteriorated areas are fixed first (worst-first maintenance) with an asphalt overlay, followed by subsequent areas with slightly less wear. The worst-first maintenance is currently used in Seoul city. However, this rehabilitation procedure has not been evaluated to determine whether or not it provides an increase in the overall averagedSPI value, an indicator of the overall pavement surface condition for Seoul city. The more deteriorated pavement surface areas should be rehabilitated through the permutation algorithm to optimize resources within a limited budget, compared with the current rehabilitation method, such as worst-first maintenance.The procedure for the permutation algorithm consists of Steps 1 through 4. Algorithm preparation is set up in Step 1, as follows: the sectionalSPI values of (4) are calculated, regarding the number of deteriorated sections; these values are then checked to determine whether or not they are below the threshold value of 5, to decide the appropriate rehabilitation method; the deteriorated sections below an SPI value of 5 are then grouped; the deteriorated sections are sorted in ascending order, in terms of their SPI values; and finally, the worst-first maintenance sequence is set up.In Step 2, the optimization problem is specified as follows:(5)MaximizeAreaT=∑i=1NDeAreaisubjecttoLBudget,
where DeAreai is the ith deteriorated area, which is computed by multiplying the length of the area by its width. For example, the worst deteriorated area, which shows the lowest value of SPI, can be found in DeArea1 (e.g., i=1). LBudget is the specified budget limitation.In Step 3, a sorted column vector of the worst-first sequence in Step 1 is filled in the first row of a permutation memory (PM) matrix. The second row of the PM matrix is filled with a randomly generated permutation vector, consisting of the columns of the rehabilitation sections covered by the limited budget, as well as the corresponding total area,AreaT, as shown in
(6)PM=[x11x21x31⋯⋯xNT1x112xNT2x32⋯x72⋯|AreaT1AreaT2],
where the first row represents the sorted column vector of the worst-first maintenance (e.g., x21 is the first row (superscript) and the second worst deterioration area (subscript)); the second row represents the randomly generated permutation vector; NT is the total number of deteriorated sections which show an SPI value <5, based on satisfying the limited city budget; and AreaT is the total deteriorated area. Some of the deteriorated sections will not be rehabilitated due to budget constraints.In Step 4, a comparison process is carried out between the first and second rows in (6). Firstly, the second row in the PM matrix is randomly permutated until AreaT2 is larger than AreaT1 in (6). Secondly, a new permutation vector is randomly generated until the new permutation set provides a larger rehabilitation area in comparison with the second row, as given in
(7)XNew=(x32New,x7New,x19New,…,x8New,…).
If the new permutation set satisfies the above criterion of the larger rehabilitation area then, it can be added to the third row in the PM matrix, as shown in (7) and
(8)PM=[x11x21x31⋯⋯xNT1x112xNT2x32⋯x72⋯x323x73x193⋯x83⋯······|AreaT1AreaT2AreaT3·].Additionally, based on an evaluation of the objective function value ofAreaT in (5), another new permutation set is randomly searched to update the fourth row of the PM matrix, consisting of a larger rehabilitation area, compared with the third row. Finally, if the stopping criterion (i.e., the maximum number of iterations) is satisfied, the procedure of adding better permutation sets into the PM matrix is terminated. Otherwise, Step 4 is repeated.


## 3.2. Application Setup for the Maximized Rehabilitation Area of Deteriorated Pavement Sections

In terms of applying the permutation algorithm to the area maximization problem of pavement rehabilitation, the costs of rehabilitation overlays shown in Table1 are considered, as well as the specified budget limitations of this study. The optimization problem can be solved using the permutation algorithm, based on the setup shown in Table 2. For the simplicity of applying the permutation algorithm, the section numbers shown in Table 2 are sequentially assigned in ascending order, in terms of the integral SPI values.Table 2
Setup of the measured field data used for the heuristic permutation algorithm.
Section number
Road width (m)
Road length (m)
IRI (m/km)
Rutting (mm)
Fatigue cracking (%)
1
4
200
10.55
7.76
4.69
2
23
380
10.02
13.27
8.02
3
23
600
9.29
6.80
3.43
⋮
⋮
⋮
⋮
⋮
⋮
150
18
320
5.92
4.33
5.64


## 4. Results

Our permutation algorithm was used to evaluate 150 pavement sections being considered for rehabilitation, as shown in Table2. According to Step 3, the worst-first sequence was stored in the PM matrix, and the second row was obtained by randomly permutated selection, as shown in (9).Permutation memory (PM) matrix generation for worst-first maintenance, along with the first permutation, is as follows:(9)PM=[123⋯⋯27282930125045⋯240000|262860257020].There were 50 sections that had an integral SPI value of <5. The 30 sections in the first row can be rehabilitated, using a limited budget of seven billion won (Korean currency), as shown in (9). The second row was updated until the second row chosen by the permutation algorithm provided more rehabilitated areas, compared with the first row of the worst-first sequence. The rehabilitated sections were limited to 25 sections, which provided more rehabilitated area than the approach using worst-first maintenance, as shown in (10).PM matrix consisting of a better solution in the second row, compared with the worst-first maintenance, is as follows:(10)PM=[12⋯2526272829305026⋯2700000|262860275580].The columns above 25th in the second row of the PM matrix were assigned a zero value, as shown in (10). Additionally, a third row was added to the PM matrix when the randomly generated third row resulted in better selection than the second row group, in terms of rehabilitation area covered by the limited budget, as shown in (11). Equation (12) and Figure 4 show the best selection resulting in the largest rehabilitation area, after ~1000 iterations.Figure 4
Rehabilitated area as a function of the number of iterations.PM matrix updating procedure(11)PM=[123⋯24252627282930502623⋯192700000291747⋯9000000|262860275580277480].Final PM matrix obtained using the permutation algorithm(12)PM=[123⋯24252627282930502623⋯192700000291747⋯9000000531458⋯1630250000141911⋯49582464112315912⋯58000000182033⋯945362643270372641⋯82111300030250⋯262190000382746⋯1623584228470|262860275580277480278740278780279240279260279520279960279980].


## 5. Conclusion

A permutation algorithm has been described to determine the optimal pavement rehabilitation planning which maximizes the rehabilitation area, using the empirical models of fatigue and rutting deterioration, as well as the functional model of IRI. To evaluate the suggested permutation algorithm, the worst-first maintenance method used in the current rehabilitation technique was compared. Our results indicated that the developed permutation algorithm, described in this study, provided a better solution in terms of covering a larger deteriorated area within the limited city budget, when compared with the worst-first maintenance, which is currently used in Seoul city.



---

*Source: 252808-2013-06-12.xml*