Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem.

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.