Results 141 to 150 of about 114,653,411 (178)
Some of the next articles are maybe not open access.
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
Operations Research Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Murat Firat, Gerhard Woeginger
exaly +5 more sources
Modeling and Optimizing Dynamic Dial‐a‐Ride Problems
International Transactions in Operational Research, 2001 Dial‐a‐ride is an emerging alternative to traditional public transportation systems. The aim of this paper is to reduce the gap between the models studied in optimization literature and the requirements of practical applications. We also describe the algorithms implemented in DARIA, a PC program for the optimization of static and dynamic dial‐a‐ride ...
COLORNI VITALE, ALBERTO, G. RIGHINI
openaire +6 more sources
A multi-period dial-a-ride problem with driver consistency
Transportation Research Part B: Methodological, 2016 Dial-a-ride services provide disabled and elderly people with a personalized mode of transportation to preserve their mobility. Typically, several users with different pickup and dropoff locations are transported on a vehicle simultaneously. The focus in
Kris Braekers
exaly +2 more sources
A Matheuristic for the Dial-a-Ride Problem
2011The Dial-a-Ride is a transport system on demand. A fleet of vehicles, without fixed routes and schedules, carries people from their pickup points to their delivery points, during a pre-specified time interval. It can be modeled as an N P-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this
Roberto Wolfler Calvo +1 more
openaire +1 more source
The finite capacity dial-a-ride problem
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 2002We give the first non-trivial approximation algorithm for the Capacitated Dial-a-Ride problem: given a collection of objects located at points in a metric space, a specified destination point for each object, and a vehicle with a capacity of at most k objects, the goal is to compute a shortest tour for the vehicle in which all objects can be delivered ...
Moses Charikar, Balaji Raghavachari
openaire +2 more sources
Feasibility Testing for Dial-a-Ride Problems
2010Hunsaker and Savelsbergh have proposed an algorithm for testing feasibility of a route in the solution to the dial-a-ride problem. The constraints that are checked are load capacity constraints, time windows, ride time bounds and wait time bounds. The algorithm has linear running time.
Dag Haugland, Sin C. Ho
openaire +2 more sources
Customers' satisfaction in a dial-a-ride problem
IEEE Intelligent Transportation Systems Magazine, 2009This paper presents a general model for a dial-a-ride problem and a Simulated Annealing approach to solve it focusing on the quality of service. The model includes several distinct cases of the real problems and an objective function that treats transportation costs and customer's inconveniences. The routes are clustered and scheduled in a separate way
G. Mauri, L. Antonio, N. Lorena
openaire +2 more sources
An effective and fast heuristic for the Dial-a-Ride problem
4OR, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
COLORNI VITALE, ALBERTO, R. Wolfler
openaire +4 more sources
Transportation Research Part B: Methodological, 2014 Dial-a-ride problems are concerned with the design of efficient vehicle routes for transporting individual persons from specific origin to specific destination locations.
An Cáris, Kris Braekers
exaly +2 more sources
The rail-road Dial-a-Ride problem
European Journal of Operational ResearchzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jodeau, Jean +3 more
openaire +1 more source