Develop two approximation techniques to solve instances of the Single Allocation p-Hub Location Problem. (On python)

Develop two approximation techniques to solve a number of instances of the aforementioned problem. You are free to choose your solution technique(s) however, the two methods must be either individual-based(e.g., SA&VNS) or population-based(e.g., GA&PSO) metaheuristics and/or a combination of the two types of methods (e.g., SA&GA). Evaluate and compare the performance of the two developed techniques. Perform a brief literature review on the problem and a wider review on the approximation techniques and write a report on your findings.