scholarly journals A Molecular Computing Approach to Solving Optimization Problems via Programmable Microdroplet Arrays

Author(s):  
Si Yue Guo ◽  
Pascal Friederich ◽  
Yudong Cao ◽  
Tony Wu ◽  
Christopher Forman ◽  
...  

The search for novel forms of computing that show advantages as alternatives to the dominant von-Neuman model-based computing is important as it will enable different classes of problems to be solved. By using droplets and room-temperature processes, molecular computing is a promising research direction with potential biocompatibility and cost advantages. In this work, we present a new approach for computation using a network of chemical reactions taking place within an array of spatially localized droplets whose contents represent bits of information. Combinatorial optimization problems are mapped to an Ising Hamiltonian and encoded in the form of intra- and inter- droplet interactions. The problem is solved by initiating the chemical reactions within the droplets and allowing the system to reach a steady-state; in effect, we are annealing the effective spin system to its ground state. We propose two implementations of the idea, which we ordered in terms of increasing complexity. First, we introduce a hybrid classical-molecular computer where droplet properties are measured and fed into a classical computer. Based on the given optimization problem, the classical computer then directs further reactions via optical or electrochemical inputs. A simulated model of the hybrid classical-molecular computer is used to solve boolean satisfiability and a lattice protein model. Second, we propose architectures for purely molecular computers that rely on pre-programmed nearest-neighbour inter-droplet communication via energy or mass transfer.

2019 ◽  
Author(s):  
Si Yue Guo ◽  
Pascal Friederich ◽  
Yudong Cao ◽  
Tony Wu ◽  
Christopher Forman ◽  
...  

The search for novel forms of computing that show advantages as alternatives to the dominant von-Neuman model-based computing is important as it will enable different classes of problems to be solved. By using droplets and room-temperature processes, molecular computing is a promising research direction with potential biocompatibility and cost advantages. In this work, we present a new approach for computation using a network of chemical reactions taking place within an array of spatially localized droplets whose contents represent bits of information. Combinatorial optimization problems are mapped to an Ising Hamiltonian and encoded in the form of intra- and inter- droplet interactions. The problem is solved by initiating the chemical reactions within the droplets and allowing the system to reach a steady-state; in effect, we are annealing the effective spin system to its ground state. We propose two implementations of the idea, which we ordered in terms of increasing complexity. First, we introduce a hybrid classical-molecular computer where droplet properties are measured and fed into a classical computer. Based on the given optimization problem, the classical computer then directs further reactions via optical or electrochemical inputs. A simulated model of the hybrid classical-molecular computer is used to solve boolean satisfiability and a lattice protein model. Second, we propose architectures for purely molecular computers that rely on pre-programmed nearest-neighbour inter-droplet communication via energy or mass transfer.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Zhaocai Wang ◽  
Xiaoguang Bao ◽  
Tunhua Wu

The Chinese postman problem is a classic resource allocation and scheduling problem, which has been widely used in practice. As a classical nondeterministic polynomial problem, finding its efficient algorithm has always been the research direction of scholars. In this paper, a new bioinspired algorithm is proposed to solve the Chinese postman problem based on molecular computation, which has the advantages of high computational efficiency, large storage capacity, and strong parallel computing ability. In the calculation, DNA chain is used to properly represent the vertex, edge, and corresponding weight, and then all possible path combinations are effectively generated through biochemical reactions. The feasible solution space is obtained by deleting the nonfeasible solution chains, and the optimal solution is solved by algorithm. Then the computational complexity and feasibility of the DNA algorithm are proved. By comparison, it is found that the computational complexity of the DNA algorithm is significantly better than that of previous algorithms. The correctness of the algorithm is verified by simulation experiments. With the maturity of biological operation technology, this algorithm has a broad application space in solving large-scale combinatorial optimization problems.


Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 225
Author(s):  
José García ◽  
Gino Astorga ◽  
Víctor Yepes

The optimization methods and, in particular, metaheuristics must be constantly improved to reduce execution times, improve the results, and thus be able to address broader instances. In particular, addressing combinatorial optimization problems is critical in the areas of operational research and engineering. In this work, a perturbation operator is proposed which uses the k-nearest neighbors technique, and this is studied with the aim of improving the diversification and intensification properties of metaheuristic algorithms in their binary version. Random operators are designed to study the contribution of the perturbation operator. To verify the proposal, large instances of the well-known set covering problem are studied. Box plots, convergence charts, and the Wilcoxon statistical test are used to determine the operator contribution. Furthermore, a comparison is made using metaheuristic techniques that use general binarization mechanisms such as transfer functions or db-scan as binarization methods. The results obtained indicate that the KNN perturbation operator improves significantly the results.


Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1456
Author(s):  
Stefka Fidanova ◽  
Krassimir Todorov Atanassov

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yoshihiko Imanaka ◽  
Toshihisa Anazawa ◽  
Fumiaki Kumasaka ◽  
Hideyuki Jippo

AbstractTailored material is necessary in many industrial applications since material properties directly determine the characteristics of components. However, the conventional trial and error approach is costly and time-consuming. Therefore, materials informatics is expected to overcome these drawbacks. Here, we show a new materials informatics approach applying the Ising model for solving discrete combinatorial optimization problems. In this study, the composition of the composite, aimed at developing a heat sink with three necessary properties: high thermal dissipation, attachability to Si, and a low weight, is optimized. We formulate an energy function equation concerning three objective terms with regard to the thermal conductivity, thermal expansion and specific gravity, with the composition variable and two constrained terms with a quadratic unconstrained binary optimization style equivalent to the Ising model and calculated by a simulated annealing algorithm. The composite properties of the composition selected from ten constituents are verified by the empirical mixture rule of the composite. As a result, an optimized composition with high thermal conductivity, thermal expansion close to that of Si, and a low specific gravity is acquired.


2021 ◽  
Vol 11 (9) ◽  
pp. 4169
Author(s):  
Hirotaka Takano ◽  
Junichi Murata ◽  
Kazuki Morishita ◽  
Hiroshi Asano

The recent growth in the penetration of photovoltaic generation systems (PVs) has brought new difficulties in the operating and planning of electric power distribution networks. This is because operators of the distribution networks normally cannot monitor or control the output of the PVs, which introduces additional uncertainty into the available information that operations must rely on. This paper focuses on the service restoration of the distribution networks, and the authors propose a problem framework and its solution method that finds the optimal restoration configuration under extensive PV installation. The service restoration problems have been formulated as combinatorial optimization problems. They do, however, require accurate information on load sections, which is impractical in distribution networks with extensively installed PVs. A combined framework of robust optimization and two-stage stochastic programming adopted in the proposed problem formulation enables us to deal with the PV-originated uncertainty using readily available information only. In addition, this problem framework can be treated by a traditional solution method with slight extensions. The validity of the authors’ proposal is verified through numerical simulations on a real-scale distribution network model and includes a discussion of their results.


Sign in / Sign up

Export Citation Format

Share Document