This article concerns the location of satellite distribution centers (SDCs) to supply humanitarian aid to the affected people throughout a disaster area. In such situations, it is not possible for the relief teams to visit every single home. Instead, the people are required to go to a satellite distribution center in order to obtain survival goods, provided that these centers are not too far from their homes. The SDCs are usually within walking distance. However, these SDCs need to be supplied from a central depot, using a heterogeneous and capacitated fleet of vehicles. We model this situation as a generalization of the covering tour problem, introduce the idea of split delivery, and propose an efficient heuristic approach to solve it. Numerical experiments on randomly-generated data show that, first, only very small instances can be solved efficiently using the mathematical model and, second, our heuristic produces high-quality solutions and solves real-size instances in a reasonable computing time.

Keywords