A Hybrid Genetic Algorithm for Multi-compartment Open Vehicle Routing Problem with Time Window in Fresh Products Distribution

This paper introduces an multi-compartment open vehicle routing problem with time window (MCOVRPTW) arising in fresh products distribution, which doesn't require the finished service vehicles return to the distribution center. There are three types of fresh products to be delivered by the multi-compartment vehicles, and the objective aims to find the vehicles scheduling scheme with the lowest cost. For this problem, we established a mathematical model in which the capacity constraint of each compartment and time window constraint must be satisfied. Then, we proposed a hybrid genetic algorithm with some local search-based operators, called GA-LS, to solve it. Each individual in initial population was generated by the nearest neighborhood method to obtain high-quality initial population. When a child population was built, the local search procedure was executed on each individual in the child population to enhance its quality. Finally, we carried out some experiments to evaluate the effectiveness of the proposed algorithm. According to the results, the proposed algorithm can yield better solutions compared with existing approaches. Meanwhile, the proposed algorithm reveals good stability and convergence.