Results 21 to 30 of about 118,691,665 (153)
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
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, 2012 O presente artigo propõe um modelo de Programação Linear Inteira Mista para resolver o problema de roteamento denominado de Dial-a-Ride Problem – DARP.
Patricia Perreto Rodrigues +2 more
doaj +1 more source
Evaluating demand responsive transit services using a density-based trip rate metric
Journal of Transport and Land Use, 2021 Demand responsive transit (DRT) is attracting increased attention as a means to provide public transit to low-density populations. This research aims to provide a suite of evaluation metrics with low data requirement and widespread availability, so that ...
Benjamin Kaufman +2 more
doaj +1 more source
A Note to Non-Traditional Systems of Public Transport
Communications, 2006 The paper deals with the following non-traditional (from the Czech point of view) solutions of public transport: * free competition of several providers, * use of heterogeneous rolling stock, * Dial-a-Ride systems and * integration with other systems.
Anna Cerna, Jan Cerny
doaj +1 more source
Dial-a-Ride Problem (DARP) data set from Ouro Preto-MG, Basil
, 2019 The data was used on a dissertation to obtain a Master degree. The research is "A based-VNS algorithm to solve the Dial-a-RIde Problem". The data set was created based on the data given by the transportation sector of the Health System of the Ouro Preto ...
André Luyde da Silva Souza (7019426)
core +2 more sources
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
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 +5 more sources
, 2021 This data set includes the instances used in the paper "A new lower bound for the static dial-a-ride problem with ride and waiting time minimization"
Schulz, Arne, Pfeiffer, Christian
core +1 more source
Long-Distance Directional Dial-a-Ride Problems
Proceedings of the 9th International Conference on Vehicle Technology and Intelligent Transport Systems, 2023 We consider vehicle routing problems that occur in practice in the context of long-distance ride-sharing. On the one hand, the instances of our problems share the helpful property that the passengers travel in roughly the same geographical direction. On the other, the required cost function has ordering-dependent components.
Grzegorz Gutowski, Grzegorz Herman
openaire +2 more sources