Results 101 to 110 of about 118,691,665 (153)

The Online Dial-A-Ride Problem Under Reasonable Load

open access: yes, 2000
In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in ...
Dietrich Hauptmeier   +2 more
core   +1 more source

The Multi-Vehicle Subscriber Dial-A-Ride Problem [PDF]

open access: yes, 1983
An algorithm is developed for solving the multi-vehicle subscriber dial-a-ride problem. This algorithm is tested on a set of data from Project Mobility in Baltimore, Maryland. Results of these tests are reported along with recommendations for future work
Bodin, Lawrence D., Sexton, Thomas R.
core  

Scheduling handicapped people transportation using a Dial-A-Ride problem

open access: yes, 2019
This thesis applies Dial-A-Ride model on the real data, which has been provided by theTown District Prague 10 institution. The aim of this work is to create a general mathematicalmodel, which would design vehicle routes for a handicapped people ...
Maříková, Eliška
core   +1 more source

The Online Dial-a-Ride Problem under Reasonable Load

open access: yes, 1999
In this paper, we analyze algorithms for the online dial-a-ride problem with request sets that fulfill a certain worst-case restriction: roughly speaking, a set of requests for the online dial-a-ride problem is reasonable if the requests that come up in ...
Krumke, Sven   +2 more
core   +1 more source

Improved ant colony optimization for solving dial-a-ride-problem

open access: yes, 2018
The dial-a-ride problem (DARP) is a combinatorial optimization problem in which passengers claim requests in the form of their departure location, destination and the specific time windows during which they must be picked up and dropped off.
Peng, Guohao
core  

The dial-a-ride problem with transfers

open access: yes, 2012
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   +1 more source

[Dial Finance Company Mail Loans Information Pamphlet]

open access: yes, 1961
Pamphlet from Dial Finance Company advertising their loan by mail order service.
Dial Finance Company
core  

Report on the Test and Evaluation of the Dial-A-Ride Basic and Advanced Programs

open access: yes
Volpe National Transportation Systems Center, Technical Reference Centerhttps://doi.org/10.21949/15271821970PDFTech ReportToye, C.Bushueff, B. P.Nahigian, R.John A. Volpe National Transportation Systems Center (U.S.)United States.

core  

Strolling Dial-a-Ride Problem: definition and applicability

open access: yes
Small/medium size cities of today, need to present solutions to their citizens, taking into account the demand and their needs. In terms of public transportation, this demand can be satisfied by a new type of service, based on the presented problem of ...
Bernardo, Ivo Rosa
core  

Home - About - Disclaimer - Privacy