Interrelated trips in the rural dial-a-ride problem with autonomous vehicles

DOI10.1016/J.EJOR.2022.02.021MaRDI QIDQ2673572zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

autonomous vehiclesdial-a-rideinterrelated tripssynchronizationtransportation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• Typology and literature review for dial-a-ride problems
• The dial-a-ride problem: Models and algorithms
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
• Modeling and optimizing dynamic dial-a-ride problems
• Trip-vehicle assignment algorithms for ride-sharing
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• Approximate ridesharing of personal vehicles problem
• Approximate ridesharing of personal vehicles problem

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-A-ride problem with transfers
• The dial-a-ride problem: Models and algorithms
• 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 vehicle routing problem with time windows and temporal dependencies
• Variable Neighborhood Search
• Variable neighborhood search for the dial-a-ride problem

Cited in

(5)

• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
• 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
• The dynamic rail-road dial-a-ride problem
• The impact of autonomous vehicle encroachment on human-driven ride-hailing platforms: implications for peer-to-peer and fleet-based modes

Describes a project that uses

Uses Software

• OpenStreetMap

This page was built for publication: Interrelated trips in the rural dial-a-ride problem with autonomous vehicles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673572)