The dial-a-ride problem (DARP): variants, modeling issues and algorithms
From MaRDI portal
Publication:1432014
DOI10.1007/s10288-002-0009-8zbMath1097.90008OpenAlexW2017383000MaRDI QIDQ1432014
Gilbert Laporte, Jean-François Cordeau
Publication date: 11 June 2004
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-002-0009-8
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A scheme for determining vehicle routes based on Arc-based service network design, The share-a-ride problem: people and parcels sharing taxis, The complexity of the unit stop number problem and its implications to other related problems, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Twelve surveys in operations research, Tabu search for the real-world carpooling problem, Daily aircraft routing for amphibious ready groups, Measures of dynamism and urgency in logistics, Complexity and approximation results on the shared transportation problem, An effective and fast heuristic for the dial-a-ride problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Solving a selective dial-a-ride problem with logic-based Benders decomposition, An adaptive large neighborhood search heuristic for the share-a-ride problem, Vehicle routing problems with alternative paths: an application to on-demand transportation, A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, A note on the online interval scheduling secretary problem, Interrelated trips in the rural dial-a-ride problem with autonomous vehicles, Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems, An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, The dial-a-ride problem with private fleet and common carrier, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, A dial-a-ride problem for client transportation in a health-care organization, Local search heuristics for the probabilistic dial-a-ride problem, Surveys in operations research, Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints, Real-time split-delivery pickup and delivery time window problems with transfers, The school bus routing and scheduling problem with transfers, Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation, A column generation approach for location-routing problems with pickup and delivery, The demand weighted vehicle routing problem, Eleven surveys in operations research, The dial-a-ride problem: Models and algorithms, A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, Designing the master schedule for demand-adaptive transit systems, A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty, A new VRPPD model and a hybrid heuristic solution approach for e-tailing, A two-stage model for a day-ahead paratransit planning problem, An optimization model and a solution algorithm for the many-to-many car pooling problem, The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method, New Notation and Classification Scheme for Vehicle Routing Problems, A truck scheduling problem arising in intermodal container transportation
