ABSTRACT
The vehicle routing problem with split delivery and pick-up is a novel and interesting model in reverse logistics. In the model, the customer demand exceeds the vehicle load, so the customer demand needs to be split, which makes the vehicle routing assignment more flexible. Considering the complexity of the problem, the simulated annealing algorithm is improved to solve the problem. The two-stage coding is designed to effectively reduce the generation of infeasible solutions. The neighborhood search is applied to the local search strategy of simulated annealing to enhance the local search ability of the algorithm. The effectiveness of the model and algorithm is verified by the international standard example.
