A biological algorithm to solve the assignment problem based on DNA molecules computation

The assignment problem (AP) is to optimally solve the task of assigning n jobs to n individuals, such that minimum cost or maximum profit can be obtained. It is a vitally important NP-complete problem in operation management and applied mathematics, having a wide range of applications. In this paper...

Full description

Saved in:
Bibliographic Details
Published inApplied mathematics and computation Vol. 244; pp. 183 - 190
Main Authors Wang, Zhaocai, Tan, Jian, Huang, Dongmei, Ren, Yingchao, Ji, Zuwen
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.10.2014
Subjects
Adleman–Lipton model
DNA computation
NP-complete problem
The assignment problem
Adleman–Lipton model
DNA computation
The assignment problem
NP-complete problem
Online AccessGet full text

Cover

More Information
Summary:The assignment problem (AP) is to optimally solve the task of assigning n jobs to n individuals, such that minimum cost or maximum profit can be obtained. It is a vitally important NP-complete problem in operation management and applied mathematics, having a wide range of applications. In this paper, we present a new parallel DNA algorithm to solve the assignment problem using DNA molecular operations. Meanwhile, we design flexible length DNA strands to represent different jobs and individuals, take appropriate steps and get the solutions of the AP in proper length range and with O(n2) time complexity. We extend the application of DNA molecular operations and simultaneity reduce the complexity of the computation.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2014.06.098