International Journal of Engineering
Trends and Technology

Research Article | Open Access | Download PDF
Volume 74 | Issue 10 | Year 2026 | Article Id. IJETT-V74I10P129 | DOI : https://doi.org/10.14445/22315381/IJETT-V74I10P129

A Multi-Objective Ensemble Model to Suggest an Optimal Path for Private Ride-Hailing Services


K. Raghuraman, P. L. K. Priyadarsini, Meera Jasmine M

Received Revised Accepted Published
01 Jul 2026 12 Sep 2026 18 Sep 2026 27 Oct 2026

Citation :

K. Raghuraman, P. L. K. Priyadarsini, Meera Jasmine M, "A Multi-Objective Ensemble Model to Suggest an Optimal Path for Private Ride-Hailing Services," International Journal of Engineering Trends and Technology (IJETT), vol. 74, no. 10, pp. 403-421, 2026. Crossref, https://doi.org/10.14445/22315381/IJETT-V74I10P129

Abstract

Optimal path suggestion for taxi cabs being operated by private Fleet Management Services (FMS) seems a classical combinatorial problem, yet attracts researchers when more conflicting objectives are met. To improve the Quality of Service (QoS), the FMS employed a variety of strategies, compromising on some conflicting objectives, such as reducing passenger waiting time by having cabs cruise on roads, thereby increasing traffic, air, and noise pollution. To find an optimal solution for such kind of objectives, herewith a multi-objective optimization model is proposed. This model fuses the best features of Bio-inspired algorithms with Recurrent Neural Networks (RNNs) and Graph Neural Networks (GNNs), providing optimal paths for FMS cabs. The proposed model has been trained and tested on the 2024 Chicago Taxi trips and Traffic datasets, which were downloaded from the official Chicago government portal.s The Points of Interests (POIs) were crawled using the Google Maps API. Results showed that the proposed model outperformed the baseline model by reducing CO2 emissions by an average of 11.4%. In addition, the time taken to pick up is also reduced to a total of 3.70 km for the spatiotemporal parameters taken. These reductions indicate that the proposed model has minimized unnecessary cruising time, waiting time, and CO2 emissions to a greater extent. This model is modular, scalable, and provides balanced revenue for the FMS that runs in a resource-constrained environment.

Keywords

Forecasting traffic congestion areas, Graph Neural Networks, Heuristic algorithms, Recurrent Neural Networks, Ride-hailing services, Route suggestion for taxis.

