By Topic

On the performance of artificial ant colony to solve the dynamic 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
$33 $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

3 Author(s)
Jalel Euchi ; Sfax University, GIAD Laboratory, Tunisia ; Adnan Yassine ; Habib Chabchoub

In this paper we describe an alternative variant dynamic Pickup and Delivery strategy of Vehicle Routing Problem (DVRP) which arises when new customers appear in the tours after starting visit. We propose an Artificial Ant Colony based on 2-Opt local search (AAC-2-Opt) to solve the DVRP. We demonstrate the effectiveness of our approach by comparing its results with those of existing methods in literature on the same tests problems. The proposed algorithm can efficiently optimize the routing problem and provide highly competitive solutions.

Published in:

2011 4th International Conference on Logistics

Date of Conference:

May 31 2011-June 3 2011