Abstract: Warehouse network must deal with frequent network disruption and network segmentation, which can be solved with DTN. However, scheduled ferry mobility is of probabilistic uncertain, so that the knowledge oracle in warehouse network, that DTN routing algorithms need, shows complex. So a space-based routing algorithm with location information is proposed to eliminate it. Access router information matrixes in path predictable environment are designed to decided k-anycast router aggregate, so that the generalized k-anycast can moderate traffic explosion. Utility maximization model allocates bandwidth resources to k eligible access routers in access period, with DTN custody transfer, can be transmitted packets simultaneously to multiple destination. Simulations show that it gains better transmission performance and robustness and more flexibility to support warhouse network topology changes.