A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
From MaRDI portal
Publication:3392004
DOI10.1287/opre.1060.0283zbMath1167.90681OpenAlexW2051358678MaRDI QIDQ3392004
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/12bcd428a4d47a9f3c775d84e9d73033740f8bd6
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Related Items (79)
The flexible and real-time commute trip sharing problems ⋮ An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ A dynamic tree algorithm for peer-to-peer ridesharing matching ⋮ The complexity of the unit stop number problem and its implications to other related problems ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Event-based MILP models for ridepooling applications ⋮ Daily aircraft routing for amphibious ready groups ⋮ The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ Transport of skips between recycling centers and treatment facilities ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ Hybrid column generation and large neighborhood search for the dial-a-ride problem ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ Variable neighborhood search for the dial-a-ride problem ⋮ Feeder routing for air-to-air refueling operations ⋮ A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ Selective routing problem with synchronization ⋮ Scheduling heterogeneous multi-load AGVs with battery constraints ⋮ A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ A branch-and-price algorithm for a routing problem with inbound and outbound requests ⋮ The dial-a-ride problem with private fleet and common carrier ⋮ A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips ⋮ Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed ⋮ A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows ⋮ A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs ⋮ Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system ⋮ Branch‐and‐cut algorithms for the ‐arborescence star problem ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ Budget-balanced and strategy-proof auctions for ridesharing ⋮ Complexity, algorithmic, and computational aspects of a dial-a-ride type problem ⋮ A branch-and-cut algorithm for factory crane scheduling problem ⋮ A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases ⋮ A deterministic annealing local search for the electric autonomous dial-a-ride problem ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Typology and literature review for dial-a-ride problems ⋮ Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation ⋮ Verification of Correctness of Parallel Algorithms in Practice ⋮ Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ Routing by ranking: a link analysis method for the constrained dial-a-ride problem ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ Pickup and delivery problem with time windows: a new compact two-index formulation ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system ⋮ Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ The dial-a-ride problem: Models and algorithms ⋮ The pickup and delivery problem with time windows and occasional drivers ⋮ An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays ⋮ Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations ⋮ Dynamic transportation of patients in hospitals ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading ⋮ The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach ⋮ Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm ⋮ Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive ⋮ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem ⋮ Strong cuts from compatibility relations for the dial-a-ride problem ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem ⋮ Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects ⋮ Robust Data-Driven Vehicle Routing with Time Windows ⋮ The value of personalized dispatch in O2O on-demand delivery services ⋮ Recovery management for a dial-a-ride system with real-time disruptions ⋮ The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method ⋮ The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation ⋮ Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading ⋮ A cutting plane method for solving harvest scheduling models with area restrictions ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
This page was built for publication: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
