In literature, combinatorial optimization problems have been solved using several hybrid strategies. From the principles of software engineering, it is explicit that modelling enables better understanding of the problem’s solution as well as the various parts that constitute the solution. However, the literature reveals that there is less importance attached to modelling the problem’s solution while solving combinatorial optimization problems using hybrid strategies. Therefore, in order to better understand the advantages and significance of using a model based approach in solving such problems, a survey on model based approach and the various properties achieved by modelling has been carried out. A comparison of the algorithm or technique based approach, framework based approach and model based approach is done to better understand the differences between the approaches and their outcomes. From the comparison made between the approaches and the analysis made on the advantages of using a model based approach in solving combinatorial optimization problems using hybrid strategies, it is found that a model based approach gives clear and better understanding of complex problems by making their representation easily modular, understandable, adaptable, verifiable, reliable, customizable, reusable etc. Further, when hybrid strategies are used, and the problems solution is depicted in the form of a model, every part of the model could be implemented using different algorithms and frameworks, thus aiding to identify the optimal algorithm or framework for every part of the model, as well as the most efficient hybrid combination that solves the whole problem in an optimal manner.