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 条
  • [31] An alternative approach for unbalanced assignment problem via genetic algorithm
    Majumdar, Jayanta
    Bhunia, Asoke Kumar
    APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (12) : 6934 - 6941
  • [32] Fast parallel algorithm to the minimum edge cover problem based on DNA molecular computation
    Wang, Zhaocai
    Huang, Dongmei
    Tang, Chengpei
    APPLIED MATHEMATICS & INFORMATION SCIENCES, 2013, 7 (02): : 711 - 716
  • [33] Air Combat Assignment Problem Based on Bayesian Optimization Algorithm
    Fu L.
    Long X.
    He W.
    Journal of Shanghai Jiaotong University (Science), 2022, 27 (06) : 799 - 805
  • [34] Parallel genetic algorithm based on GPU for solving quadratic assignment problem
    Mohammadi, Javad
    Mirzaie, Kamal
    Derhami, Val I.
    2015 2ND INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED ENGINEERING AND INNOVATION (KBEI), 2015, : 568 - 571
  • [35] Algorithm of DNA computing on optimal assignment problems
    Dept. of Mathematics and Physics, Wuhan Polytechnic Univ., Wuhan 430023, China
    不详
    Xi Tong Cheng Yu Dian Zi Ji Shu/Syst Eng Electron, 2007, 7 (1183-1187):
  • [36] A DNA computing model based on Acrydite™ gel technology to solve the timetabling problem
    Zhang, Fengyue
    Liu, Bo
    Liu, Wenbin
    Xu, Jin
    2007 IEEE/ICME INTERNATIONAL CONFERENCE ON COMPLEX MEDICAL ENGINEERING, VOLS 1-4, 2007, : 1632 - +
  • [37] Solve the partitioning problem by sticker model in DNA computing
    QU Huiqin*
    Progress in Natural Science, 2004, (12) : 84 - 89
  • [38] Solve the partitioning problem by sticker model in DNA computing
    Qu, HQ
    Lu, MM
    Zhu, H
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2004, 14 (12) : 1116 - 1121
  • [39] A Genetic Algorithm to Solve Capacity Assignment Problem in a Flow Network
    Hamed, Ahmed Y.
    Alkinani, Monagi H.
    Hassan, M. R.
    CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 64 (03): : 1579 - 1586
  • [40] DNA Computing Technique to Solve Vertex Coloring Problem
    Hasudungan, Rofilde
    Abu Bakar, Rohani
    2013 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER SCIENCE APPLICATIONS AND TECHNOLOGIES (ACSAT), 2014, : 341 - 345
12345