Discrete Whale Optimization Algorithm for Capacitated Vehicle Routing Problem

Capacitated vehicle routing problem (CVRP) is a classical combinatorial optimization problem, which plays an important role in the logistics field and belongs to the NP-hard problem. Discrete whale optimization algorithm (DWOA) with a routing first and grouping later solution generating technique is proposed to handle the CVRP. The algorithm redefines the classical whale optimization algorithm's encircling prey method, bubble-net attacking method, and exploration phase method. Through the improved whale optimization algorithm, the optimal planning of logistics distribution vehicle routing is realized. Finally, an experimental demonstration of the DWOA algorithm's success offers a novel approach for resolving CVRP.