Hybrid column generation and large neighborhood search for the dial-a-ride problem
From MaRDI portal
(Redirected from Publication:339608)
Recommendations
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Variable neighborhood search for the dial-a-ride problem
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A new extension of local search applied to the Dial-A-Ride problem
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- Handbook of metaheuristics
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search
- Variable neighborhood search for the dial-a-ride problem
- Variable neighborhood search: Principles and applications
Cited in
(34)- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Optimal charging and repositioning of electric vehicles in a free-floating carsharing system
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- Comparison of anticipatory algorithms for a dial-a-ride problem
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Column generation for real-time ride-sharing operations
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- Modelling and solving the senior transportation problem
- On the one-to-one pickup-and-delivery problem with time windows and trailers
- Dynamic programming based metaheuristics for the dial-a-ride problem
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- A survey on matheuristics for routing problems
- Integrated timetabling and vehicle scheduling with balanced departure times
- Solving the bus evacuation problem and its variants
- The paired many-to-many pickup and delivery problem: an application
- Variable neighborhood search for the dial-a-ride problem
- Online spatio-temporal matching in stochastic and dynamic domains
- Tabu search for the real-world carpooling problem
- Typology and literature review for dial-a-ride problems
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- The dial-A-ride problem with transfers
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Hybrid large neighborhood search for the bus rapid transit route design problem
- An integer programming column generation principle for heuristic search methods
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
This page was built for publication: Hybrid column generation and large neighborhood search 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 Q339608)
