An Accelerated Genetic Algorithm for the Vehicle Routing Problem

An Accelerated Genetic Algorithm for the Vehicle Routing Problem

This study suggests an accelerated genetic algorithm for the vehicle routing problem (AGAVRP). This algorithm treats both the single-visit and the multiple-visit models. AGAVRP is accelerated by the OR techniques at the various stages of the algorithm. In order to improve the convergence of AGAVRP, a robust set of parameters is determined by the experimental design approach. The relative performance of AGAVRP is comparable to the other known algorithms. The advantage of the proposed algorithm is flexibility and better convergence.

(0)

(0)

(0)

(0)