In recent years, Learning to Rank has not only shown effectiveness and better suitability for modern Web Era needs, but also has proved that it outperforms traditional ranking in terms of accuracy and efficiency. Evolutionary approach to Learning to Rank such as RankGP  and RankDE  have shown further improvement over non-evolutionary algorithms. However when Evolutionary algorithms have been applied to a large volume of data, often they showed they required so much computational efforts that they were not worth applying to industrial applications. In this thesis, we present RankGPES: a Learning to Rank algorithm based on a hybrid approach combining Genetic Programming with Evolution Strategies. Our results not only showed that it outperformed both RankGP  by 20% and RankDE  by 6% in terms of accuracy but also it showed it required significant less amount of time to converge to a near-optimal result.