A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

DOI10.1287/OPRE.1060.0283zbMATH Open1167.90681OpenAlexW2051358678MaRDI QIDQ3392004FDOQ3392004

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/12bcd428a4d47a9f3c775d84e9d73033740f8bd6

Recommendations

An effective and fast heuristic for the dial-a-ride problem
The dial-a-ride problem: Models and algorithms
The dial-a-ride problem (DARP): variants, modeling issues and algorithms
A matheuristic for the dial-a-ride problem
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
A branch-and-cut algorithm for vehicle routing problems
Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM

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)

Cited In (90)

A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
The flexible and real-time commute trip sharing problems
Routing by ranking: a link analysis method for the constrained dial-a-ride problem
A cutting plane method for solving harvest scheduling models with area restrictions
Vehicle routing problems with alternative paths: an application to on-demand transportation
An effective and fast heuristic for the dial-a-ride problem
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
The dial-a-ride problem with private fleet and common carrier
Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
Title not available (Why is that?)
Solving a selective dial-a-ride problem with logic-based Benders decomposition
Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations
Daily aircraft routing for amphibious ready groups
Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system
The pickup and delivery problem with time windows, multiple stacks, and handling operations
Hybrid column generation and large neighborhood search for the dial-a-ride problem
Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
Exact algorithms for the multi-pickup and delivery problem with time windows
Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots
A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
A comparison of column-generation approaches to the synchronized pickup and delivery problem
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
Recovery management for a dial-a-ride system with real-time disruptions
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
Exact algorithms for the double vehicle routing problem with multiple stacks
A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
A branch-and-cut algorithm for factory crane scheduling problem
The dial-a-ride problem (DARP): variants, modeling issues and algorithms
The pickup and delivery problem with time windows and occasional drivers
Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
An optimization model and a solution algorithm for the many-to-many car pooling problem
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
A branch-and-price algorithm for a routing problem with inbound and outbound requests
Strong cuts from compatibility relations for the dial-a-ride problem
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
Dynamic transportation of patients in hospitals
The dial-a-ride problem: Models and algorithms
A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
Variable neighborhood search for the dial-a-ride problem
Typology and literature review for dial-a-ride problems
Local search heuristics for the probabilistic dial-a-ride problem
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Verification of Correctness of Parallel Algorithms in Practice
Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation
Pickup and delivery problem with time windows: a new compact two-index formulation
Multi-day fair collaboration in demand-responsive transportation
Étude comparative de divers modèles pour le problème de transport à la demande
Branch‐and‐cut algorithms for the ‐arborescence star problem
Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
Robust Data-Driven Vehicle Routing with Time Windows
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs
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
Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
Event-based MILP models for ridepooling applications
Budget-balanced and strategy-proof auctions for ridesharing
Transport of skips between recycling centers and treatment facilities
Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
Selective routing problem with synchronization
Scheduling heterogeneous multi-load AGVs with battery constraints
Feeder routing for air-to-air refueling operations
Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
A deterministic annealing local search for the electric autonomous dial-a-ride problem
The rich heterogeneous dial-a-ride problem with trip time prediction
Aesthetic considerations for the min-max \(K\)-windy rural postman problem
The value of personalized dispatch in O2O on-demand delivery services
A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
Branch and price algorithm for route optimization on customized bus service
Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control

This page was built for publication: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392004)