Results 161 to 170 of about 59,736 (194)
Some of the next articles are maybe not open access.
Modeling and Optimizing Dynamic Dial‐a‐Ride Problems
International Transactions in Operational Research, 2001Dial‐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 +5 more sources
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 +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 +1 more source
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
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 J. Woeginger
openaire +3 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
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 +1 more source
A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem
2020In this paper, we propose a simple heuristic algorithm based on the Variable Neighborhood Search (VNS), which combines with the Set Covering strategy in order to solve the Dial-a-Ride Problem (DARP). In this problem, customers must be served by a heterogeneous fleet of vehicles. Each customer has a pickup and a delivery location, where each one of them
André Luyde S. Souza +3 more
openaire +1 more source
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 +1 more source
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research, 2006In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a shared service. The problem consists of designing a set of minimum-cost vehicle routes satisfying capacity, duration, time window, pairing, precedence, and ride-time constraints.
openaire +1 more source