Abstract
A shipper plans daily hub-to-hub transports within a hub and spoke network. Since a limited number of swap containers is available for transportation, two problems arise. 1. Swap containers have to be routed as pickup and delivery requests in multi-hub tours. 2. Day-by-day routing may lead to an imbalance of swap containers requiring a dynamic allocation. Neglecting interdependencies between vehicle routing and resource allocation seems inferior. An integration of the two problems overcomes this deficiency. We formulate mathematical models and propose integration approaches. The advantages of these approaches are discussed based on a computational study. (A) Reprinted with permission from Elsevier.