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.
On the performance of artificial ant colony to solve the dynamic vehicle routing problem
01.05.2011
257243 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
An Approach to Solve the Dynamic Vehicle Routing Problem
British Library Conference Proceedings | 1998
|ANT COLONY OPTIMIZATION METHOD AND SPLIT-DELIVERY VEHICLE ROUTING PROBLEM
British Library Online Contents | 2009
|