Solving Vehicle Routing Problem Through a Tabu Bee Colony-Based Genetic Algorithm

Vehicle routing problem (VRP) is a classic combinatorial optimization problem and has many applications in industry. Solutions of VRP have significant impact on logistic cost. In most VRP models, the shortest distance is used as the objective function, which is not the case in many real-word applications. To this end, a VRP model with fixed and fuel cost is proposed. Genetic algorithm (GA) is a common approach for solving VRP. Due to the premature issue in GA, a tabu bee colony-based GA is employed to solve this model. The improved GA has three characteristics that differentiate from other similar algorithms: (1) The maximum preserved crossover is proposed, to protect the outstanding sub-path and avoid the phenomenon that two identical individuals cannot create new individuals; (2) The bee evolution mechanism is introduced. The optimal solution is selected as the queen-bee and a number of outstanding individuals are as the drones. The utilization of excellent individual characteristics is improved through the crossover of queen-bee and drones; (3) The tabu search is applied to optimize the queen-bee in each generation of bees and improve the quality of excellent individuals. Thus the population quality is improved. Extensive experiments were conducted. The experimental results show the rationality of the model and the validity of the proposed algorithm.