The dial-A-ride problem with transfers

DOI10.1016/J.COR.2013.07.020zbMATH Open1348.90111OpenAlexW1970266522MaRDI QIDQ336745FDOQ336745

Authors: Renaud Masson, Fabien Lehuédé, Olivier Péton 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.020

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

zbMATH Keywords

large neighborhood searchdial-A-ride problemsimple temporal problemtransfers

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Temporal constraint networks
• A general heuristic for vehicle routing problems
• Handbook of metaheuristics
• Dynamic pickup and delivery problems
• Efficient feasibility testing for dial-a-ride problems
• The dial-a-ride problem: Models and algorithms
• Variable neighborhood search for the dial-a-ride problem
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Real-time split-delivery pickup and delivery time window problems with transfers
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• The Pickup And Delivery Problem With Time Windows And Transshipment
• Solving a school bus scheduling problem with integer programming
• Minimum Makespan Multi-vehicle Dial-a-Ride
• Deciding Linear Inequalities by Computing Loop Residues
• Shortest-path feasibility algorithms
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• Principles and practice of constraint programming -- CP 2011. 17th international conference, CP 2011, Perugia, Italy, September 12--16, 2011. Proceedings

Cited In (37)

• Synchronisation in vehicle routing: classification schema, modelling framework and literature review
• Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
• Trends in transportation and logistics
• Home chemotherapy delivery: an integrated production scheduling and multi-trip vehicle routing problem
• An algorithm for flexible transshipments with perfect synchronization
• Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers
• The pickup and delivery problem with time windows and scheduled lines
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
• A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
• Parcel delivery cost minimization with time window constraints using trucks and drones
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• Vehicle routing with transportable resources: using carpooling and walking for on-site services
• 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
• A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
• Synchronizing transportation of people with reduced mobility through airport terminals
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
• The rendezvous vehicle routing problem
• Solving routing problems with pairwise synchronization constraints
• Dynamic design of sales territories
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• The vessel swap-body routing problem
• Scheduling truck drivers with interdependent routes under European Union regulations
• Typology and literature review for dial-a-ride problems
• Modeling and solving the multimodal car- and ride-sharing problem
• 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

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)