In this work we propose the use of path relinking within a hyper-heuristic framework to solve the Generalised Time-Dependent Asymmetric Traveling Salesman problem applied to Air Travel. We implemented several heuristic selection methods, such as Simple Random, Random Descent, Random Permutation and Reinforcement Learning. We were able to achieve very good solutions for 13 of the 14 instances from a well-known benchmark set, evidencing that the adequate use of a hyper-heuristic framework with path relinking can be very efficient in improving the final results.