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
来源：
PROGRESS IN INTELLIGENCE COMPUTATION AND APPLICATIONS, PROCEEDINGS | 2007年
关键词：
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 条
  • [31] A novel particle swarm optimization algorithm for solving transportation problem
    Hao, Zhi-Feng
    Huang, Han
    Yang, Xiao-Wei
    PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 2178 - +
  • [32] A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem
    Li, Jun-qing
    Pan, Yu-xia
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (1-4) : 583 - 596
  • [33] A Novel Discrete Particle Swarm Optimization Algorithm for the Travelling Salesman Problems
    Sequeiros, Jose A.
    Silva, Rui
    Santos, Andre S.
    Bastos, J.
    Varela, M. L. R.
    Madureira, A. M.
    INNOVATIONS IN INDUSTRIAL ENGINEERING, 2022, : 48 - 55
  • [34] A Novel Discrete Particle Swarm Optimization for FRM FIR Digital Filters
    Hashemi, Seyyed Ali
    Nowrouzian, Behrouz
    JOURNAL OF COMPUTERS, 2012, 7 (06) : 1289 - 1296
  • [35] A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
    Chen, Chun-Lung
    Huang, Shin-Ying
    Tzeng, Yeu-Ruey
    Chen, Chuen-Lung
    SOFT COMPUTING, 2014, 18 (11) : 2271 - 2282
  • [36] Application of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem
    Qi, Chengming
    CEIS 2011, 2011, 15
  • [37] Control a novel discrete chaotic system through Particle Swarm Optimization
    Gao, Fei
    Tong, Hengqing
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3330 - +
  • [38] Multiprocessor task scheduling problem using hybrid discrete particle swarm optimization
    Vairam, T.
    Sarathambekai, S.
    Umamaheswari, K.
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2018, 43 (12):
  • [39] Multiprocessor task scheduling problem using hybrid discrete particle swarm optimization
    T Vairam
    S Sarathambekai
    K Umamaheswari
    Sādhanā, 2018, 43
  • [40] A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
    Tseng, Chao-Tang
    Liao, Ching-Jong
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (02) : 360 - 373
12345