Optimal capacitated ring trees

Abstract

We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees. The objective is the minimization of edge costs but could also incorporate other types of measures. This overall problem generalizes prominent capacitated vehicle routing and Steiner tree problem variants. Two customer types have to be connected to a distributor ensuring single and double node connectivity, respectively, while installing optional Steiner nodes. The number of ring trees and the number of customers supplied by such a single structure are bounded. After embedding this combinatorial optimization model in existing network design concepts, we develop a mathematical formulation and introduce several valid inequalities for the CRTP that are separated in our exact algorithm. For a set of literature-derived instances we consider various reliability scenarios and present computational results.