A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem

DOI10.1016/J.COR.2020.105196MaRDI QIDQ2668616zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

routingiterated local searchmatheuristicsdial-a-ride

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

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

• scientific article; zbMATH DE number 1054963 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A hybrid algorithm for a class of vehicle routing problems
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• An efficient implementation of a static move descriptor-based local search heuristic
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The pickup and delivery problem with time windows
• The share-a-ride problem: people and parcels sharing taxis
• The static bike relocation problem with multiple vehicles and visits
• Typology and literature review for dial-a-ride problems
• Variable neighborhood search for the dial-a-ride problem
• Variable neighborhood search: Principles and applications

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)