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 linesA hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problemA long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locationsAn adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronizationAn adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronizationDynamic design of sales territoriesAn adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled linesSynchronizing transportation of people with reduced mobility through airport terminalsTrends in transportation and logisticsInterrelated trips in the rural dial-a-ride problem with autonomous vehiclesThe vessel swap-body routing problemAdaptive large neighborhood search for the time-dependent profitable dial-a-ride problemThe rendezvous vehicle routing problemParcel delivery cost minimization with time window constraints using trucks and dronesAdaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery locationThe static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignmentDelivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfersTypology and literature review for dial-a-ride problemsNew mixed integer-programming model for the pickup-and-delivery problem with transshipmentA comparison of two meta-heuristics for the pickup and delivery problem with transshipmentA large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipmentsThe pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approachAnalyzing the benefits of an integrated mobility system using a matheuristic routing algorithmModeling and solving the multimodal car- and ride-sharing problemSolving routing problems with pairwise synchronization constraintsA branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routesVehicle routing with transportable resources: using carpooling and walking for on-site servicesScheduling truck drivers with interdependent routes under European Union regulationsA matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows



Cites Work