Application of chaos discrete particle swarm optimization algorithm on pavement maintenance scheduling problem

被引:24
作者
Ahmed, Kawther [1 ]
Al-Khateeb, Belal [1 ]
Mahmood, Maher [2 ]
机构
[1] Univ Anbar, Coll Comp Sci & Informat Technol, Comp Sci Dept, Ramadi, Iraq
[2] Univ Anbar, Fac Engn, Civil Engn Dept, Ramadi, Iraq
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2019年 / 22卷 / 02期
关键词
Particle swarm optimization; Pavement maintenance; Multi-objective optimization; Chaotic mapping; Binary PSO; VEHICLE-ROUTING PROBLEM; GENETIC-ALGORITHM;
D O I
10.1007/s10586-018-2239-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Particle swarm optimization (PSO) is one of the most popular and successful optimization algorithms used for solving single objective and multi-objective optimization problems. It is found that the Multi objective particle swarm optimization (MOPSO) has ability to find the optimal solution quickly and more efficient than other optimization algorithms. In this paper, a discrete (binary) MOPSO with chaos methods is developed and applied to pavement maintenance management. The main objective of this research is to find optimal maintenance and rehabilitation plan for flexible pavement with minimum maintenance cost and maximum pavement performance. This research is the first attempt to combine the crossover operation with velocity and position with multi objective PSO algorithm. The results show that the improvements in pavement performance and cost objectives are 94.65 and 54.01% respectively, while the improvement in execution time is 99.9%. In addition, it is found that the developed algorithm is able to converge to the optimal solution quickly, comparing with another PSO algorithm.
引用
收藏
页码:S4647 / S4657
页数:11
相关论文
共 31 条
[1]  
Chen GC, 2004, 8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS, P6
[2]   Reliability-based performance simulation for optimized pavement maintenance [J].
Chou, Jui-Sheng ;
Le, Thanh-Son .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2011, 96 (10) :1402-1410
[3]   Measuring the convergence and diversity of CDAS Multi-Objective Particle Swarm Optimization Algorithms: A study of many-objective problems [J].
de Carvalho, Andre B. ;
Pozo, Aurora .
NEUROCOMPUTING, 2012, 75 (01) :43-51
[4]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[5]  
Elhadidy Amr A., 2015, HBRC Journal, V11, P107, DOI 10.1016/j.hbrcj.2014.02.008
[6]   Genetic-algorithm programming of road maintenance and rehabilitation [J].
Fwa, TF ;
Chan, WT ;
Tan, CY .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1996, 122 (03) :246-253
[7]  
Jia-ruey Chang, 2013, Applied Mechanics and Materials, V343, P43, DOI 10.4028/www.scientific.net/AMM.343.43
[8]  
Kennedy J, 1997, IEEE SYS MAN CYBERN, P4104, DOI 10.1109/ICSMC.1997.637339
[9]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[10]  
Khanesar M.A., 2007, P 15 MED C CONTR AUT, V1, P3