Event-based MILP models for ridepooling applications
From MaRDI portal
Publication:2140290
DOI10.1016/J.EJOR.2021.11.053zbMATH Open1506.90039arXiv2103.01817OpenAlexW3215760358MaRDI QIDQ2140290FDOQ2140290
Authors: Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr 
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Abstract: Ride-hailing services require efficient optimization algorithms to simultaneously plan routes and pool users in shared rides. We consider a static dial-a-ride problem (DARP) where a series of origin-destination requests have to be assigned to routes of a fleet of vehicles. Thereby, all requests have associated time windows for pick-up and delivery, and may be denied if they can not be serviced in reasonable time or at reasonable cost. Rather than using a spatial representation of the transportation network we suggest an event-based formulation of the problem. While the corresponding MILP formulations require more variables than standard models, they have the advantage that capacity, pairing and precedence constraints are handled implicitly. The approach is tested and validated using a standard IP-solver on benchmark data from the literature. Moreover, the impact of, and the trade-off between, different optimization goals is evaluated on a case study in the city of Wuppertal (Germany).
Full work available at URL: https://arxiv.org/abs/2103.01817
Recommendations
- Modeling and optimizing dynamic dial-a-ride problems
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Modeling and solving the multimodal car- and ride-sharing problem
- The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
- Event-based MILP models for resource-constrained project scheduling problems
- A data-driven matching algorithm for ride pooling problem
- The dial-a-ride problem: Models and algorithms
- Optimal routing of multimodal mobility systems with ride‐sharing
Cites Work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Multicriteria Optimization
- The dial-a-ride problem: Models and algorithms
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- A dial-a-ride problem for client transportation in a health-care organization
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Pickup and delivery problem with time windows: a new compact two-index formulation
- Solving the Dial-a-Ride problem using genetic algorithms
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Event-based MILP models for ridepooling applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140290)
