Publication Cover
Transportation Letters
The International Journal of Transportation Research
Volume 14, 2022 - Issue 2
454
Views
5
CrossRef citations to date
0
Altmetric
Article

Clustered tabu search optimization for reservation-based shared autonomous vehicles

, ORCID Icon, ORCID Icon, & ORCID Icon

References

  • Ali, A., and F. Hamed. 2019. “The Close–open Mixed Multi Depot Vehicle Routing Problem considering Internal and External Fleet of Vehicles.” Transportation Letters 11 (2): 78–92.
  • Bongiovanni, C., M. Kaspi, and N. Geroliminis. 2019. “The Electric Autonomous Dial-a-ride Problem.” Transportation Research Part B: Methodological 122: 436–456.
  • Cordeau., J. F. 2006. “A Branch-and-Cut Algorithm for the Dial-A-Ride Problem.” Operations Research 54 (3): 573–586.
  • Cordeau, J. F., and G. Laporte. 2003. “A Tabu Search Heuristic for the Static Multi-vehicle Dial-A-ride Problem.” Transportation Research Part B: Methodological 37 (6): 579–594.
  • Cordeau, J. F., and G. Laporte. 2007. “The Dial-a-ride Problem: Models and Algorithms.” Annals of Operations Research 153 (1): 29–46.
  • Farhan, J., and T. Donna Chen. 2018. “Impact of Ridesharing on Operational Efficiency of Shared Autonomous Electric Vehicle Fleet.” Transportation Research Part C: Emerging Technologies 93: 310–321.
  • Fazlollahtabar, H. 2018. “Lagrangian Relaxation Method for Optimizing Delay of Multiple Autonomous Guided Vehicles.” Transportation Letters 10 (6): 354–360.
  • Forgy, E. 1965. “Cluster Analysis of Multivariate Data: Efficiency versus Interpretability of Classification.” Biometrics 21 (3): 768–769.
  • Ho, S. C., W. Y. Szeto, Y. H. Kuo, J. M. Y. Leung, M. Petering, and T. W. H. Tou. 2018. “A Survey of Dial-A-ride Problems: Literature Review and Recent Developments.” Transportation Research Part B: Methodological 1–27.
  • Hong, S., L. Zhou, S. Ma, N. Jia, L. Zhang, and B. Yao. 2018. “The Optimization of Bus Rapid Transit Route Based on an Improved Particle Swarm Optimization.” Transportation Letters 10 (5): 257–268.
  • Hyland, M., and H. S. Mahmassani. 2018. “Dynamic Autonomous Vehicle Fleet Operations: Optimization-based Strategies to Assign Avs to Immediate Traveler Demand Requests.” Transportation Research Part C: Emerging Technologies 92: 278–297.
  • Jorgensen, R. M., J. Larsen and Bergvinsdottir K. B. 2007 October. “Solving the Dial-a-ride Problem Using Genetic Algorithms.” Journal of the Operational Research Society 58 (10): 1321–1331. doi:https://doi.org/10.1057/palgrave.jors.2602287.
  • Kergosien, Y., C. Lenté, and J. C. Billaut. 2008. “A Tabu Search Algorithm for Solving A Transportation Problem of Patients between Care Units.”
  • Kirchler, D., and R. Wolfler Calvo. 2013. “A Granular Tabu Search Algorithm for the Dial-A-Ride Problem.” Transportation Research Part B: Methodological 56: 120–135. doi:https://doi.org/10.1016/j.trb.2013.07.014.
  • Levin, M. W. 2017. “Congestion-aware System Optimal Route Choice for Shared Autonomous Vehicles.” Transportation Research Part C: Emerging Technologies 82: 229–247. doi:https://doi.org/10.1016/j.trc.2017.06.020.
  • Ma, J., X. Li, F. Zhou, and W. Hao. 2017. “Designing Optimal Autonomous Vehicle Sharing and Reservation Systems: A Linear Programming Approach.” Transportation Research Part C: Emerging Technologies 84: 124–141. doi:https://doi.org/10.1016/j.trc.2017.08.022.
  • Masoud, N., and R. Jayakrishnan. 2017. “A Decomposition Algorithm to Solve the Multi-hop Peer-to-Peer Ride-matching Problem.” Transportation Research Part B: Methodological 99: 1–29.
  • Muelas, S., A. LaTorre, and J. M. Peña. 2015. “A Distributed VNS Algorithm for Optimizing Dial-A-ride Problems in Large-scale Scenarios.” Transportation Research Part C: Emerging Technologies 54: 110–130.
  • Nanry, W. P., and J. Wesley Barnes. 2000. “Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search.” Transportation Research Part B: Methodological 34 (2, February): 107–121. doi:https://doi.org/10.1016/S0191-2615(99)00016-8.
  • Narayanan, S., E. Chaniotakis, and C. Antoniou. 2020. “Shared Autonomous Vehicle Services: A Comprehensive Review.” Transportation Research Part C: Emerging Technologies 111: 255–293. doi:https://doi.org/10.1016/j.trc.2019.12.008.
  • Paquette, J., J. F. Cordeau, G. Laporte, and M. M. B. Pascoal. 2013. “Combining Multicriteria Analysis and Tabu Search for Dial-a-ride Problems.” Transportation Research Part B: Methodological 52: 1–16. doi:https://doi.org/10.1016/j.trb.2013.02.007.
  • Parragh, S. N., K. F. Doerner, and R. F. Hartl. 2010. “Variable Neighborhood Search for the Dial-a-ride Problem.” Computers and Operations Research 37 (6): 1129–1138.
  • Pimenta, V., A. Quilliot, H. Toussaint, and D. Vigo. 2017. “Models and Algorithms for Reliability-oriented Dial-a-ride with Autonomous Electric Vehicles.” European Journal of Operational Research 257 (2): 601–613.
  • Singanamala, P., K. D. Reddy, and P. Venkataramaiah. 2018. “Solution to a Multi Depot Vehicle Routing Problem Using K-means Algorithm, Clarke and Wright Algorithm and Ant Colony Optimization.” International Journal of Applied Engineering Research 13 (21): 15236–15246.
  • Taxi, N. Y. C. and Limousine Commission. 2020. “Trip Record Data.” https://www1.nyc.gov/site/tlc/about/tlc-trip-record-data.page
  • Transportation Networks for Research Core Team. 2019. “Transportation Networks for Research.”
  • Wang, X., M. Dessouky, and F. Ordonez. 2016. “A Pickup and Delivery Problem for Ridesharing considering Congestion.” Transportation Letters 8 (5): 259–269.
  • Yazdi, A. K., M. A. Kaviani, A. Emrouznejad, and H. Sahebi. 2020. “A Binary Particle Swarm Optimization Algorithm for Ship Routing and Scheduling of Liquefied Natural Gas Transportation.” Transportation Letters 12 (4): 223–232. doi:https://doi.org/10.1080/19427867.2019.1581485.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.