A Binary Cuckoo Search for Combinatorial Optimization in Multiyear Pavement Maintenance Programs

摘要: For the optimization analysis of pavement maintenance programs, combinatorial is a pervasive problem. Genetic algorithms (GAs) are widely used to solve problems in programs. However, owing stochastic search mechanisms underlying GAs, they more likely produce relatively unsatisfactory solution due premature convergence. Hence, binary cuckoo (BCS) algorithm was implemented To best our knowledge, this first time that BCS has been applied management system. Three hypothetical cases investigate and demonstrate effectiveness algorithm, which uncertainty-based performance degradation considered. The results comparison between GA clearly justify advantages paths alleviating Therefore, can help decision makers make appropriate trade-off decisions for