A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
type: Item
instance of: scholarly article
title: A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
author: Igor Malheiros
author: Rodrigo Ramalho
author: Bruno Passeti
author: Teobaldo L. Bulhões Júnior
author: A. Subramanian
published in: Computers \& Operations Research
publication date: 2022-03-07T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7485233
zbMATH Keywords: routing
zbMATH Keywords: dial-a-ride
zbMATH Keywords: matheuristics
zbMATH Keywords: iterated local search
MaRDI profile type: MaRDI publication profile
full work available at URL: j.cor.2020.105196
OpenAlex ID: W3116744303
cites work: An efficient implementation of a static move descriptor-based local search heuristic
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: The static bike relocation problem with multiple vehicles and visits
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: The pickup and delivery problem with time windows
cites work: Variable neighborhood search: Principles and applications
cites work: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
cites work: The share-a-ride problem: people and parcels sharing taxis
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
cites work: Typology and literature review for dial-a-ride problems
cites work: Variable neighborhood search for the dial-a-ride problem
cites work: Hybrid column generation and large neighborhood search for the dial-a-ride problem
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
cites work: A hybrid algorithm for a class of vehicle routing problems
cites work: Q4350083
cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem
cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
DOI: 10.1016/J.COR.2020.105196
description: scientific article; zbMATH DE number 7485233