Results 111 to 120 of about 118,691,665 (153)
The Dial-a-Ride Problem With Transfers [PDF]
Computers and Operations Research, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olivier Peton, Fabien Lehuede
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 A. Forbes
exaly +4 more sources
Quality of Service in Dial-a-Ride Operations
Computers and Industrial Engineering, 2009Jean-François Cordeau +2 more
exaly +3 more sources
A Note on “Efficient Feasibility Testing for Dial-a-Ride Problems”
Operations Research Letters, 2010 Hunsaker and Savelsbergh [B. Hunsaker, M.W.P. Savelsbergh, Efficient feasibility testing for dial-a-ride problems, Operations Research Letters 30 (2002) 169–173.] developed a linear-time algorithm to verify the feasibility for dial-a-ride problems ...
Wh Ip, Jiafu Tang
exaly +2 more sources
Usability of dial-a-ride systems
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, 2005A case study of usability of dial-a-ride bus systems is reported. We conduct a social simulation to compare efficiencies of the dial-a-ride bus systems, one of possible multi-agent applications, and traditional fixed-route bus systems. Simulation results indicated that dial-a-ride systems are reasonable for large cities but their advantage depends on ...
Itsuki Noda +4 more
openaire +2 more sources
Transportation Research Part B: Methodological, 2014 Dial-a-ride problems are concerned with the design of efficient vehicle routes for transporting individual persons from specific origin to specific destination locations.
An CARIS +2 more
exaly +2 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, Gilbert Laporte
openaire +3 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.
Karl Doerner +2 more
exaly +4 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
Disruption Management for Dial-A-Ride Systems
IEEE Intelligent Transportation Systems Magazine, 2020Mobility on demand has been gaining more attention from the research community as a way to offer smart and efficient transportation services to people. Despite the advancements in vehicular technologies, vehicle breakdown (VB) remains one of the major contributors to the disruption of fleet operations, which may inflict large recovery costs and damage ...
Ramesh Ramasamy Pandi +4 more
openaire +1 more source