Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP

DOI10.1007/978-3-319-68496-3_5zbMath1378.90043OpenAlexW2758766303MaRDI QIDQ1691655

Ammar Oulamara, Sven Vallée, Wahiba Ramdane Cherif-Khettaf

Publication date: 25 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-68496-3_5

zbMATH Keywords

computational experimentsdynamic DARPinsertion heuristiconline heuristic

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)

Related Items (1)

The real-time on-demand bus routing problem: the cost of dynamic requests

Uses Software

• irace

This page was built for publication: Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP