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

被引:0
|
作者
Kawther Ahmed
Belal Al-Khateeb
Maher Mahmood
机构
[1] University of Anbar,Computer Science Department, College of Computer Science and Information Technology
[2] University of Anbar,Civil Engineering Department, Faculty of Engineering
来源
Cluster Computing | 2019年 / 22卷
关键词
Particle swarm optimization; Pavement maintenance; Multi-objective optimization; Chaotic mapping; Binary PSO;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:4647 / 4657
页数:10
相关论文
共 50 条
  • [1] Application of chaos discrete particle swarm optimization algorithm on pavement maintenance scheduling problem
    Ahmed, Kawther
    Al-Khateeb, Belal
    Mahmood, Maher
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (02): : S4647 - S4657
  • [2] A circular discrete particle swarm optimization algorithm for flow shop scheduling problem
    Liang, Shubin
    Ning, Jiaxu
    Wang, Xiaodong
    Xue, Zhanao
    2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 4, 2008, : 1151 - 1156
  • [3] The circular discrete particle swarm optimization algorithm for flow shop scheduling problem
    Zhang, Jindong
    Zhang, Changsheng
    Liang, Shubin
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (08) : 5827 - 5834
  • [4] A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
    Pan, Quan-Ke
    Tasgetiren, M. Fatih
    Liang, Yun-Chia
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) : 2807 - 2839
  • [5] Application of Hybrid Particle Swarm Optimization Algorithm in Workshop Scheduling Problem
    Wang Guitang
    Chen Zhisheng
    Liang WenJie
    Yang ChaoQiong
    PROCEEDINGS OF THE 2ND INTERNATIONAL FORUM ON MANAGEMENT, EDUCATION AND INFORMATION TECHNOLOGY APPLICATION (IFMEITA 2017), 2017, 130 : 420 - 426
  • [6] Particle swarm optimization algorithm with chaos and its application in planar location problem
    Zhang Binyan
    Chen Zhaohui
    Li Dawei
    PROCEEDINGS OF THE 24TH CHINESE CONTROL CONFERENCE, VOLS 1 AND 2, 2005, : 1331 - 1333
  • [7] Migration algorithm of particle swarm optimization for a scheduling problem
    Hernane S.
    Hernane Y.
    Benyettou M.
    Journal of Applied Sciences, 2010, 10 (08) : 699 - 703
  • [8] An Improved Discrete Particle Swarm Optimization for Berth Scheduling Problem
    Huang, Danhua
    Wang, Su
    MECHATRONICS, ROBOTICS AND AUTOMATION, PTS 1-3, 2013, 373-375 : 1192 - +
  • [9] A discrete particle swarm optimization algorithm for scheduling parallel machines
    Kashan, Ali Husseinzadeh
    Karimi, Behrooz
    COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (01) : 216 - 223
  • [10] Chaos Immune Particle Swarm Optimization Algorithm with Hybrid Discrete Variables and its Application to Mechanical Optimization
    Luo, Youxin
    Che, Xiaoyi
    IITAW: 2009 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATIONS WORKSHOPS, 2009, : 190 - 193