A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
From MaRDI portal
Publication:2668616
DOI10.1016/J.COR.2020.105196OpenAlexW3116744303MaRDI QIDQ2668616FDOQ2668616
Authors: Igor Malheiros, Rodrigo Ramalho, Bruno Passeti, Teobaldo L. Bulhões Júnior, A. Subramanian 
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105196
Recommendations
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
Cites Work
- The pickup and delivery problem with time windows
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Variable neighborhood search: Principles and applications
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- The static bike relocation problem with multiple vehicles and visits
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Variable neighborhood search for the dial-a-ride problem
- The share-a-ride problem: people and parcels sharing taxis
- A hybrid algorithm for a class of vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Title not available (Why is that?)
- An efficient implementation of a static move descriptor-based local search heuristic
Cited In (13)
- A heuristic two-phase solution approach for the multi-objective 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
- Efficient GRASP solution approach for the prisoner transportation problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- 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)
This page was built for publication: A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668616)
