Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/a-dna-based-algorithm-for-capacitated-vehicle-routing-problem-using-JaskXiiTLk
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1753-0822
- eISSN
- 1753-0830
- DOI
- 10.1504/IJSEM.2010.033373
- Publisher site
- See Article on Publisher Site
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.
Journal
International Journal of Services, Economics and Management – Inderscience Publishers
Published: Jan 1, 2010