Results 131 to 140 of about 558 (159)
Some of the next articles are maybe not open access.

Route planning method for a dial-a-ride problem

SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), 2004
The present paper discusses an online operation planning method for a demand bus system with multiple buses. It is necessary to solve a passengers assignment problem and a routing problem in real time in operating the demand bus system. We propose an agent-base planning method.
Toshiyuki Miyamoto   +2 more
openaire   +2 more sources

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   +1 more
openaire   +2 more sources

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   +2 more
openaire   +2 more sources

The Dynamic Rail‐Road Dial‐A‐Ride Problem

Networks
ABSTRACT We consider an original dynamic dial‐a‐ride service designed for sparsely populated areas. The service relies on vehicles capable of switching between road and an existing abandoned rail network. It defines a Dial‐A‐Ride Problem (DARP) with rail scheduling constraints. In the DARP, a set of users must be picked up and dropped
Jean Jodeau   +3 more
openaire   +1 more source

A Survey of Dial-a-Ride Problems: Literature Review and Recent Developments

Transportation Research Part B: Methodological, 2018
Sin C. Ho, Wai Yuen Szeto, Yong-Hong Kuo
exaly  

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   +2 more
exaly  

The Electric Autonomous Dial-a-Ride Problem

Transportation Research Part B: Methodological, 2019
Nikolaos Geroliminis   +2 more
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 I. Hosny
exaly  

The Fleet Size and Mix Dial-a-Ride Problem With Reconfigurable Vehicle Capacity

Transportation Research Part C: Emerging Technologies, 2018
Samuel Vercraene   +2 more
exaly  

Home - About - Disclaimer - Privacy