2001
DOI: 10.1016/s0968-090x(00)00023-1
|View full text |Cite
|
Sign up to set email alerts
|

Constraint handling methods in pavement maintenance programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2006
2006
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 34 publications
(13 citation statements)
references
References 4 publications
0
13
0
Order By: Relevance
“…Chan et al (2001) reviewed methodologies used to handle constraints in GA optimisation and proposed a methodology (prioritised resource allocation method) that was shown to be computationally more efficient than the conventional techniques such as penalty methods and 'decode and repair'. 4 Golroo and Tighe (2012) conducted experiments to find the optimal GA settings (in terms of simulation number, mating operator methods and operators' probabilities) for solving complex maintenance optimisation problems.…”
Section: Genetic Algorithms: the State-of-the-art Optimisation Methodsmentioning
confidence: 99%
“…Chan et al (2001) reviewed methodologies used to handle constraints in GA optimisation and proposed a methodology (prioritised resource allocation method) that was shown to be computationally more efficient than the conventional techniques such as penalty methods and 'decode and repair'. 4 Golroo and Tighe (2012) conducted experiments to find the optimal GA settings (in terms of simulation number, mating operator methods and operators' probabilities) for solving complex maintenance optimisation problems.…”
Section: Genetic Algorithms: the State-of-the-art Optimisation Methodsmentioning
confidence: 99%
“…Fwa et al [3] proposed a mathematical programming for routine network-level maintenance activities. Chan et al [4] presented a genetic algorithm based approach to allocate available resource in the pavement maintenance programming to maintain within a pavement network the highest possible level of serviceability. Chakroborty et al [5] presented a 0-1 linear integer programming to comprehensively determine maintenance strategies for a network of road sections.…”
Section: Literature Reviewmentioning
confidence: 99%
“…With the increase of the complexity of pavement maintenance decision-making modeling, the ability of the algorithm to obtain global or local optimal solutions is more and more important. Some accurate algorithms such as linear programming algorithm [21], gradient descent algorithm [22], branch and bound algorithm [23], etc. were introduced to solve the single-stage maintenance decision problems with a small feasible region.…”
Section: Literature Reviewmentioning
confidence: 99%