ETRI Journal

  • 제44권2호
  • /
  • Pages.220-231
  • /
  • 2022
  • /
  • 1225-6463(pISSN)
  • /
  • 2233-7326(eISSN)
한국전자통신연구원 (Electronics and Telecommunications Research Institute)
권호 표지
DOI QR코드

DOI QR Code

Novel online routing algorithms for smart people-parcel taxi sharing services

  • 투고 : 2021.10.28
  • 심사 : 2022.02.20
  • 발행 : 2022.04.10
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Building smart transportation services in urban cities has become a worldwide problem owing to the rapidly increasing global population and the development of Internet-of-Things applications. Traffic congestion and environmental concerns can be alleviated by sharing mobility, which reduces the number of vehicles on the road network. The taxi-parcel sharing problem has been considered as an efficient planning model for people and goods flows. In this paper, we enhance the functionality of a current people-parcel taxi sharing model. The adapted model analyzes the historical request data and predicts the current service demands. We then propose two novel online routing algorithms that construct optimal routes in real-time. The objectives are to maximize (as far as possible) both the parcel delivery requests and ride requests while minimizing the idle time and travel distance of the taxis. The proposed online routing algorithms are evaluated on instances adapted from real Cabspotting datasets. After implementing our routing algorithms, the total idle travel distance per day was 9.64% to 12.76% lower than that of the existing taxi-parcel sharing method. Our online routing algorithms can be incorporated into an efficient smart shared taxi system.

키워드

과제정보

This work has been supported by Vietnam National University, Hanoi (VNU), under Project No. QG.20.56

참고문헌

  1. J.-F. Cordeau and G. Laporte, The dial-a-ride problem (DARP): variants, modeling issues and algorithms, Quarterly J. Belgian, French Italian Oper. Res. Soc. 1 (2003), 89-101.
  2. E. Melachrinoudis, A. Ilhan, and H. Min, A dial-a-ride problem for client transportation in a health-care organization, Comput. Oper. Res. 34 (2007), 742-759. https://doi.org/10.1016/j.cor.2005.03.024
  3. L. Dahle, H. Andersson, M. Christiansen, and M. G. Speranza, The pickup and delivery problem with time windows and occasional drivers, Comput. Oper. Res. 109 (2019), 122-133. https://doi.org/10.1016/j.cor.2019.04.023
  4. M. Rahimi, M. Amirgholy, and E. J. Gonzales, System modeling of demand responsive transportation services: Evaluating cost efficiency of service and coordinated taxi usage, Trans. Res. Part E: Logistics Transp. Rev. 112 (2018), 66-83. https://doi.org/10.1016/j.tre.2018.02.005
  5. S. Ropke, J.-F. Cordeau, and G. Laporte, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks 49 (2007), 258-272. https://doi.org/10.1002/net.20177
  6. T. Gschwind and M. Drexl, Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem, Transp. Sci. 53 (2018), 480-491. https://doi.org/10.1287/trsc.2018.0837
  7. I. Malheiros, R. Ramalho, B. Passeti, T. Bulhes, and A. Subramanian, A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, Comput. Oper. Res. 129 (2021), 105196. https://doi.org/10.1016/j.cor.2020.105196
  8. K. H. Ting, L. S. Lee, S. Pickl, and H.-V. Seow, Shared mobility problems: a systematic review on types, variants, characteristics, and solution approaches, Appl. Sci. 11 (2021), no. 17. https://doi.org/10.3390/app11177996
  9. M. Ulmer, B. Thomas, A. Campbell, and N. Woyak, The restaurant meal delivery problem: dynamic pick-up and delivery with deadlines and random ready times, Transp. Sci. 55 (2020), no. 1. https://doi.org/10.1287/trsc.2020.1000
  10. K. O'Keeffe, S. Anklesaria, P. Santi, and C. Ratti, Using reinforcement learning to minimize taxi idle times, J. Intell. Trans. Syst. (2021), 1-16. https://doi.org/10.1080/15472450.2021.1897803
  11. X. Yu, S. Gao, X. Hu, and H. Park, A Markov decision process approach to vacant taxi routing with e-hailing, Transp. Res. Part B: Methodol. 121 (2019), 114-134. https://doi.org/10.1016/j.trb.2018.12.013
  12. B. Li, D. Krushinsky, H. Reijers, and T. Van Woensel, The share-a-ride problem: people and parcels sharing taxis, European J. Oper. Res. 238 (2014), no. 1, 31-40. https://doi.org/10.1016/j.ejor.2014.03.003
  13. B. Li, D. Krushinsky, T. Van Woensel, and H. Reijers, An adaptive large neighborhood search heuristic for the share-a-ride problem, Comput. Oper. Res. 66 (2015), 170-180. https://doi.org/10.1016/j.cor.2015.08.008
  14. N.-Q. Nguyen, N.-V.-D. Nghiem, P.-T. Do, T. Le Khac, M.-S. Nguyen, and N. Mukai, People and parcels sharing a taxi for Tokyo City, (Proceedings of the Sixth International Symposium on Information and Communication Technology, Hue City Viet Nam), 2015, pp. 90-97.
  15. S. Ross, A First Course in Probability, Ninth Edition. Pearson Prentice Hall, Upper Saddle River, NJ, USA, 2013, 117-187.
  16. F. Schoenberg, D. Brillinger, and P. Guttorp, Point processes, spatial-temporal, in Encyclopedia of Environmetrics, John Wiley & Sons, 2013.
  17. R. Goel and R. Maini, Vehicle routing problem and its solution methodologies: a survey, Int. J. Logistics Syst. Manag. 28 (2017), no. 4, 419-435. https://doi.org/10.1504/ijlsm.2017.087786