A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
From MaRDI portal
Publication:3392004
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
Cited in
(93)- Pickup and delivery problem with time windows: a new compact two-index formulation
- The flexible and real-time commute trip sharing problems
- A cutting plane method for solving harvest scheduling models with area restrictions
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- Multi-day fair collaboration in demand-responsive transportation
- Étude comparative de divers modèles pour le problème de transport à la demande
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- 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
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- scientific article; zbMATH DE number 1420897 (Why is no real title available?)
- Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations
- Daily aircraft routing for amphibious ready groups
- Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
- 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
- Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system
- A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- The complexity of the unit stop number problem and its implications to other related problems
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- Exact algorithms for the multi-pickup and delivery problem with time windows
- Event-based MILP models for ridepooling applications
- Verification of correctness of parallel algorithms in practice
- A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases
- 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
- Budget-balanced and strategy-proof auctions for ridesharing
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- Transport of skips between recycling centers and treatment facilities
- 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
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
- 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
- The stop number minimization problem: complexity and polyhedral analysis
- 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
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
- The pickup and delivery problem with time windows and occasional drivers
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- An optimization model and a solution algorithm for the many-to-many car pooling problem
- Selective routing problem with synchronization
- Scheduling heterogeneous multi-load AGVs with battery constraints
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- 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
- Robust data-driven vehicle routing with time windows
- Feeder routing for air-to-air refueling operations
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- A reduction approach to the two-campus transport problem
- A branch-and-price algorithm for a routing problem with inbound and outbound requests
- A deterministic annealing local search for the electric autonomous dial-a-ride problem
- 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
- Recent models and algorithms for one-to-one pickup and delivery problems
- Dynamic transportation of patients in hospitals
- The rich heterogeneous dial-a-ride problem with trip time prediction
- Aesthetic considerations for the min-max \(K\)-windy rural postman problem
- The dial-a-ride problem: Models and algorithms
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Local search heuristics for the probabilistic dial-a-ride problem
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- The value of personalized dispatch in O2O on-demand delivery services
- Typology and literature review for dial-a-ride problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Variable neighborhood search for the dial-a-ride problem
- A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
- A matheuristic for the dial-a-ride problem
- The vehicle routing problem with floating targets: formulation and solution approaches
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- 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
- 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)
