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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
