A filtering system to solve the large-scale shared autonomous vehicles Dial-a-Ride Problem

This publication has 25 references indexed in Scilit:

• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
  European Journal of Operational Research, 2023
• Routing autonomous vehicles in congested transportation networks: structural properties and coordination algorithms
  Autonomous Robots, 2018
• A general framework for modeling shared autonomous vehicles with dynamic network-loading and dynamic ride-sharing application
  Computers, Environment and Urban Systems, 2017
• Typology and literature review for dial-a-ride problems
  Annals of Operations Research, 2017
• Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas
  Transportation, 2016
• Ridesharing: The state-of-the-art and future directions
  Transportation Research Part B: Methodological, 2013
• Optimization for dynamic ride-sharing: A review
  European Journal of Operational Research, 2012
• A note on “Efficient feasibility testing for dial-a-ride problems”
  Operations Research Letters, 2010
• An effective and fast heuristic for the Dial-a-Ride problem
  4OR, 2006
• A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows
  Transportation Research Part B: Methodological, 2004