Results 151 to 160 of about 59,736 (194)
Some of the next articles are maybe not open access.
A New Formulation for the Dial-a-Ride Problem
Transportation Science, 2021This paper proposes a new mixed integer programming formulation and branch and cut (BC) algorithm to solve the dial-a-ride problem (DARP). The DARP is a route-planning problem where several vehicles must serve a set of customers, each of which has a pickup and delivery location, and includes time window and ride time constraints.
Yannik Rist, Michael Forbes
exaly +3 more sources
The Dial-A-Ride Problem with Transfers [PDF]
Computers and Operations Research, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabien Lehuede, Olivier Peton
exaly +5 more sources
Variable neighborhood search for the dial-a-ride problem
Computers and Operations Research, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sophie N Parragh, Richard F Hartl
exaly +4 more sources
The dial-a-ride problem: models and algorithms
Annals of Operations Research, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-François Cordeau +1 more
exaly +3 more sources
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 +1 more source
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 +1 more source
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 +3 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
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
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