Results 131 to 140 of about 534 (157)

Large Neighborhood Search for Dial-a-Ride Problems

2011
Dial-a-Ride problems (DARPs) arise in many urban transportation applications. The core of a DARP is a pick and delivery routing with multiple vehicles in which customers have ride-time constraints and routes have a maximum duration. This paper considers DARPs for which the objective is to minimize the routing cost, a complex optimization problem which ...
Siddhartha Jain 0001, Pascal Van Hentenryck   +1 more
openaire   +1 more source

Distributed Planning for the On-Line Dial-a-Ride Problem

2007
This paper describes the experiments and results obtained from distributing an improved insertion heuristic for the scheduling of passengers' trip requests over a fleet of vehicles. The distribution has been obtained by means of an agent architecture implemented over Jade.
Claudio Cubillos, Broderick Crawford, Nibaldo Rodríguez   +2 more
openaire   +1 more source

The Line-Based Dial-a-Ride Problem with Transfers.

We introduce the line-based dial-a-ride problem with transfers (liDARPT), a variation of the well-studied dial-a-ride problem (DARP), where vehicles transport requests on-demand but are constrained to operate along a set of lines, and passengers are allowed to transfer between lines on their journey.
Jonas Barth, Kendra Reiter, Marie Schmidt   +2 more
openaire   +2 more sources

Automated taxis’ dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times

Transportation Research Part C: Emerging Technologies, 2020
Bart Van Arem, Kun An, Gonçalo Homem de Almeida Correia   +2 more
exaly  

Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem

Transportation Science, 2019
Timo Gschwind
exaly  

The electric autonomous dial-a-ride problem

Transportation Research Part B: Methodological, 2019
Nikolas Geroliminis, Claudia Bongiovanni, Mor Kaspi   +2 more
exaly  

A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation

Transportation Science, 2019
Zhixing Luo, Andrew Lim
exaly  

Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem

Transportation Research, Part E: Logistics and Transportation Review, 2016
Kris Braekers, Manar Hosny
exaly  

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

Transportation Research Part C: Emerging Technologies, 2018
Samuel Vercraene, Olivier Peton, Fabien Lehuede   +2 more
exaly  

A multi-period dial-a-ride problem with driver consistency

Transportation Research Part B: Methodological, 2016
Kris Braekers
exaly