The hub location is an important issue for the hub-and-spoke network optimization design, and hub covering is a type of the hub location problem. The uncertainty of the hub station construction costs and the uncertainty of the distance between two nodes are considered. The model of stochastic ?? -robust multiple allocation hub set covering problem is proposed with combination of stochastic optimization and robust optimization. Binary quantum-behaved particle swarm optimization algorithm is improved based on immunity thought. Immune quantum-behaved particle swarm optimization algorithm is proposed to solve the stochastic ??-robust multiple allocation hub set covering model. The simulation example of this model is given, and the result shows the feasibility and effectiveness of the proposed model and algorithm.