1
|
Wang ZC, Wu X, Liang K, Wu TH. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem. IEEE Trans Nanobioscience 2024; 23:391-402. [PMID: 38709614 DOI: 10.1109/tnb.2024.3396142] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 05/08/2024]
Abstract
The traveling car renter problem (TCRP) is a variant of the Traveling Salesman Problem (TSP) wherein the salesman utilizes rented cars for travel. The primary objective of this problem is to identify a solution that minimizes the cumulative operating costs. Given its classification as a non-deterministic polynomial (NP) problem, traditional computers are not proficient in effectively resolving it. Conversely, DNA computing exhibits unparalleled advantages when confronted with NP-hard problems. This paper presents a DNA algorithm, based on the Adleman-Lipton model, as a proposed approach to address TCRP. The solution for TCRP can be acquired by following a series of fundamental steps, including coding, interaction, and extraction. The time computing complexity of the proposed DNA algorithm is O(n2m) for TCRP with n cities and m types of cars. By conducting simulation experiments, the solutions for certain instances of TCRP are computed and compared to those obtained by alternative algorithms. The proposed algorithm further illustrates the potential of DNA computing, as a form of parallel computing, to address more intricate large-scale problems.
Collapse
|
2
|
A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:1450756. [PMID: 36093485 PMCID: PMC9451995 DOI: 10.1155/2022/1450756] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/22/2022] [Revised: 07/21/2022] [Accepted: 07/22/2022] [Indexed: 11/17/2022]
Abstract
The quota traveling salesman problem (QTSP) is a variant of the traveling salesman problem (TSP), which is a classical optimization problem. In the QTSP, the salesman visits some of the n cities to meet a given sales quota Q while having minimized travel costs. In this paper, we develop a DNA algorithm based on Adleman-Lipton model to solve the quota traveling salesman problem. Its time complexity is O(n2+Q), which is a significant improvement over previous algorithms with exponential complexity. A coding scheme of element information is pointed out, and a reasonable biological algorithm is raised by using limited conditions, whose feasibility is verified by simulation experiments. The innovation of this study is to propose a polynomial time complexity algorithm to solve the QTSP. This advantage will become more obvious as the problem scale increases compared with the algorithm of exponential computational complexity. The proposed DNA algorithm also has the significant advantages of having a large storage capacity and consuming less energy during the operation. With the maturity of DNA manipulation technology, DNA computing, as one of the parallel biological computing methods, has the potential to solve more complex NP-hard problems.
Collapse
|
3
|
Jiang H, Lu M, Tian Y, Qiu J, Zhang X. An evolutionary algorithm for solving Capacitated Vehicle Routing Problems by using local information. Appl Soft Comput 2022. [DOI: 10.1016/j.asoc.2022.108431] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]
|
4
|
Hybrid Chaotic Discrete Bat Algorithm with Variable Neighborhood Search for Vehicle Routing Problem in Complex Supply Chain. APPLIED SCIENCES-BASEL 2021. [DOI: 10.3390/app112110101] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Driven by the supply chain, suppliers, manufacturers and warehouses are working more closely together for improving service quality. However, tremendous cost may incur in the supply chain if transportation is not planned properly and efficiently, which frustrates enterprises in the intense market. In this paper, we present a model of vehicle routing problem in complex supply chain (VRPCSC) and propose an intelligent algorithm called hybrid chaotic discrete bat algorithm with variable neighborhood search for minimizing the purchase cost of materials, processing cost, and delivery cost along the path from suppliers, to manufacturers and warehouses in the vehicle routing problem. Based on the principles of bat algorithm, a discrete chaotic initialization strategy (DCIS) and a variable neighborhood search (VNS) are adopted to enhance the convergence capacity. Finally, two sets of experiments are conducted, which show that the proposed algorithm can solve the VRPCSC effectively.
Collapse
|
5
|
Wu X, Wang Z, Wu T, Bao X. Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing. IEEE Trans Nanobioscience 2021; 21:75-85. [PMID: 34460379 DOI: 10.1109/tnb.2021.3109067] [Citation(s) in RCA: 12] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/05/2022]
Abstract
The Family Traveling Salesperson Problem (FTSP) is a variant of the Traveling Salesperson Problem (TSP), in which all vertices are divided into several different families, and the goal of the problem is to find a loop that concatenates a specified number of vertices with minimal loop overhead. As a Non-deterministic Polynomial Complete (NP-complete) problem, it is difficult to deal with it by the traditional computing. On the contrary, as a computer with strong parallel ability, the DNA computer has incomparable advantages over digital computers when dealing with NP problems. Based on this, a DNA algorithm is proposed to deal with FTSP based on the Adleman-Lipton model. In the algorithm, the solution of the problem can be obtained by executing several basic biological manipulations on DNA molecules with O(N2) computing complexity (N is the number of vertices in the problem without the origin). Through the simulation experiments on some benchmark instances, the results show that the parallel DNA algorithm has better performance than traditional computing. The effectiveness of the algorithm is verified by deducing the algorithm process in detail. Furthermore, the algorithm further proves that DNA computing, as one of the parallel computing methods, has the potential to solve more complex big data problems.
Collapse
|
6
|
Chang WL, Chen JC, Chung WY, Hsiao CY, Wong R, Vasilakos AV. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers. IEEE Trans Nanobioscience 2021; 20:354-376. [PMID: 33900920 DOI: 10.1109/tnb.2021.3075733] [Citation(s) in RCA: 7] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
Abstract
In this paper, we propose a bio-molecular algorithm with O( n2 + m ) biological operations, O( 2n ) DNA strands, O( n ) tubes and the longest DNA strand, O( n ), for solving the independent-set problem for any graph G with m edges and n vertices. Next, we show that a new kind of the straightforward Boolean circuit yielded from the bio-molecular solutions with m NAND gates, ( m +n × ( n + 1 )) AND gates and (( n × ( n + 1 ))/2) NOT gates can find the maximal independent-set(s) to the independent-set problem for any graph G with m edges and n vertices. We show that a new kind of the proposed quantum-molecular algorithm can find the maximal independent set(s) with the lower bound Ω ( 2n/2 ) queries and the upper bound O( 2n/2 ) queries. This work offers an obvious evidence for that to solve the independent-set problem in any graph G with m edges and n vertices, bio-molecular computers are able to generate a new kind of the straightforward Boolean circuit such that by means of implementing it quantum computers can give a quadratic speed-up. This work also offers one obvious evidence that quantum computers can significantly accelerate the speed and enhance the scalability of bio-molecular computers. Next, the element distinctness problem with input of n bits is to determine whether the given 2n real numbers are distinct or not. The quantum lower bound of solving the element distinctness problem is Ω ( 2n×(2/3) ) queries in the case of a quantum walk algorithm. We further show that the proposed quantum-molecular algorithm reduces the quantum lower bound to Ω (( 2n/2 )/( [Formula: see text]) queries. Furthermore, to justify the feasibility of the proposed quantum-molecular algorithm, we successfully solve a typical independent set problem for a graph G with two vertices and one edge by carrying out experiments on the backend ibmqx4 with five quantum bits and the backend simulator with 32 quantum bits on IBM's quantum computer.
Collapse
|
7
|
Wang Z, Wang D, Bao X, Wu T. A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2021. [DOI: 10.3233/jifs-200025] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Abstract
The vertex coloring problem is a well-known combinatorial problem that requires each vertex to be assigned a corresponding color so that the colors on adjacent vertices are different, and the total number of colors used is minimized. It is a famous NP-hard problem in graph theory. As of now, there is no effective algorithm to solve it. As a kind of intelligent computing algorithm, DNA computing has the advantages of high parallelism and high storage density, so it is widely used in solving classical combinatorial optimization problems. In this paper, we propose a new DNA algorithm that uses DNA molecular operations to solve the vertex coloring problem. For a simple n-vertex graph and k different kinds of color, we appropriately use DNA strands to indicate edges and vertices. Through basic biochemical reaction operations, the solution to the problem is obtained in the O (kn2) time complexity. Our proposed DNA algorithm is a new attempt and application for solving Nondeterministic Polynomial (NP) problem, and it provides clear evidence for the ability of DNA calculations to perform such difficult computational problems in the future.
Collapse
Affiliation(s)
- Zhaocai Wang
- State Key Laboratory of Simulation and Regulation of River Basin Water Cycle, China Institute of Water Resources and Hydropower Research, Beijing, P. R. China
- College of Information, Shanghai Ocean University, Shanghai, P. R. China
| | - Dangwei Wang
- State Key Laboratory of Simulation and Regulation of River Basin Water Cycle, China Institute of Water Resources and Hydropower Research, Beijing, P. R. China
| | - Xiaoguang Bao
- College of Information, Shanghai Ocean University, Shanghai, P. R. China
| | - Tunhua Wu
- School of Information Engineering, Wenzhou Business College, Wenzhou, P. R. China
| |
Collapse
|
8
|
A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2021. [DOI: 10.1155/2021/8814947] [Citation(s) in RCA: 6] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/18/2023]
Abstract
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.
Collapse
|
9
|
A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model. PLoS One 2020; 15:e0242083. [PMID: 33264317 PMCID: PMC7710087 DOI: 10.1371/journal.pone.0242083] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/16/2020] [Accepted: 10/27/2020] [Indexed: 11/19/2022] Open
Abstract
A DNA (DeoxyriboNucleic Acid) algorithm is proposed to solve the job shop scheduling problem. An encoding scheme for the problem is developed and DNA computing operations are proposed for the algorithm. After an initial solution is constructed, all possible solutions are generated. DNA computing operations are then used to find an optimal schedule. The DNA algorithm is proved to have an O(n2) complexity and the length of the final strand of the optimal schedule is within appropriate range. Experiment with 58 benchmark instances show that the proposed DNA algorithm outperforms other comparative heuristics.
Collapse
|
10
|
Zhang C, Wang Y, Deng W. Fault Diagnosis for Rolling Bearings Using Optimized Variational Mode Decomposition and Resonance Demodulation. ENTROPY 2020; 22:e22070739. [PMID: 33286510 PMCID: PMC7517282 DOI: 10.3390/e22070739] [Citation(s) in RCA: 14] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/08/2020] [Revised: 06/25/2020] [Accepted: 07/02/2020] [Indexed: 12/05/2022]
Abstract
It is difficult to extract the fault signal features of locomotive rolling bearings and the accuracy of fault diagnosis is low. In this paper, a novel fault diagnosis method based on the optimized variational mode decomposition (VMD) and resonance demodulation technology, namely GNVRFD, is proposed to realize the fault diagnosis of locomotive rolling bearings. In the proposed GNVRFD method, the genetic algorithm and nonlinear programming are combined to design a novel parameter optimization algorithm to adaptively optimize the two parameters of the VMD. Then the optimized VMD is employed to decompose the collected vibration signal into a series of intrinsic mode functions (IMFs), and the kurtosis value of each IMF is calculated, respectively. According to the principle of maximum value, two most sensitive IMF components are selected to reconstruct the vibration signal. The resonance demodulation technology is used to decompose the reconstructed vibration signal in order to obtain the envelope spectrum, and the fault frequency of locomotive rolling bearings is effectively obtained. Finally, the actual data of rolling bearings is selected to testify the effectiveness of the proposed GNVRFD method. The experiment results demonstrate that the proposed GNVRFD method can more accurately and effectively diagnose the fault of locomotive rolling bearings by comparing with other fault diagnosis methods.
Collapse
Affiliation(s)
- Chunguang Zhang
- School of Electronics and Information Engineering, Dalian Jiaotong University, Dalian 116028, China; (C.Z.); (Y.W.)
- Traction Power State Key Laboratory of Southwest Jiaotong University, Chengdu 610031, China
| | - Yao Wang
- School of Electronics and Information Engineering, Dalian Jiaotong University, Dalian 116028, China; (C.Z.); (Y.W.)
| | - Wu Deng
- School of Electronics and Information Engineering, Dalian Jiaotong University, Dalian 116028, China; (C.Z.); (Y.W.)
- Traction Power State Key Laboratory of Southwest Jiaotong University, Chengdu 610031, China
- Correspondence:
| |
Collapse
|
11
|
Innovation Mode and Optimization Strategy of B2C E-Commerce Logistics Distribution under Big Data. SUSTAINABILITY 2020. [DOI: 10.3390/su12083381] [Citation(s) in RCA: 12] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/13/2022]
Abstract
With the advent of big data era and rapid development of Internet technology, e-commerce has had a strong development tendency that causes many problems, such as redundant and complex business processes, low efficiency and a high cost for e-commerce logistics in the distribution sector. It is not difficult to conclude that the key to improving logistics distribution efficiency—and reduce logistics distribution costs—is to optimize logistics distribution under big data. In this study, the management model, influence factors and development status of B2C e-commerce logistics distribution under big data are analyzed in detail. Then big data processing, business process and route optimization strategies for B2C e-commerce logistics distribution under big data are deeply studied. Furthermore, an optimization model of product sales and logistics distribution of B2C e-commerce by big data platform is discussed in order to propose an innovative optimization strategy for B2C e-commerce logistics distribution under big data. Big data technology is applied in B2C e-commerce logistics business management, which is studied in detail. These findings achieve the optimal distribution of B2C e-commerce, reduce the B2C e-commerce logistics distribution cost and improve the B2C e-commerce logistics distribution efficiency under big data. In addition, enhanced competitiveness of B2C e-commerce logistics distribution is examined in this study. This study provides a reference for follow-up big data studies in the field of e-commerce.
Collapse
|