Hybrid Behavior Ant Colony Algorithm for Vehicle Routing Problem

Abstract

Vehicle Routing Problem (VRP) is one of critical problems in modern logistics service. In order to overcome the shortcomings of the basic Ant Colony Optimization (ACO) algorithm, which has long searching time and easily jumps into local optimal solution, a hybrid behavior ACO algorithm is presented for solving the VRP problem. A series of rules of the ants' behaviors are defined. The simulation results show that the above approach is reasonable and efficient.