同时送取货选址路径问题及混合免疫算法.

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, this paper established a location-routing problem with simultaneous pickup and delivery model to minimize the sum of location cost, routing cost and transportation cost. For solving this model, this paper developed a HIA. It generated the initial solution by greedy clustering algorithm, and evaluated and sorted the antibody by the original immune algorithm. And it improved the immune operation of the original algorithm by the neighborhood search operation. Finally, this paper verified the feasibility of the model and the effectiveness of the algorithm by using the HIA, the original immune algorithm, the simulated annealing algorithm and the ant colony algorithm. . [ABSTRACT FROM AUTHOR]