Multi-constrained Vehicle Routing Problem Solution based on Adaptive Genetic Algorithm

Abstract

The Multi-constrained Vehicle Routing Problem (MCVRP) is an extension of the basic vehicle routing problem (VRP). There may be more than one constraint, and the distribution cost is not only related to the routing decision, but also to the transportation volume of vehicles. This paper describes and analyzes the MCVRP, then builds an integer programming model of the multi-constraint vehicle routing problem. For this problem model, the best algorithm for solving multi-constrained vehicle routing problems is based on genetic algorithm (GA). To overcome the shortcomings of traditional GA, an improved adaptive GA for MCVRP optimization is proposed. Finally, a simulation experiment was performed on the actual data set to verify the effectiveness of the model and algorithm.