Solving Vehicle Routing Problem with Fuzzy Time Window Based on Discrete Multiverse Algorithm

Aiming at the actual situation of vehicle distribution in real life and the specific requirements of customers for service time, this paper proposes a discrete multiverse algorithm to solve the multi-depot vehicle routing problem with fuzzy time windows (MDVRPFTW) under the constraint of fuzzy time windows. Taking the lowest total cost and the largest customer satisfaction as the multi-objective function, a corresponding mathematical model is constructed for MDVRPFTW. Based on the traditional multiverse algorithm, this algorithm redefines the update strategy under the discrete vehicle routing problem. The experimental results show that the algorithm can better solve the vehicle routing problem of multiple distribution centers under the fuzzy time window constraint, and the result is better than other comparison algorithms, which proves that it has a strong optimization ability and practical application value.