References

  1. Shuofeng Wang et al., “Trajectory Analysis for On-Demand Services: A Survey Focusing on Spatial-Temporal Demand and Supply Patterns,” Transportation Research Part C: Emerging Technologies, vol. 108, pp. 74-99, 2019.
    [CrossRef] [Google Scholar] [Publisher Link]  
  2. Alireza Nejadettehad, Hamid Mahini, and Behnam Bahrak, “Short-Term Demand Forecasting for Online Car-hailing Services using Recurrent Neural Networks,” Applied Artificial Intelligence, vol. 34, no. 9, pp. 674-689, 2020.
    [CrossRef] [Google Scholar] [Publisher Link]   
  3. Jintao Ke et al., “Predicting Origin-Destination Ride-Sourcing Demand with a Spatio-Temporal Encoder-Decoder Residual Multi-Graph Convolutional Network,” Transportation Research Part C: Emerging Technologies, vol. 122, pp. 1-17, 2021.
    [CrossRef] [Google Scholar] [Publisher Link]    
  4. Zhen Zhang, and Yang Han, “Discrete Sparrow Search Algorithm for Symmetric Traveling Salesman Problem,” Applied Soft Computing, vol. 118, pp. 1-18, 2022.
    [CrossRef] [Google Scholar] [Publisher Link]     
  5. Boris Medina-Salgado et al., “Urban Traffic Flow Prediction Techniques: A Review,” Sustainable Computing: Informatics and Systems, vol. 35, pp. 1-16, 2022.
    [CrossRef] [Google Scholar] [Publisher Link]     
  6. R. Yesodha, and T. Amudha, “A Bio-Inspired Approach: Firefly Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows,” Computer Communications, vol. 190, pp. 48-56, 2022.
    [CrossRef] [Google Scholar] [Publisher Link]     
  7. Hongguang Wu, and Yuelin Gao, “An Ant Colony Optimization based on Local Search for the Vehicle Routing Problem with Simultaneous Pickup–Delivery and Time Window,” Applied Soft Computing, vol. 139, pp. 1-16, 2023.
    [CrossRef] [Google Scholar] [Publisher Link]      
  8. Youcef Djenouri et al., “Hybrid Graph Convolution Neural Network and Branch-and-Bound Optimization for Traffic Flow Forecasting,” Future Generation Computer Systems, vol. 139, pp. 100-108, 2023.
    [CrossRef] [Google Scholar] [Publisher Link]       
  9. Jinwei Qiao et al., “A Modified Particle Swarm Optimization Algorithm for a Vehicle Scheduling Problem with Soft Time Windows,” Scientific Reports, vol. 13, no. 1, pp. 1-18, 2023.
    [CrossRef] [Google Scholar] [Publisher Link]        
  10. Nicolás Frías, Franklin Johnson, and Carlos Valle, “Hybrid Algorithms for Energy Minimizing Vehicle Routing Problem: Integrating Clusterization and Ant Colony Optimization,” IEEE Access, vol. 11, pp. 125800-125821, 2023.
    [CrossRef] [Google Scholar] [Publisher Link]        
  11. Xiaohui Huang et al., “Multi-View Dynamic Graph Convolution Neural Network for Traffic Flow Prediction,” Expert Systems with Applications, vol. 222, pp. 1-14, 2023.
    [CrossRef] [Google Scholar] [Publisher Link]        
  12. Qichao Wu et al., “A Neighborhood Comprehensive Learning Particle Swarm Optimization for the Vehicle Routing Problem with Time Windows,” Swarm and Evolutionary Computation, vol. 84, pp. 1-16, 2024.
    [CrossRef] [Google Scholar] [Publisher Link]        
  13. Yufeng Wang et al., “Self-Competition Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window,” IEEE Access, vol. 12, pp. 127470-127488, 2024.
    [CrossRef] [Google Scholar] [Publisher Link]         
  14. Ting Liu, and Yuan Liu, “GMTP: Enhanced Travel Time Prediction with Graph Attention Network and BERT Integration,” AI, vol. 5, no. 4, pp. 2926-2944, 2024.
    [CrossRef] [Google Scholar] [Publisher Link]
  15. Dongwei Xu et al., “Hierarchical Spatio-Temporal Graph Convolutional Neural Networks for Traffic Data Imputation,” Information Fusion, vol. 106, pp. 1-11, 2024.
    [CrossRef] [Google Scholar] [Publisher Link]
  16. Tong Liu, and Hadi Meidani, “End-to-End Heterogeneous Graph Neural Networks for Traffic Assignment,” Transportation Research Part C: Emerging Technologies, vol. 165, pp. 1-14, 2024.
    [CrossRef] [Google Scholar] [Publisher Link] 
  17. Yu Qian, “Optimization of Logistics Distribution Scheme based on Improved Artificial Bee Colony Algorithm,” Procedia Computer Science, vol. 262, pp. 1381-1387, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]  
  18. Mingxuan Zhang, “Research on Vehicle Route Optimization for Half-Open Multi-Energy Urban Distribution Considering Order Priority,” IEEE Access, vol. 13, pp. 79007-79029, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]   
  19. Agnieszka Polowczyk, Alicja Polowczyk, and Marcin Woźniak, “Graph Neural Network via Dynamic Weights and LSTM with Attention for Traffic Forecasting,” Procedia Computer Science, vol. 257, pp. 119-126, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]    
  20. Hui Chen et al., “Urban Traffic Flow Prediction based on Multi-Spatio-Temporal Feature Fusion,” Neurocomputing, vol. 638, pp. 1-13, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]
  21. Guojun He et al., “Adaptive Spatial-Temporal Dependence Graph Convolution Neural Network for Traffic Flow Prediction,” Expert Systems with Applications, vol. 281, pp. 1-11, 2025.
    [CrossRef] [Google Scholar] [Publisher Link] 
  22. Tong Liu, and Hadi Meidani, “Graph Neural Networks for Travel Distance Estimation and Route Recommendation Under Probabilistic Hazards,” International Journal of Transportation Science and Technology, vol. 21, pp. 372-383, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]
  23. Linjie Zhang, and Jianfeng Ma, “A Spatiotemporal Graph Wavelet Neural Network for Traffic Flow Prediction,” Journal of Information and Intelligence, vol. 3, no. 2, pp. 173-188, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]
  24. Venkata Sai Sathvik Rajampalli, Akarsh Reddy Narra, and G.G. Jaffino, “A Spatio-Temporal GNN and Multi-Agent System Framework for Bottleneck Prediction and Signal Optimization in Bangalore,” Results in Engineering, vol. 28, pp. 1-15, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]
  25. Yuyan Annie Pan et al., “Urban Intersection Traffic Flow Prediction: A Physics-Guided Stepwise Framework Utilizing Spatio-Temporal Graph Neural Network Algorithms,” Multimodal Transportation, vol. 4, no. 2, pp. 1-20, 2025.
    [CrossRef] [Google Scholar] [Publisher Link] 
  26. Zhiyou Liu et al., “IWOA-RNN: An Improved Whale Optimization Algorithm with Recurrent Neural Networks for Traffic Flow Prediction,” Alexandria Engineering Journal, vol. 117, pp. 563-576, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]  
  27. Minghao Tong, Zhenhua Peng, and Qin Wang, “A Hybrid Artificial Bee Colony Algorithm with High Robustness for the Multiple Traveling Salesman Problem with Multiple Depots,” Expert Systems with Applications, vol. 260, pp. 1-18, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]   
  28. Shimon Komarovsky, and Jack Haddad, “Spatio-Temporal Graph Convolutional Neural Network for Traffic Signal Prediction in Large-Scale Urban Networks,” Transportation Research Interdisciplinary Perspectives, vol. 32, pp. 1-11, 2025.
    [CrossRef] [Google Scholar] [Publisher Link]    
  29. Xuhui Lin et al., “Field-Theory Inspired Physics-Informed Graph Neural Network for Reliable Traffic Flow Prediction under Urban Flooding,” Reliability Engineering and System Safety, vol. 265, pp. 1-22, 2026.
    [CrossRef] [Google Scholar] [Publisher Link]    
  30. Taxi Trips, Chicago Data Portal, 2026. [Online]. Available: https://data.cityofchicago.org/Transportation/Taxi-Trips-2024-/ajtu-isnz/about_data
  31. Chicago Traffic Tracker - Historical Congestion Estimates by Segment - 2024-Current, Data.Gov, 2026. [Online]. Available: https://catalog.data.gov/dataset/chicago-traffic-tracker-historical-congestion-estimates-by-segment-2024-current