Multi-constraint vehicle routing problem based on improved honey badger algorithm

Aiming at the vehicle routing problem (VRP) in modern logistics system, this paper proposes a multi-constraint vehicle routing problem optimization model with time window, considering the diversity of cargo circulation and vehicle transportation efficiency, allowing vehicles to disperse operation at nodes and improve the transportation performance. In this paper, the improved honey badger algorithm (IHBA) is adopted to introduce Cubic chaotic mapping and random perturbation strategy, and the elite tangent search and differential variation strategy are adopted to enhance the global search and avoid premature convergence.IHBA Validates Potential to Solve Complex Vehicle routing Problems and Demonstrates Theoretical Practical Value of VRP Research and Logistics and Distribution at CEC2017.