Results 11 to 20 of about 534 (157)
Bilevel large neighborhood search for the electric autonomous dial-a-ride problem
The electric autonomous dial-a-ride problem (E-ADARP) represents a challenging and practically relevant extension of the dial-a-ride problem, which takes electric vehicle charging into account. It introduces battery constraints and the option to recharge
Steffen Limmer
doaj +1 more source
Dial-a-Ride Problem With Meeting Point Feature Known-as Express-Pool
This study extends a dial-a-ride problem by considering (1) Express-Pool and (2) Friend-Only. Uber provides an advanced feature called Express-Pool where passengers are willing to walk a short distance to be picked up and be dropped off somewhere close ...
Andy Ham
doaj +1 more source
The Electric Dial-a-Ride Problem on a Fixed Circuit
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
Vehicle-based interactive management with multi-agent approach
Under the energy crisis and global warming, mass transportation becomes more important than before. The disadvantages of mass transportation, plus the high flexibility and efficiency of taxi and with the revolution of technology, electric-taxi is the ...
Yee Ming Chen, Bo-Yuan Wang
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
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
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 Clustered Dial-a-Ride Problem
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
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
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

