7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
7-days of FREE Audio papers, translation & more with Prime
7-days of FREE Prime access
https://doi.org/10.1080/10298436.2020.1859506
Copy DOIPublication Date: Dec 18, 2020 | |
Citations: 17 | License type: other-oa |
ABSTRACT This study approaches a multi-stage stochastic mixed-integer programming model for the high-level complexity of large-scale pavement maintenance scheduling problems. The substance of some parameters in the mentioned problems is uncertain. Ignoring the uncertainty of these parameters in the pavement maintenance scheduling problems may lead to suboptimal solutions and unstable pavement conditions. In this study, annual budget and pavement deterioration rate are considered uncertain parameters. On the other hand, pavement agencies generally face large-scale pavement networks. The complexity of the proposed stochastic model increases exponentially with the number of network sections and scenarios. The problem is solved using the Progressive Hedging Algorithm (PHA), which is suitable for large-scale stochastic programming problems, by achieving an effective decomposition over scenarios. A modified adaptive strategy for choosing the penalty parameter value is applied that aims to improve the solution process. A pavement network including 251 sections is considered the case study for this investigation, and the current study seeks optimal maintenance scheduling over a finite analysis period. The performance of the stochastic model is compared with that of the deterministic model. The results indicate that the introduced approach is competent to address uncertainty in maintenance and rehabilitation problems.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.