Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
From MaRDI portal
Publication:2673572
DOI10.1016/j.ejor.2022.02.021OpenAlexW4213092367MaRDI QIDQ2673572
Lennart C. Johnsen, Frank Meisel
Publication date: 10 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.021
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
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
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- The dial-A-ride problem with transfers
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
- The vehicle routing problem with time windows and temporal dependencies
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Variable Neighborhood Search
This page was built for publication: Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
