Recommendations
- The dial-a-ride problem with private fleet and common carrier
- A matheuristic for the dial-a-ride problem
- The time‐consistent dial‐a‐ride problem
- The dial-a-ride problem: Models and algorithms
- Typology and literature review for dial-a-ride problems
- A hard dial-a-ride problem that is easy on average
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- A dial-a-ride problem for client transportation in a health-care organization
Cites work
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- A general heuristic for vehicle routing problems
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
- Deciding Linear Inequalities by Computing Loop Residues
- Dynamic pickup and delivery problems
- Efficient feasibility testing for dial-a-ride problems
- Handbook of metaheuristics
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Principles and practice of constraint programming -- CP 2011. 17th international conference, CP 2011, Perugia, Italy, September 12--16, 2011. Proceedings
- Real-time split-delivery pickup and delivery time window problems with transfers
- Shortest-path feasibility algorithms, an experimental evaluation
- Solving a school bus scheduling problem with integer programming
- Temporal constraint networks
- The Pickup And Delivery Problem With Time Windows And Transshipment
- The dial-a-ride problem: Models and algorithms
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Variable neighborhood search for the dial-a-ride problem
Cited in
(41)- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- scientific article; zbMATH DE number 1185321 (Why is no real title available?)
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- Parcel delivery cost minimization with time window constraints using trucks and drones
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Synchronizing transportation of people with reduced mobility through airport terminals
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- Model formulations for pickup and delivery problems in designated driver services
- The integrated on-demand bus routing problem: combining on-demand buses with a high-frequency fixed line public transport network
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- The dial-a-ride problem with private fleet and common carrier
- An algorithm for flexible transshipments with perfect synchronization
- Scheduling truck drivers with interdependent routes under European Union regulations
- The pickup and delivery problem with time windows and scheduled lines
- Vehicle routing with transportable resources: using carpooling and walking for on-site services
- Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem
- Trends in transportation and logistics
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- Modeling and solving the multimodal car- and ride-sharing problem
- Typology and literature review for dial-a-ride problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
- The rendezvous vehicle routing problem
- A reduction approach to the two-campus transport problem
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Solving routing problems with pairwise synchronization constraints
- Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions
- The vessel swap-body routing problem
- Graph representation of the fixed route dial-a-ride problem
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
- Dynamic design of sales territories
- A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
- Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
This page was built for publication: The dial-A-ride problem with transfers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336745)
