Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
DOI10.1016/J.EJOR.2016.07.037zbMATH Open1394.90121OpenAlexW2500521937MaRDI QIDQ1752844FDOQ1752844
Authors: Victor Pimenta, Alain Quilliot, Hélène Toussaint, Daniele Vigo 
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.037
Recommendations
- Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles
- Modeling and optimizing dynamic dial-a-ride problems
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- On the Interaction Between Autonomous Mobility-on-Demand Systems and the Power Network: Models and Coordination Algorithms
- The dial-a-ride problem: Models and algorithms
- A stochastic model for a vehicle in a dial-a-ride system
- Typology and literature review for dial-a-ride problems
- An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services
- An Optimization Model and a Decision Support System to Optimize Car Sharing Stations with Electric Vehicles
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Coloring of graphs and hypergraphs (05C15) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Algorithmic graph theory and perfect graphs
- A general heuristic for vehicle routing problems
- An exact approach for the vertex coloring problem
- Title not available (Why is that?)
- A probabilistic heuristic for a computationally difficult set covering problem
- Record breaking optimization results using the ruin and recreate principle
- The dial-a-ride problem: Models and algorithms
- An optimization framework for the development of efficient one-way car-sharing systems
- A Column Generation Approach for Graph Coloring
- Title not available (Why is that?)
- A one-to-one correspondence between colorings and stable sets
- A guide to vehicle routing heuristics
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
Cited In (8)
- Daily aircraft routing for amphibious ready groups
- The complexity of the unit stop number problem and its implications to other related problems
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- Directions for future research on urban mobility and city logistics
- Pickup and delivery problems with autonomous vehicles on rings
- Monitoring a Fleet of Autonomous Vehicles Through A* Like Algorithms and Reinforcement Learning
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- Systematic review of the latest scientific publications on the vehicle routing problem
Uses Software
This page was built for publication: Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752844)
