By Topic

A New Algorithm for Vehicle Routing Problems with Capacity Limited Based on Minimum Spanning Tree

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)
Yang Yuewu ; Foshan Univ. of Electromech. & Inf. Eng., Foshan, China

An optimized strategy is proposed to investigate the vehicle routing problems. We build here a Conversion of the Complex road network with minimum spanning trees and decision to search the nearest approach. An algorithm is developed to obtain min-spanning from spanning trees. By tagging the min-spanning tree, we obtain the optimized route such that the cycle capacity keeps minimum value. The corresponding algorithm is realized with the Development tool of Jbuilder 9, which shows that our algorithm proposed here is valid and concise, and simplifies the complexity of previous results.

Published in:

Optoelectronics and Image Processing (ICOIP), 2010 International Conference on  (Volume:1 )

Date of Conference:

11-12 Nov. 2010