This PhD research explores the two-echelon cyclic inventory routing problem (2E-CIRP). In the cyclic inventory routing problem (CIRP), customers with stable demand rates are partitioned into groups that are jointly replenished in a route that is repeated cyclically. The aim is to minimize total costs, including fixed vehicle expenses, route-specific costs, and inventory holding costs at customers. In the 2E-CIRP, goods are transported from suppliers to one or more distribution centers, from which the cyclic replenishments to the end customers are initiated. In this two-echelon model, the inbound deliveries to the distribution center(s) have to be coordinated with the outbound routes being cyclically repeated. In this extended problem, the total cost to be minimized then also includes inbound shipment costs and inventory holding costs at the distribution center(s). A mathematical model will be developed for several variants of the 2E-CIRP, as well as heuristic and metaheuristic algorithms to efficiently solve small and large instances. The performance of the proposed methods will be evaluated through extensive numerical experiments.