Solving the 0–1 multi-objective knapsack problem using self-assembly of DNA tiles

Recently, many researchers have demonstrated that computation by DNA tile self-assembly may be scalable and it is considered as a promising technique in nanotechnology. In this paper, we show how the tile self-assembly process can be used for solving the 0–1 multi-objective knapsack problem by mainly constructing four small systems which are nondeterministic guess system, multiplication system, addition system and comparing system, by which we can probabilistically get the feasible solution of the problem. Our model can successfully perform the 0–1 multi-objective knapsack problem in polynomial time with optimal Θ(1) distinct tile types, parallely and at very low cost.

[1]  Hao Wang,et al.  Proving theorems by pattern recognition I , 1960, Commun. ACM.

[2]  Hao Wang.  Proving theorems by pattern recognition — II , 1961 .

[3]  Meir J. Rosenblatt,et al.  Generating the Discrete Efficient Frontier to the Capital Budgeting Problem , 1989, Oper. Res..

[4]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[5]  Erik Winfree,et al.  On the computational power of DNA annealing and ligation , 1995, DNA Based Computers.

[6]  N. Seeman.  DNA nanotechnology: novel DNA constructions. , 1998, Annual review of biophysics and biomolecular structure.

[7]  N. Seeman,et al.  Designed Two-Dimensional DNA Holliday Junction Arrays Visualized by Atomic Force Microscopy , 1999 .

[8]  Michael M. Kostreva,et al.  Relocation problems arising in conservation biology , 1999 .

[9]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[10]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[11]  Larry Jenkins.  A bicriteria knapsack program for planning remediation of contaminated lightstation sites , 2002, Eur. J. Oper. Res..

[12]  Hans Kellerer,et al.  Approximating Multiobjective Knapsack Problems , 2002, Manag. Sci..

[13]  Matthew Cook,et al.  Self-Assembled Circuit Patterns , 2003, DNA.

[14]  Alessandra Carbone,et al.  Molecular Tiling and DNA Self-assembly , 2004, Aspects of Molecular Computing.

[15]  E. Winfree,et al.  Algorithmic Self-Assembly of DNA Sierpinski Triangles , 2004, PLoS biology.

[16]  XUJin,et al.  Solid phase based DNA solution of the coloring problem , 2004 .

[17]  Erik Winfree,et al.  Two computational primitives for algorithmic self-assembly: copying and counting. , 2005, Nano letters.

[18]  M. Fujise,et al.  Pattern reconfigurable leaky-wave antenna design by FDTD method and Floquet's Theorem , 2005, IEEE Transactions on Antennas and Propagation.

[19]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[20]  Rajeev Kumar,et al.  Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem , 2006, Theor. Comput. Sci..

[21]  Yuriy Brun.  Arithmetic computation in the tile assembly model: Addition and multiplication , 2007, Theor. Comput. Sci..

[22]  Majid Darehmiraki,et al.  Molecular solution to the 0-1 knapsack problem based on DNA computing , 2007, Appl. Math. Comput..

[23]  Ashish Goel,et al.  Toward minimum size self-assembled counters , 2007, Natural Computing.

[24]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[25]  Yuriy Brun.  Nondeterministic polynomial time factoring in the tile assembly model , 2008, Theor. Comput. Sci..

[26]  Yuriy Brun.  Solving NP-complete problems in the tile assembly model , 2008, Theor. Comput. Sci..

[27]  Daniel Vanderpooten,et al.  Solving efficiently the 0-1 multi-objective knapsack problem , 2009, Comput. Oper. Res..