A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs
For the optimization analysis of pavement maintenance programs, combinatorial optimization is a pervasive problem. Genetic algorithms (GAs) are widely used to solve combinatorial optimization problems in pavement maintenance programs. However, owing to the stochastic search mechanisms underlying GAs...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Advances in Civil Engineering |
| Online Access: | http://dx.doi.org/10.1155/2020/8851325 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547695238053888 |
|---|---|
| author | Feng Xiao Shunxin Yang Jianchuan Cheng Mingyu Hou Chenzhu Wang |
| author_facet | Feng Xiao Shunxin Yang Jianchuan Cheng Mingyu Hou Chenzhu Wang |
| author_sort | Feng Xiao |
| collection | DOAJ |
| description | For the optimization analysis of pavement maintenance programs, combinatorial optimization is a pervasive problem. Genetic algorithms (GAs) are widely used to solve combinatorial optimization problems in pavement maintenance programs. However, owing to the stochastic search mechanisms underlying GAs, they are more likely to produce a relatively unsatisfactory solution due to premature convergence. Hence, a binary cuckoo search (BCS) algorithm was implemented to solve the optimization problem. To the best of our knowledge, this is the first time that a BCS algorithm has been applied to pavement maintenance management system. Three hypothetical cases are used to investigate and demonstrate the effectiveness of the BCS algorithm, in which uncertainty-based performance degradation is considered. The results of a comparison between GA and BCS clearly justify the advantages of the search paths underlying the BCS in alleviating premature convergence. Therefore, the BCS algorithm can help decision makers to make more appropriate trade-off decisions for pavement maintenance programs. |
| format | Article |
| id | doaj-art-3a596fe7994845f28bf12dc393b4ca6f |
| institution | Kabale University |
| issn | 1687-8086 1687-8094 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Advances in Civil Engineering |
| spelling | doaj-art-3a596fe7994845f28bf12dc393b4ca6f2025-02-03T06:43:36ZengWileyAdvances in Civil Engineering1687-80861687-80942020-01-01202010.1155/2020/88513258851325A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance ProgramsFeng Xiao0Shunxin Yang1Jianchuan Cheng2Mingyu Hou3Chenzhu Wang4School of Transportation, Southeast University, Nanjing 211189, ChinaSchool of Transportation, Southeast University, Nanjing 211189, ChinaSchool of Transportation, Southeast University, Nanjing 211189, ChinaSchool of Transportation, Southeast University, Nanjing 211189, ChinaSchool of Transportation, Southeast University, Nanjing 211189, ChinaFor the optimization analysis of pavement maintenance programs, combinatorial optimization is a pervasive problem. Genetic algorithms (GAs) are widely used to solve combinatorial optimization problems in pavement maintenance programs. However, owing to the stochastic search mechanisms underlying GAs, they are more likely to produce a relatively unsatisfactory solution due to premature convergence. Hence, a binary cuckoo search (BCS) algorithm was implemented to solve the optimization problem. To the best of our knowledge, this is the first time that a BCS algorithm has been applied to pavement maintenance management system. Three hypothetical cases are used to investigate and demonstrate the effectiveness of the BCS algorithm, in which uncertainty-based performance degradation is considered. The results of a comparison between GA and BCS clearly justify the advantages of the search paths underlying the BCS in alleviating premature convergence. Therefore, the BCS algorithm can help decision makers to make more appropriate trade-off decisions for pavement maintenance programs.http://dx.doi.org/10.1155/2020/8851325 |
| spellingShingle | Feng Xiao Shunxin Yang Jianchuan Cheng Mingyu Hou Chenzhu Wang A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs Advances in Civil Engineering |
| title | A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs |
| title_full | A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs |
| title_fullStr | A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs |
| title_full_unstemmed | A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs |
| title_short | A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs |
| title_sort | binary cuckoo search for combinatorial optimization in multiyear pavement maintenance programs |
| url | http://dx.doi.org/10.1155/2020/8851325 |
| work_keys_str_mv | AT fengxiao abinarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT shunxinyang abinarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT jianchuancheng abinarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT mingyuhou abinarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT chenzhuwang abinarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT fengxiao binarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT shunxinyang binarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT jianchuancheng binarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT mingyuhou binarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms AT chenzhuwang binarycuckoosearchforcombinatorialoptimizationinmultiyearpavementmaintenanceprograms |