Research on Hybrid Immune Algorithm for Solving the Location-Routing Problem With Simultaneous Pickup and Delivery

In the simultaneous pickup and delivery problem, every customer has both delivery demand and pick-up demand, and both demands need to be served simultaneously. Under this condition, a locationrouting problem with simultaneous pickup and delivery model was established to minimize the sum of location cost, routing cost, and transportation cost. For solving this model, a hybrid immune algorithm was developed. The initial solution was generated by greedy clustering algorithm, the antibody was evaluated and sorted by the original immune algorithm, and the immune operation of the original algorithm was improved by the neighborhood search operation. Finally, the feasibility of the model and the effectiveness of the algorithm were verified by using the hybrid immune algorithm, the original immune algorithm, the simulated annealing algorithm, and the ant colony algorithm.