In the current ridesharing scenario, finding a compatible passenger is highly challenging and largely dependent on chance. Existing algorithms prioritize the shortest route without considering future requests or traffic conditions, which reduces the likelihood of matching with another compatible passenger. This uncertainty leads to increased congestion along shortest routes and fewer ridesharing trips overall. This paper proposes a route recommendation strategy that goes beyond the shortest route, aiming to address these issues. The proposed strategy results in higher demand, reduced congestion, broader coverage of points of interests, and an increased probability of finding compatible passengers during a trip. To achieve this, we introduce a time-series forecasting method leveraging a multi-task long short-term memory model to predict demand and traffic patterns in city-zone neighborhoods. These predictions are then used to recommend optimized routes. To evaluate our approach, we tested it on three datasets containing trip and traffic details from New York City, Los Angeles, and Shenzhen. Our model demonstrated 96% accuracy and a 2% RMSE loss in predicting the expected number of passengers. Furthermore, during route recommendations, we observed a 23% increase in passenger count for 97% of trips and a reduction in travel time for the shortest path in 60% of trips. In light of the above experimentation, we believe that while our approach recommends a longer route than the shortest one (for 40% cases), it helps taxi drivers to find compatible passengers on most trips which increases the profit of ridesharing services, and reduces the waiting time for passengers.