The dial-A-ride problem with transfers
From MaRDI portal
Publication:336745
DOI10.1016/j.cor.2013.07.020zbMath1348.90111OpenAlexW1970266522MaRDI QIDQ336745
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
Related Items
The pickup and delivery problem with time windows and scheduled lines ⋮ A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride 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 ⋮ An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization ⋮ Dynamic design of sales territories ⋮ An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines ⋮ Synchronizing transportation of people with reduced mobility through airport terminals ⋮ Trends in transportation and logistics ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ The vessel swap-body routing problem ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ The rendezvous vehicle routing problem ⋮ Parcel delivery cost minimization with time window constraints using trucks and drones ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment ⋮ Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers ⋮ Typology and literature review for dial-a-ride problems ⋮ New mixed integer-programming model for the pickup-and-delivery problem with transshipment ⋮ A comparison of two meta-heuristics for the pickup and delivery problem with transshipment ⋮ A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments ⋮ The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm ⋮ Modeling and solving the multimodal car- and ride-sharing problem ⋮ Solving routing problems with pairwise synchronization constraints ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ Vehicle routing with transportable resources: using carpooling and walking for on-site services ⋮ Scheduling truck drivers with interdependent routes under European Union regulations ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
Cites Work
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- 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
- A general heuristic for vehicle routing problems
- Real-time split-delivery pickup and delivery time window problems with transfers
- Solving a school bus scheduling problem with integer programming
- Dynamic pickup and delivery problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Temporal constraint networks
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Efficient feasibility testing for dial-a-ride problems
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
- Minimum Makespan Multi-vehicle Dial-a-Ride
- Deciding Linear Inequalities by Computing Loop Residues
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Shortest-path feasibility algorithms
- Handbook of metaheuristics
- The Pickup And Delivery Problem With Time Windows And Transshipment
