Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles

DOI10.1016/j.ejor.2016.07.037zbMath1394.90121OpenAlexW2500521937MaRDI QIDQ1752844

Daniele Vigo, Alain Quilliot, Victor Pimenta, Hélène Toussaint

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

zbMATH Keywords

resource constrained schedulingdial-a-ride problemILP models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Coloring of graphs and hypergraphs (05C15)

Related Items

The complexity of the unit stop number problem and its implications to other related problems, Daily aircraft routing for amphibious ready groups, Pickup and delivery problems with autonomous vehicles on rings, Interrelated trips in the rural dial-a-ride problem with autonomous vehicles, Directions for future research on urban mobility and city logistics, 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

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimization framework for the development of efficient one-way car-sharing systems
• An exact approach for the vertex coloring problem
• A general heuristic for vehicle routing problems
• Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
• A probabilistic heuristic for a computationally difficult set covering problem
• Algorithmic graph theory and perfect graphs
• Record breaking optimization results using the ruin and recreate principle
• The dial-a-ride problem: Models and algorithms
• A one-to-one correspondence between colorings and stable sets
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A Column Generation Approach for Graph Coloring
• A guide to vehicle routing heuristics