Results 151 to 160 of about 114,653,411 (178)
Some of the next articles are maybe not open access.
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Coja-Oghlan +2 more
openaire +3 more sources
Efficient feasibility testing for dial-a-ride problems
Operations Research Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brady Hunsaker, Martin W. P. Savelsbergh
openaire +2 more sources
Data-Oriented Approach for the Dial-A-Ride Problem
2019 IEEE/ACS 16th International Conference on Computer Systems and Applications (AICCSA), 2019The Dial-a-ride problem with time windows (DARPTW) is a highly complex problem with several operational applications. Compared to vehicle routing problems and pick up and delivery problems, the DARPTW considers the transport of persons and has, therefore, more constraints to ensure passengers satisfaction.
Alisoltani, Negin +2 more
openaire +2 more sources
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), 2004The 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
2011Dial-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
2007This 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
NetworksABSTRACT 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
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
Transportation Science, 2019Timo Gschwind
exaly
A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation
Transportation Science, 2019Zhixing Luo, Andrew Lim
exaly
INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALING
Engineering Optimization, 1998John Baugh
exaly