Locally repairable codes with hierarchical locality (H-LRCs) are designed to correct different numbers of erasures, which play a crucial role in large-scale distributed storage systems. In this paper, we construct three classes of$q$-ary optimal H-LRCs by employing matrix product codes, concatenated codes and cyclic codes, respectively. The first two constructions are based on the idea of constructing new codes from old, which produces several new classes of optimal H-LRCs whose lengths can reach up to$q^{2}+q$or unbounded. The final construction generates a class of new optimal cyclic H-LRCs whose lengths divide$q-1$. Compared with the previously known ones, our constructions are new in the sense that their parameters are not covered by the codes available in the literature.