Title: A DNA-based algorithm for capacitated vehicle routing problem using temperature gradient technique
Authors: B.S.E. Zoraida, Michael Arock, B.S.M. Ronald, R. Ponalagusamy
Addresses: Department of Computer Applications, National Institute of Technology, Thiruchirappalli, Tamil Nadu, India. ' Department of Computer Applications, National Institute of Technology, Thiruchirappalli, Tamil Nadu, India. ' Vaccine Research Centre, TANUVAS, Chennai 600 051, Tamil Nadu, India. ' Department of Mathematics, National Institute of Technology, Thiruchirappalli, Tamil Nadu, India
Abstract: The biological Deoxyribo Nucleic Acid (DNA) strand is found to be a promising computing unit. An attempt has been made in this paper to solve Capacitated Vehicle Routing Problem (CVRP). This difficult combinatorial problem combines both the Bin Packing Problem (BPP) and the Multiple Travelling Salesman Problem (MTSP). In this paper, the thermodynamic properties of DNA have been utilised for the first time, along with other bio-chemical operations to obtain the optimal solution. Thermodynamics properties of DNA strand helps to use actual numerical values for distance. Moreover, the proposed approach can be adopted to solve more real-life applications like scheduling problems, with necessary modifications. In this work, a case study of a CVRP having seven customers and three vehicles with the same capacity has been solved to validate the proposed approach. This method exhibits the ability to solve complex combinatorial problems using molecular computing.
Keywords: capacitated vehicle routing problem; multiple travelling salesman problem; DNA computing; optimal paths; DNA operations; temperature gradient; bin packing problem; thermodynamics; scheduling.
International Journal of Services, Economics and Management, 2010 Vol.2 No.3/4, pp.371 - 384
Available online: 01 Jun 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article