Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
type: Item
instance of: scholarly article
title: Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
zbMATH Open document ID: 1391.90078
author: Yves Molenbruch
author: Kris Braekers
author: An Caris
author: Greet Vanden Berghe
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6901262
zbMATH Keywords: dial-a-ride problem
zbMATH Keywords: patient transportation
zbMATH Keywords: combination restrictions
zbMATH Keywords: bi-objective optimization
zbMATH Keywords: multi-directional local search
zbMATH Keywords: scheduling procedure
MaRDI profile type: Publication
full work available at URL: j.cor.2016.07.020
OpenAlex ID: W2481715007
cites work: Dynamic transportation of patients in hospitals
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem: Models and algorithms
cites work: Variable neighbourhood search: methods and applications
cites work: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
cites work: Variable neighborhood search for the dial-a-ride problem
cites work: A heuristic two-phase solution approach for the multi-objective 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: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
cites work: Multi-directional local search
cites work: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
DOI: 10.1016/J.COR.2016.07.020
description: scientific article; zbMATH DE number 6901262