A vehicle routing problem solved by using a hybrid genetic algorithm

作者：Jeon Geonwook^*; Leep Herman R; Shim Jae Young

来源：Computers & Industrial Engineering, 2007, 53(4): 680-692.

DOI：10.1016/j.cie.2007.06.031

• hybrid genetic algorithm
• heterogeneous VRP
• multiple depots
• double trips

The main purpose of this study is to find out the best solution of the vehicle routing problem simultaneously considering heteroaeneous vehicles, double trips, and multiple depots by using a hybrid genetic algorithm. This study suggested a mathematical programming model with a new numerical formula which presents the amount of delivery and sub-tour elimination. This model gives an optimal solution by using OPL-STUDIO(ILOG CPLEX). This study also suggests a hybrid genetic algorithm (HGA) which considers the improvement of generation for an initial solution, three different heuristic processes, and a float mutation rate for escaping from the local solution in order to find the best solution. The suggested HGA is also compared with the results of a general genetic algorithm and existing problems suggested by Eilon and Fisher. We found better solutions rather than the existing genetic algorithms.

• 出版日期2007-11
• 单位中国人民解放军国防大学