Event-based MILP models for ridepooling applications
From MaRDI portal
Publication:2140290
DOI10.1016/j.ejor.2021.11.053zbMath1506.90039arXiv2103.01817OpenAlexW3215760358MaRDI QIDQ2140290
Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.01817
Related Items (2)
Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
Uses Software
Cites Work
- Unnamed Item
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- Pickup and delivery problem with time windows: a new compact two-index formulation
- A dial-a-ride problem for client transportation in a health-care organization
- The dial-a-ride problem: Models and algorithms
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Solving the Dial-a-Ride problem using genetic algorithms
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Multicriteria Optimization
This page was built for publication: Event-based MILP models for ridepooling applications
