Minimum Makespan Multi-vehicle Dial-a-Ride

DOI10.1007/978-3-642-04128-0_48zbMath1256.90014DBLPconf/esa/GortzNR09arXiv1102.5450OpenAlexW2569598970WikidataQ60554461 ScholiaQ60554461MaRDI QIDQ3639273

Inge Li Gørtz, R. Ravi, Viswanath Nagarajan

Publication date: 29 October 2009

Published in: Lecture Notes in Computer Science, ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.5450

zbMATH Keywords

schedulingvehicle routingapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (6)

The dial-A-ride problem with transfers ⋮ Algorithms for online car-sharing problem ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Vehicle routing with subtours ⋮ A comparison of two meta-heuristics for the pickup and delivery problem with transshipment ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes

This page was built for publication: Minimum Makespan Multi-vehicle Dial-a-Ride