A novel discrete Particle Swarm Optimization for optimal assignment problem

被引:0
|
作者
Zhang, Yanduo [1 ]
Tian, Hui [1 ]
Lu, Jing [1 ]
机构
[1] Wuhan Inst Technol, Sch Comp Sci & Engn, Wuhan 430073, Peoples R China
关键词
Particle Swarm Optimization; optimal assignment problem; genetic algorithm;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Optimal Assignment Problem (OAP), a category of special integer planning problem, belongs to linear programming problem. For the Hungary Algorithm (HA) is difficult to program and isn't convergent in some cases, a novel discrete Particle Swarm Optimization (PSO) algorithm for OAP is proposed, which is based on the model of velocity and displacement. But, with a view to the particularity of OAP, the particle's velocity and displacement are endowed with new connotation, and relevant update mechanisms of velocity and displacement are designed. The algorithm is applied in general OAPs (including the problems for which HA is not convergent), and compared with GA on performance by testing at OAP with different scales. Experimental results show the algorithm is effective, well adaptability, and better at convergence and performance than GA.
引用
收藏
页码:354 / 358
页数:5
相关论文
共 50 条
  • [1] Discrete particle swarm optimization algorithm for independent task assignment problem
    College of Computer and Information, Fujian Agriculture and Forestry University, Fuzhou 350002, China
    不详
    [J]. Moshi Shibie yu Rengong Zhineng, 2006, 3 (399-405):
  • [2] A NOVEL DISCRETE RAT SWARM OPTIMIZATION ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM
    Mzili, Toufik
    Mzili, Ilyass
    Riffi, Mohammed Essaid
    Pamucar, Dragan
    Simic, Vladimir
    Kurdi, Mohamed
    [J]. FACTA UNIVERSITATIS-SERIES MECHANICAL ENGINEERING, 2023, 21 (03) : 529 - 552
  • [3] A DISCRETE VERSION OF PARTICLE SWARM OPTIMIZATION FOR DISTRIBUTED SYSTEM TASK ASSIGNMENT PROBLEM
    Lo, Shih-Tang
    Shiau, Der-Fang
    Chen, Ruey-Maw
    Lin, Yi-Chun
    [J]. PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER THEORY AND ENGINEERING (ICACTE 2009), VOLS 1 AND 2, 2009, : 1723 - 1731
  • [4] Particle swarm optimization for task assignment problem
    Salman, A
    Ahmad, I
    Al-Madani, S
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2002, 26 (08) : 363 - 371
  • [5] Solving weapon-target assignment problem using discrete particle swarm optimization
    Zeng, Xiangping
    Zhu, Yunlong
    Nan, Lin
    Hu, Kunyuan
    Niu, Ben
    He, Xiaoxian
    [J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3562 - +
  • [6] Novel discrete Particle Swarm Optimization to solve Traveling Salesman Problem
    Zhong, Wen-liang
    Zhang, Jun
    Chen, Wei-neng
    [J]. 2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 3283 - 3287
  • [7] Discrete Particle Swarm Optimization for the Orienteering Problem
    Sevkli, Zulal
    Sevilgen, F. Erdogan
    [J]. 2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [8] DISCRETE PARTICLE SWARM OPTIMIZATION FOR THE ORIENTEERING PROBLEM
    Muthuswamy, Shanthi
    Lam, Sarah
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2011, 18 (02): : 92 - 102
  • [9] Examples on Particle Swarm Optimization Solve Assignment Problem
    Wang, Suxin
    Wang, Leizhen
    Li, Yongqing
    Zhang, Songzhu
    Xu, Yanqin
    [J]. 2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 3513 - 3515
  • [10] Particle Swarm Optimization Algorithm for Quadratic Assignment Problem
    Lv Congying
    Zhao Huanping
    Yang Xinfeng
    [J]. 2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4, 2012, : 1728 - 1731