Hybrid column generation and large neighborhood search for the dial-a-ride problem

DOI10.1016/J.COR.2012.08.004zbMATH Open1349.90119OpenAlexW2100538377WikidataQ41644119 ScholiaQ41644119MaRDI QIDQ339608FDOQ339608

Authors: Sophie N. Parragh, V. Schmid 

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

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

zbMATH Keywords

hybrid algorithmcolumn generationlarge neighborhood searchvariable neighborhood searchdial-a-ride problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Cites Work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Variable neighborhood search
• Variable neighborhood search: Principles and applications
• Handbook of metaheuristics
• The dial-a-ride problem: Models and algorithms
• Variable neighborhood search for the dial-a-ride problem
• 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
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Cited In (34)

• Column generation for real-time ride-sharing operations
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
• On the one-to-one pickup-and-delivery problem with time windows and trailers
• 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
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
• Modelling and solving the senior transportation problem
• 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 exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• Tabu search for the real-world carpooling problem
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
• Comparison of anticipatory algorithms for a dial-a-ride problem
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• Dynamic programming based metaheuristics for the dial-a-ride problem
• Integrated timetabling and vehicle scheduling with balanced departure times
• The dial-A-ride problem with transfers
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
• Optimal charging and repositioning of electric vehicles in a free-floating carsharing system
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• Solving the bus evacuation problem and its variants
• Variable neighborhood search for the dial-a-ride problem
• Online spatio-temporal matching in stochastic and dynamic domains
• Typology and literature review for dial-a-ride problems
• Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
• A survey on matheuristics for routing problems
• An integer programming column generation principle for heuristic search methods
• The paired many-to-many pickup and delivery problem: an application

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)