Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Ant colony optimization technique to solve the min-max Single Depot Vehicle Routing Problem

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

2 Author(s)
Narasimha, K.S.V. ; Univ. of Cincinnati, Cincinnati, OH, USA ; Kumar, M.

This paper implements a swarm intelligence based algorithm called ant colony optimization to solve the min-max Single Depot Vehicle Routing Problem (SDVRP). A traditional SDVRP tries to minimize the total distance travelled by all the vehicles to all customer locations. The min max SDVRP, on the other hand, tries to minimize the maximum distance travelled by any vehicle. This problem is of specific significance for time-critical applications where one wants to minimize the time taken to attend any customer. The algorithm developed is an extension of SDVRP algorithm developed by Bullnheimer et al. in 1997 based upon ant colony optimization. A computer simulation model using the MATLAB is developed. A comparative study is carried out to evaluate the proposed algorithm's performance with respect to the algorithm developed by Carlsson et al. in terms of the optimality of solution and time taken to reach the solution.

Published in:

American Control Conference (ACC), 2011

Date of Conference:

June 29 2011-July 1 2011