A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

被引：19
|
作者：
Wang, Zhaocai [1 ]
Pu, Jun [2 ]
Cao, Liling [3 ]
Tan, Jian [4 ]
机构：
[1] Shanghai Ocean Univ, Coll Informat, Shanghai 201306, Peoples R China
[2] Univ Int Business & Econ, Ctr Finance & Accounting Res, Beijing 100029, Peoples R China
[3] Shanghai Ocean Univ, Coll Engn Sci & Technol, Shanghai 201306, Peoples R China
[4] Chinese Acad Sci, Inst Remote Sensing & Digital Earth, Key Lab Digital Earth Sci, Beijing 100094, Peoples R China
来源：
INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES | 2015年 / 16卷 / 10期
基金：
中国国家自然科学基金;
关键词：
DNA molecules computing; the unbalanced assignment problem; biological optimization algorithm; NP-complete problem; COMPUTATION;
D O I：
10.3390/ijms161025338
中图分类号：
Q5 [生物化学]; Q7 [分子生物学];
学科分类号：
071010 ; 081704 ;
摘要：
The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.
引用
收藏
页码：25338 / 25352
页数：15
相关论文
共 50 条
  • [1] A biological algorithm to solve the assignment problem based on DNA molecules computation
    Wang, Zhaocai
    Tan, Jian
    Huang, Dongmei
    Ren, Yingchao
    Ji, Zuwen
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 244 : 183 - 190
  • [2] MODIFIED HUNGARIAN ALGORITHM TO SOLVE UNBALANCED ASSIGNMENT PROBLEM
    Katariya, Anuj K.
    Sharma, Shashi
    Singh, S. R.
    Shweta
    Jyoti
    INTERNATIONAL JOURNAL OF AGRICULTURAL AND STATISTICAL SCIENCES, 2022, 18 (02): : 777 - 781
  • [3] A parallel algorithm to solve the multiple travelling salesmen problem based on molecular computing model
    Wang, Zhaocai
    Deng, Anjun
    Wang, Dangwei
    Wu, Tunhua
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2022, 20 (03) : 160 - 171
  • [4] A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity
    Wang, Zhaocai
    Wang, Dangwei
    Bao, Xiaoguang
    Wu, Tunhua
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 40 (03) : 3957 - 3967
  • [5] A parallel algorithm for solving sat problem based on dna computing
    Darehmiraki, M.
    International Journal of Computers and Applications, 2009, 31 (02) : 128 - 131
  • [6] Solving unconstraint assignment problem by a molecular-based computing algorithm
    Ibrahim, Z. (zuwairie@ieee.org), 2004, (Institute of Electrical and Electronics Engineers Inc.):
  • [7] Solving unconstraint assignment problem by a molecular-based computing algorithm
    Ibrahim, Z
    Tsuboi, Y
    Ono, O
    PROCEEDINGS OF THE IEEE-ISIE 2004, VOLS 1 AND 2, 2004, : 1473 - 1478
  • [8] A Biological Computing Algorithm to Solve K-Closure Problem
    Wang, Zhaocai
    Zhao, Kai
    Wang, Xiaoming
    Huang, Wei
    Zou, Qian
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (08) : 1818 - 1820
  • [9] Algorithm of DNA computing model for gate assignment problem
    Yin, Zhixiang
    Chen, Min
    Li, Qingyan
    Advances in Intelligent Systems and Computing, 2013, 212 : 299 - 305
  • [10] A parallel computing approach to solve traffic assignment using path-based gradient projection algorithm
    Chen, Xinyuan
    Liu, Zhiyuan
    Zhang, Kai
    Wang, Zewen
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2020, 120
12345