Results 21 to 30 of about 114,653,411 (178)
The dial-a-ride problem with transfers [PDF]
The Dial--A--Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip.
Masson, Renaud +2 more
openaire +2 more sources
Minimum Makespan Multi-vehicle Dial-a-Ride [PDF]
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,ti)}mi=1, where each object requires to be moved from its source to ...
Nagarajan, Viswanath +8 more
core +1 more source
Solving the dial-a-ride problem using agent-based simulation
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
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
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
Long-Distance Directional Dial-a-Ride Problems
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
Uma nova abordagem para o problema dial-a-ride A new approach for the dial-a-ride problem
Este trabalho descreve um modelo matemático geral e multiobjetivo para o problema dial-a-ride e uma aplicação do simulated annealing para resolvê-lo. O modelo trata a forma estática do problema e abrange vários casos distintos dos modelos mais comuns ...
Geraldo Regis Mauri +1 more
doaj +1 more source
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
Simulation of Demand Responsive Transport using a dynamic scheduling tool with SUMO
Demand responsive transport (DRT) has been increasingly tested and applied in recent years as a new form of transportation that seeks to address mobility problems in cities and rural areas.
Maria Giuliana Armellini
doaj +1 more source
The on-demand bus routing problem with real-time traffic information
We propose to solve a real-time traffic variation of the On-Demand Bus Routing Problem (ODBRP) introduced by Melis and Sörensen (2022). The ODBRP belongs to the category of the Dial-A-Ride Problems (DARP), and features departure and arrival bus station ...
Ying Lian +2 more
doaj +1 more source

