Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
type: Item
instance of: scholarly article
title: Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
zbMATH Open document ID: 1484.90106
author: André L. S. Souza
author: Marcella Bernardo
author: Puca Huachi Vaz Penna
author: Jürgen Pannek
author: M. J. F. Souza
published in: Optimization Letters
publication date: 2022-01-21T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7461754
zbMATH Keywords: dial-a-ride problem
zbMATH Keywords: vehicle routing
zbMATH Keywords: dynamic DARP
zbMATH Keywords: general variable neighborhood search
MaRDI profile type: Publication
full work available at URL: s11590-020-01698-6
OpenAlex ID: W3121080552
cites work: Dynamic transportation of patients in hospitals
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: A variable neighborhood search for flying sidekick traveling salesman problem
cites work: Variable neighborhood search
cites work: Variable neighborhood search: basics and variants
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
cites work: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
cites work: A hybrid heuristic algorithm for the open-pit-mining operational planning problem
cites work: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
DOI: 10.1007/S11590-020-01698-6
description: scientific article; zbMATH DE number 7461754