Dial-a-ride problem - Open Access .click

Transportation Science, 2021
This paper proposes a new mixed integer programming formulation and branch and cut (BC) algorithm to solve the dial-a-ride problem (DARP). The DARP is a route-planning problem where several vehicles must serve a set of customers, each of which has a pickup and delivery location, and includes time window and ride time constraints.
Yannik Rist, Michael A. Forbes
exaly +4 more sources

The Dial-a-Ride Problem: Models and Algorithms

Annals of Operations Research, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-François Cordeau, Gilbert Laporte
exaly +4 more sources

Variable Neighborhood Search for the Dial-a-Ride Problem

Computers and Operations Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karl Doerner, Richard F. Hartl, Sophie N Parragh +2 more
exaly +4 more sources

A Matheuristic for the Dial-a-Ride Problem

2011
The Dial-a-Ride is a transport system on demand. A fleet of vehicles, without fixed routes and schedules, carries people from their pickup points to their delivery points, during a pre-specified time interval. It can be modeled as an N P-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this
Roberto Wolfler Calvo, Nora Touati Moungla +1 more
openaire +1 more source

11. sustainability
dial-a-ride
large neighborhood search

transportation
vehicle routing
scheduling

transfers
004
variable neighborhood search