Abstract
Recently, Hierarchical Optimization Models (HOM) have been widely used to model Combinatorial Optimization Problems (COP) in numerous fields including transport, supply chain economics, healthcare, etc. Their efficiency as a modeling approach is justified by their ability to ease the difficulty of the studied COP. The main problem will be decomposed hierarchically into a set of interconnected subproblems using multiple decomposition strategies. However, solving the hierarchical optimization model presents a great challenge and difficult task to get an optimal solution for the main problem. In this context, we propose a generic algorithm to efficiently solve the hierarchical optimization model. Moreover, the developed algorithm will be able to solve all kinds of hierarchical optimization models using any decomposition strategy. To validate the proposed modeling and solving approach, we solved the Home Health Care Scheduling Problem (HCSP) by conducting some experiments on a set of real-world data instances.