Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
From MaRDI portal
Publication:296680
DOI10.1016/J.EJOR.2014.03.005zbMATH Open1338.90066OpenAlexW1981736216WikidataQ40269760 ScholiaQ40269760MaRDI QIDQ296680FDOQ296680
Authors: K. F. Doerner, Richard F. Hartl, M. Schilde 
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.005
Recommendations
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Impact of vehicle tracking on a routing problem with dynamic travel times
- Vehicle routing with stochastic time-dependent travel times
- Solving the stochastic time-dependent orienteering problem with time windows
- A dynamic vehicle routing problem with time-dependent travel times
time-dependentvariable neighborhood searchdial-a-ride problemdynamic stochasticmultiple plan approachmultiple scenario approach
Cites Work
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Variable neighborhood search
- Search Methodologies
- A new extension of local search applied to the Dial-A-Ride problem
- Efficient feasibility testing for dial-a-ride problems
- Vehicle dispatching with time-dependent travel times
- Optimization for dynamic ride-sharing: a review
- A network-consistent time-dependent travel time layer for routing optimization problems
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- The dial-a-ride problem: Models and algorithms
- A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
- Ranking paths in stochastic time-dependent networks
- Vehicle routing and scheduling with dynamic travel times
- Variable neighborhood search for the dial-a-ride problem
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Vehicle routing and scheduling with time-varying data: a case study
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Ambulance location and relocation problems with time-dependent travel times
- Online vehicle routing and scheduling with dynamic travel times
Cited In (28)
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- Electric vehicle routing problem with time-dependent waiting times at recharging stations
- Comments on: ``Disruption management in vehicle routing and scheduling for road freight transport: a review
- Robotized sorting systems: large-scale scheduling under real-time conditions with limited lookahead
- Comparison of anticipatory algorithms for a dial-a-ride problem
- Event-based MILP models for ridepooling applications
- Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration
- Rough approximation-based approach for designing a personalized tour route under a fuzzy environment
- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
- Vehicle routing and scheduling of flex-route transit under a dynamic operating environment
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- Time-dependent routing problems: a review
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
- Dynamic migratory beekeeping route recommendation based on spatio-temporal distribution of nectar sources
- Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
- A colored traveling salesman problem with varying city colors
- The rich heterogeneous dial-a-ride problem with trip time prediction
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Opportunities for reinforcement learning in stochastic dynamic vehicle routing
- Dynamic scheduling of patients in emergency departments
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- Typology and literature review for dial-a-ride problems
- Solving the stochastic time-dependent orienteering problem with time windows
- Dynamic priority rules for combining on-demand passenger transportation and transportation of goods
- Solving a dial-a-flight problem using composite variables
- An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
- Stochastic inventory routing with dynamic demands and intra-day depletion
- Vehicle routing with space- and time-correlated stochastic travel times: evaluating the objective function
This page was built for publication: Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296680)
