• Graduate Programs
  • Research
  • Browse our Courses
  • Events
    • Events Calendar
    • Events Archive
    • Summer School
      • Applied Public Policy Evaluation
      • Deep Learning
      • Development Economics
      • Economics of Blockchain and Digital Currencies
      • Economics of Climate Change
      • The Economics of Crime
      • Foundations of Machine Learning with Applications in Python
      • From Preference to Choice: The Economic Theory of Decision-Making
      • Inequalities in Health and Healthcare
      • Marketing Research with Purpose
      • Markets with Frictions
      • Modern Toolbox for Spatial and Functional Data
      • Sustainable Finance
      • Tuition Fees and Payment
      • Business Data Science Summer School Program
    • Tinbergen Institute Lectures
    • 2026 Tinbergen Institute Opening Conference
    • Annual Tinbergen Institute Conference
  • News
  • Summer School
    • Applied Public Policy Evaluation
    • Deep Learning
    • Development Economics
    • Economics of Blockchain and Digital Currencies
    • Economics of Climate Change
    • The Economics of Crime
    • Foundations of Machine Learning with Applications in Python
    • From Preference to Choice: The Economic Theory of Decision-Making
    • Inequalities in Health and Healthcare
    • Marketing Research with Purpose
    • Markets with Frictions
    • Modern Toolbox for Spatial and Functional Data
    • Sustainable Finance
    • Tuition Fees and Payment
  • Alumni

Pimenta, V., Quilliot, A., Toussaint, H. and Vigo, D. (2017). Models and algorithms for reliability-oriented Dial-a-Ride with autonomous electric vehicles European Journal of Operational Research, 257(2):601--613.


  • Journal
    European Journal of Operational Research

We consider a static decision model related to the management of a Dial-a-Ride (DAR) system involving small autonomous electrical vehicles in a closed industrial site. Because of the specific features of the system, in this paper we concentrate on its reliability and propose a model that aims at assigning requests to vehicles by minimizing the number of loading/unloading operations. We propose an integer linear programming formulation of such Stop Number Minimization Problem and examine the behavior of some of its variants. Next, we consider and analyze a set covering oriented reformulation of the model. Finally, we propose a Greedy Randomized Adaptive Search Procedure (GRASP) based heuristic approach that implements insertion mechanisms and is well fitted to realistic dynamic contexts. All proposed methods are tested on benchmark instances involving some tens of requests.