Searching Best Strategies Algorithm For The No Balance Assignment Problem

被引：0
|
作者：
Fang, Maoyan [1 ]
Wang, Minle [1 ]
Bi, Yiming [1 ]
机构：
[1] Secondary Artillery Engineer Inst, Xian, Shanxi, Peoples R China
来源：
INTELLIGENT STRUCTURE AND VIBRATION CONTROL, PTS 1 AND 2 | 2011年 / 50-51卷
关键词：
Overall situation searching; Assignment problem; Cost matrix;
D O I：
10.4028/www.scientific.net/AMM.50-51.386
中图分类号：
TH [机械、仪表工业];
学科分类号：
0802 ;
摘要：
The No Balance Assignment Problem (NBAP) is mainly resolved by changing it into Balance Assignment Problem (BAP) and using classical algorithm to deal with it now. This paper proposed Searching Best strategies Algorithm (SBSA) to resolve this problem, and it needn't to change NBAP into BAP. SBSA resolves NBAP based on searching the best answer of the cost matrix. This algorithm's theory is simple, and it is easy to operate. The result of the research indicate that the algorithm not only can deal with NBAP, but also can deal with BAP and other problems such as translation problem.
引用
收藏
页码：386 / 390
页数：5
相关论文
共 50 条
  • [41] A branch-and-bound algorithm for finding all optimal solutions of the assignment problem
    Fu, Zhuo
    Eglese, Richard
    Wright, Mike
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2007, 24 (06) : 831 - 839
  • [42] Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm
    Liu, Linzhong
    Gao, Xin
    APPLIED MATHEMATICAL MODELLING, 2009, 33 (10) : 3926 - 3935
  • [43] A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
    Shabtay, Dvir
    Steiner, George
    Yedidsion, Liron
    DISCRETE APPLIED MATHEMATICS, 2015, 182 : 115 - 121
  • [44] Colony Location Algorithm for Multiobjective Assignment Problem with Application to E-Brokerage
    Wang, Dingwei
    2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 124 - 129
  • [45] The assignment problem revisited
    Carlos A. Alfaro
    Sergio L. Perez
    Carlos E. Valencia
    Marcos C. Vargas
    Optimization Letters, 2022, 16 : 1531 - 1548
  • [46] Incremental assignment problem
    Toroslu, Ismail H.
    Ucoluk, Gokturk
    INFORMATION SCIENCES, 2007, 177 (06) : 1523 - 1529
  • [47] The assignment problem revisited
    Alfaro, Carlos A.
    Perez, Sergio L.
    Valencia, Carlos E.
    Vargas, Marcos C.
    OPTIMIZATION LETTERS, 2022, 16 (05) : 1531 - 1548
  • [48] Assignment problem with conflicts
    Oncan, Temel
    Suyak, Zeynep
    Akyuz, M. Hakan
    Altinel, I. Kuban
    COMPUTERS & OPERATIONS RESEARCH, 2019, 111 : 214 - 229
  • [49] On a variant of assignment problem
    Dong, JQ
    Li, CQ
    PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 535 - 538
  • [50] The dominance assignment problem
    Calvillo, Gilberto
    Romero, David
    DISCRETE OPTIMIZATION, 2012, 9 (03) : 149 - 158
12345