This paper addresses a recently introduced problem called traveling repairman problem with profits (TRPP). The problem can be regarded as a variation of the well-known traveling salesman problem, where a repairman does not need to visit all the nodes. In TRPP, each node is linked with a profit, which is time-dependent. The objective of TRPP is to maximize the total revenue obtained. Our approach uses a greedy randomized construction method to generate the initial solution. A hyper-heuristic approach with a greedy selection mechanism (HH-GREEDY) is used for iteratively improving the solution. TRPP instances available in literature are utilized to evaluate the effectiveness of the proposed approach. Our approach obtained solutions of quality comparable to the state-of-the-art approaches at a fraction of time needed by these approaches.