2019
DOI: 10.1080/15732479.2019.1624787
|View full text |Cite
|
Sign up to set email alerts
|

A constraint-based, efficiency optimisation approach to network-level pavement maintenance management

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 51 publications
0
4
0
Order By: Relevance
“…Zhang et al [31] were promotes a Lagrange multiplier approach combine with derivative-free quasi-Newton algorithms to minimize the total expenditure cost to both the highway agency and the highway users in a system of heterogenous pavement segments under budget limitation. A constraint programming (CP) approach was performed by Hankach et al [32] to minimize total maintenance cost subject to budget constrain and statistical deterioration model on the road network level. A different approach was performed by Torres-Machi et al [33] which utilizes a hybrid Greedy Randomized Adaptive Search Procedure (GRSAP) to minimize environmental impact while maximizing pavement long-term effectiveness (LTE) on pavement maintenance strategy under a limited budget.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Zhang et al [31] were promotes a Lagrange multiplier approach combine with derivative-free quasi-Newton algorithms to minimize the total expenditure cost to both the highway agency and the highway users in a system of heterogenous pavement segments under budget limitation. A constraint programming (CP) approach was performed by Hankach et al [32] to minimize total maintenance cost subject to budget constrain and statistical deterioration model on the road network level. A different approach was performed by Torres-Machi et al [33] which utilizes a hybrid Greedy Randomized Adaptive Search Procedure (GRSAP) to minimize environmental impact while maximizing pavement long-term effectiveness (LTE) on pavement maintenance strategy under a limited budget.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Objective Function: (24) Constraint: (27) If (YF hikn = 1), then (BDY hikn = dfb) and (BCY hikn = fcb), (28) If (YF hikn = 1), then (MDY hikn = dfm) and (MCY hikn = fcm), (29) If (YF hikn = 1), then (UDY hikn = dfu) and (UCY hikn = fcu), (30) If (YF hikn = 0), then (BDY hikn = 0) and (BCY hikn = 0), (31) If (YF hikn = 0), then (MDY hikn = 0) and (MCY hikn = 0), (32) If (YF hikn = 0), then (UDY hikn = 0) and (UCY hikn = 0), (36) Moreover, the explanation of model II, equations ( 25) to (35), is discussed as follow:…”
Section: ) Model-ii: Actual Budget Adjustment Modelmentioning
confidence: 99%
“…As a result, the pavement management problem has been recognized by its high computational complexity [24]. Therefore, recent advancements in pavement management have mainly focused on enhancing the computational performance by using more e cient optimization techniques such as evolutionary and genetic programming algorithms [13,15,[24][25][26]. The main objective sought by those researchers is to reduce the computational time and generate optimal solutions that are closer to the absolute ones.…”
Section: Introductionmentioning
confidence: 99%
“…The NSGA-II and its improved algorithms are popular for solving MOO problems [17,18]. To address the high computation complexity associated with pavement maintenance at the network level, Hankach et al [19] developed a model to reduce the search space and formulated the original problem as a generalized assignment problem, which was a well-known problem in mathematical optimization. Ahmed et al [20] proposed a chaotic particle swarm optimization algorithm to find the optimal solution for pavement maintenance.…”
Section: Introductionmentioning
confidence: 99%