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 条
  • [41] A surface-based DNA algorithm for the maximal clique problem
    Pan, LQ
    Xu, J
    Liu, YC
    CHINESE JOURNAL OF ELECTRONICS, 2002, 11 (04): : 469 - 471
  • [42] A "Nano-Dial" Molecular Computing Model Based on Circular DNA
    Zhang, Cheng
    Yang, Jing
    Xu, Jin
    Wang, Shudong
    CURRENT NANOSCIENCE, 2010, 6 (03) : 285 - 291
  • [43] A surface-based DNA computing for the positive integer linear programming problem
    Yin, Zhi-xiang
    Cui, Jian-zhong
    Yang, Jin
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF THEORETICAL AND METHODOLOGICAL ISSUES, 2007, 4681 : 1 - +
  • [44] A JAYA algorithm based on normal clouds for DNA sequence optimization
    Zhu, Donglin
    Wang, Siwei
    Huang, Zuwei
    Zhou, Changjun
    Zhang, Lin
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (02): : 2133 - 2149
  • [45] Research on Biological Population Evolutionary Algorithm and Individual Adaptive Method Based on Quantum Computing
    Lu, Xuandiyang
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2022, 2022
  • [46] A surface-based DNA algorithm for the minimal vertex cover problem
    PAN Linqiang
    Department of Mathematics and Physics
    Progress in Natural Science, 2003, (01) : 80 - 82
  • [47] A New Algorithm for Set Splitting Problem Based DNA Molecules Computation
    Wang, Zhaocai
    Tang, Chengpei
    Liu, Haifeng
    Pei, Renlin
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2014, 11 (03) : 899 - 900
  • [48] A surface-based DNA algorithm for the minimal vertex cover problem
    Pan, LQ
    Xu, J
    Liu, YC
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2003, 13 (01) : 78 - 80
  • [49] A Molecular Computing Model for Maximum Independent Set Based on Origami and Greedy Algorithm
    Wang Xixu
    Li Jing
    Song Zhichao
    Jing Yang
    Cheng Zhang
    Jin Xu
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2014, 11 (08) : 1773 - 1778
  • [50] DNA-based algorithm for 0-1 planning problem
    Wang, L
    Chen, ZP
    Jiang, XH
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, VOL 4, PROCEEDINGS, 2005, 3483 : 733 - 742
12345