A hybrid genetic algorithm that optimizes capacitated vehicle routing problems

摘要

This study primarily focuses on solving a capacitated vehicle routing problem (CVRP) by applying a novel hybrid genetic algorithm (HGA) capable of practical use for manufacturers. The proposed HGA has three stages. First, the nearest addition method (NAM) was incorporated into sweep algorithm (SA) that simultaneously accounts for axial and radius relationships among distribution points with the depot to generate a well-structured initial chromosome population, rather than adopting either the NAM OR SA alone. Second, response surface methodology (RSM) was employed to optimize crossover probability and mutation probability via systematic experiments. Finally, an improved sweep algorithm was incorporated into the GA, producing a stir over gene permutations in chromosomes that enhance the exploration diversity of the GA, thereby avoiding convergence in a limited region, and enhancing the search capability of the GA in approaching a close-to-optimal solution. Furthermore, an elitism conservation strategy holding superior chromosomes to replace inferior chromosomes was also performed. As the proposed HGA is primarily used to solve practical problem, benchmark problems with fewer than 100 distribution points from an Internet website were utilized to confirm the effectiveness of the proposed HGA. A real case regarding the mission of local active distribution from armed forces in Taiwan details the analytical process and demonstrates the practicability of the proposed HGA to optimize the CVRP.