Results 11 to 20 of about 59,736 (194)
Anticipation in the Dial-a-Ride Problem: an introduction to the robustness [PDF]
, 2013 International audienceThe Dial-a-Ride Problem (DARP) models an operation research problem related to the on demand transport. This paper introduces one of the fundamental features of this type of transport: the robustness.
Deleplanque, Samuel +2 more
core +5 more sources
The time‐consistent dial‐a‐ride problem [PDF]
Networks, 2021 AbstractIn the context of door‐to‐door transportation of people with disabilities, service quality considerations such as maximum ride time and service time consistency are critical requirements. To identify a good trade‐off between these considerations and economic objectives, we define a new variant of the multiperiod dial‐a‐ride problem called the ...
Tellez, Oscar +4 more
openaire +5 more sources
The assignment-dial-a-ride-problem
Health Care Management Science, 2023 In this paper, we present the first Assignment-Dial-A-Ride problem motivated by a real-life problem faced by medico-social institutions in France. Every day, disabled people use ride-sharing services to go to an appropriate institution where they receive personal care. These institutions have to manage their staff to meet the demands of the people they
Chane-Haï, Timothée +2 more
openaire +3 more sources
The Electric Dial-a-Ride Problem on a Fixed Circuit
Transportation Science, 2023 Shared mobility services involving electric autonomous shuttles have increasingly been implemented in recent years. Because of various restrictions, these services are currently offered on fixed circuits and operated with fixed schedules. This study introduces a service variant with flexible stopping patterns and schedules.
Yves Molenbruch +3 more
openaire +4 more sources
The Clustered Dial-a-Ride Problem
Proceedings of the International Conference on Automated Planning and Scheduling, 2019 We study a variant of the classical dial-a-ride problem, with an application to public transport planning in rural areas. In the classical dial-a-ride problem, n users each specify a pickup and a delivery location, and the aim is to plan the least cost route to cater all requests.
Fabian Feitsch, Sabine Storandt
openaire +2 more sources
Minimum Makespan Multi-vehicle Dial-a-Ride [PDF]
, 2009 Dial a ride problems consist of a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs, where each object requires to be moved from its source to destination vertex.
Goertz, Inge Li +2 more
core +8 more sources
Solving the dial-a-ride problem using agent-based simulation
South African Journal of Industrial Engineering, 2016 The ‘dial-a-ride problem’ (DARP) requires a set of customers to be transported by a limited fleet of vehicles between unique origins and destinations under several service constraints, including within defined time windows.
Campbell, Ian +2 more
doaj +1 more source
Transportes, 2021 The available benchmarks for the dynamic versions of the Pickup and Delivery Problem with Time Windows (PDPTW) and the Dial-A-Ride Problem (DARP) do not share the same characteristics and may not cover all the range of characteristics of real situations.
Renan Artur Lopes Eccel +1 more
doaj +1 more source
Improved Bounds for Open Online Dial-a-Ride on the Line [PDF]
, 2019 We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportation requests appear over time and need to be served by a single server.
Birx, Alexander +2 more
core +2 more sources
Vojnotehnički Glasnik, 2006 Transportni sistem "Nazovi vožnju" (Dial-a-Ride) oblik je prevoza u kojem prevozilac poseduje vozni park i realizuje prevoz na relacijama i u vreme kako to zahtevaju korisnici.
Gordana Radivojević
doaj +1 more source