An accelerated genetic algorithm for the vehicle routing problem

An accelerated genetic algorithm for the vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor19971885
Country: South Korea
Volume: 21
Issue: 1
Start Page Number: 101
End Page Number: 114
Publication Date: Apr 1996
Journal: Journal of the Korean ORMS Society
Authors: ,
Keywords: genetic algorithms
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.