Hybrid column generation and large neighborhood search for the dial-a-ride problem
From MaRDI portal
Publication:339608
DOI10.1016/j.cor.2012.08.004zbMath1349.90119OpenAlexW2100538377WikidataQ41644119 ScholiaQ41644119MaRDI QIDQ339608
Verena Schmid, Sophie N. Parragh
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.004
column generationvariable neighborhood searchdial-a-ride problemlarge neighborhood searchhybrid algorithm
Related Items (25)
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 ⋮ Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ Tabu search for the real-world carpooling problem ⋮ A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem ⋮ Online spatio-temporal matching in stochastic and dynamic domains ⋮ The dial-A-ride problem with transfers ⋮ Solving the bus evacuation problem and its variants ⋮ 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 ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ An integer programming column generation principle for heuristic search methods ⋮ The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment ⋮ Typology and literature review for dial-a-ride problems ⋮ Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ Dynamic programming based metaheuristics for the dial-a-ride problem ⋮ A survey on matheuristics for routing problems ⋮ On the one-to-one pickup-and-delivery problem with time windows and trailers ⋮ Integrated timetabling and vehicle scheduling with balanced departure times ⋮ Optimal charging and repositioning of electric vehicles in a free-floating carsharing system ⋮ The paired many-to-many pickup and delivery problem: an application
Cites Work
- A unified heuristic for a large class of vehicle routing problems with backhauls
- Variable neighborhood search
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
- Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Handbook of metaheuristics
- Variable neighborhood search: Principles and applications
This page was built for publication: Hybrid column generation and large neighborhood search for the dial-a-ride problem
