By Topic

Solving Capacitated Vehicle Routing Problem Using DNA-based Computation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chung-Wei Yeh ; Dept. of Manage. Inf. Syst., Kao Yuan Univ., Kaohsiung

The vehicle routing problem is one of the most challenging optimization tasks involved in searching optimal route sets in operational research. The objective of solving capacitated vehicle routing problem (CVRP) is to identify a set of shortest paths for a fleet of individual vehicles with fixed capacity from a central depot that serve all customer demand. This study describes a deoxyribonucleic acid (DNA) computing model, a modified Adleman-Lipton model, for calculating path distance with respect to vertex set of given paths with embedded capacity constraint, exponentially accelerating the search for the solution of CVRP with large nodes by executing molecular operation in parallel processing. This work provided molecular solutions via four steps: (1) generating the solution space of all partial paths, (2) collecting feasible paths, (3) calculating vertices capacity, and (4) gathering strands with the minimum distance.

Published in:

Information Management and Engineering, 2009. ICIME '09. International Conference on

Date of Conference:

3-5 April 2009