Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
type: Item
instance of: scholarly article
title: Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
zbMATH Open document ID: 1378.90043
DOI: 10.1007/978-3-319-68496-3_5
author: Sven Vallée
author: A. Oulamara
author: Wahiba Ramdane Cherif-Khettaf
publication date: 2018-01-25T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6829427
zbMATH Keywords: dynamic DARP
zbMATH Keywords: insertion heuristic
zbMATH Keywords: computational experiments
zbMATH Keywords: online heuristic
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: 978-3-319-68496-3 5
OpenAlex ID: W2758766303
Recommended article: Request-Allocation in Dynamic Collaborative Transportation Planning Problems
Recommended article: Dynamic transport scheduling under multiple resource constraints
Recommended article: Approximation and Online Algorithms
Recommended article: Q2728895
Recommended article: Solving large-scale dynamic vehicle routing problems with stochastic requests
Recommended article: Online-Optimization of Large-Scale Vehicle Dispatching Problems
Recommended article: Q2762578
Recommended article: Optimization for dynamic ride-sharing: a review
Recommended article: Optimizing large on-demand transportation systems through stochastic conic programming
description: scientific article; zbMATH DE number 6829427